3 papers
cs.DB2026
In-memory Multidimensional Indexing Using the skd-tree
Achilleas Michalopoulos, Dimitrios Tsitsigkos, Nikos Mamoulis
In this paper, we revisit the problem of indexing multi-dimensional data in memory for the efficient support of multi-dimensional range queries and nearest neighbor queries. This i…
cs.DB2026
CRISP: Correlation-Resilient Indexing via Subspace Partitioning
Dimitris Dimitropoulos, Achilleas Michalopoulos, Dimitrios Tsitsigkos +1
As the dimensionality of modern learned representations increases to thousands of dimensions, the state-of-the-art Approximate Nearest Neighbor (ANN) indices exhibit severe limitat…
cs.DB2025
BS-tree: A gapped data-parallel B-tree
Dimitrios Tsitsigkos, Achilleas Michalopoulos, Nikos Mamoulis +1
We propose BS-tree, an in-memory implementation of the B+-tree that adopts the structure of the disk-based index (i.e., a balanced, multiway tree), setting the node size to a memor…