22 citations · 43 across the 7 of their papers we have counts for
7 papers
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…
Two-layer Space-oriented Partitioning for Non-point Data
Dimitrios Tsitsigkos, Panagiotis Bouros, Konstantinos Lampropoulos +2
Non-point spatial objects (e.g., polygons, linestrings, etc.) are ubiquitous. We study the problem of indexing non-point objects in memory for range queries and spatial intersectio…
Data-driven soiling detection in PV modules
Alexandros Kalimeris, Ioannis Psarros, Giorgos Giannopoulos +3
Soiling is the accumulation of dirt in solar panels which leads to a decreasing trend in solar energy yield and may be the cause of vast revenue losses. The effect of soiling can b…
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…