5 papers · 1 filter
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…
Set Containment Join Revisited
Panagiotis Bouros, Nikos Mamoulis, Shen Ge +1
Given two collections of set objects and , the set containment join returns all object pairs such that . Bes…
Privacy Preservation by Disassociation
Manolis Terrovitis, John Liagouris, Nikos Mamoulis +1
In this work, we focus on protection against identity disclosure in the publication of sparse multidimensional data. Existing multidimensional anonymization techniquesa) protect th…