FliX flips the indexing paradigm by mapping GPU compute to data buckets and using batch binary search, delivering up to 6.5x lower query latency and 4x better throughput per memory than leading GPU B-trees and LSM-trees.
VLDB Endow.10, 3 (Nov
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.DB 2years
2026 2verdicts
UNVERDICTED 2roles
baseline 1polarities
baseline 1representative citing papers
ReCAP enables relational DBMS like DuckDB to push property constraints deep into path query plans for speedups up to 400,000x over state-of-the-art graph and relational systems.
citing papers explorer
-
FliX: Flipped-Indexing for Scalable GPU Queries and Updates
FliX flips the indexing paradigm by mapping GPU compute to data buckets and using batch binary search, delivering up to 6.5x lower query latency and 4x better throughput per memory than leading GPU B-trees and LSM-trees.
-
Efficient Path Query Processing in Relational Database Systems
ReCAP enables relational DBMS like DuckDB to push property constraints deep into path query plans for speedups up to 400,000x over state-of-the-art graph and relational systems.