5 papers · 1 filter
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…
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…
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…
A Two-level Spatial In-Memory Index
Dimitrios Tsitsigkos, Konstantinos Lampropoulos, Panagiotis Bouros +2
Very large volumes of spatial data increasingly become available and demand effective management. While there has been decades of research on spatial data management, few works con…
Parallel In-Memory Evaluation of Spatial Joins
Dimitrios Tsitsigkos, Panagiotis Bouros, Nikos Mamoulis +1
The spatial join is a popular operation in spatial database systems and its evaluation is a well-studied problem. As main memories become bigger and faster and commodity hardware s…