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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.