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