The skd-tree partitions space into multiple slices per node along one dimension, compresses splitters, and applies a constant number of SIMD instructions per node to reduce levels and computations for multi-dimensional queries.
Nguyen, Tim Kaldewey, Victor W
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DB 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Data Path Fusion fuses a sequence of data path operations into a single GPU kernel, delivering 2.66-6.22x speedups on TPC-H and 3.84-16.81x on SSB over prior GPU database approaches.
citing papers explorer
-
In-memory Multidimensional Indexing Using the skd-tree
The skd-tree partitions space into multiple slices per node along one dimension, compresses splitters, and applies a constant number of SIMD instructions per node to reduce levels and computations for multi-dimensional queries.
-
Data Path Fusion in GPU for Analytical Query Processing
Data Path Fusion fuses a sequence of data path operations into a single GPU kernel, delivering 2.66-6.22x speedups on TPC-H and 3.84-16.81x on SSB over prior GPU database approaches.