activity
20132026
most citedFinding k-Dissimilar Paths with Minimum Collective Length

23 citations · 84 across the 8 of their papers we have counts for

collaborators

8 papers

cs.DB2026

Indexicon: A Spatial Indexing Library

Panagiotis Simatis, Panagiotis Bouros, Nikos Mamoulis

Spatial indexing is foundational to Geographic Information Systems (GIS) and multi-dimensional data management, yet the current open-source landscape poses a significant barrier to…

cs.DB2023

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…

cs.DB2021

HINT: A Hierarchical Index for Intervals in Main Memory

George Christodoulou, Panagiotis Bouros, Nikos Mamoulis

Indexing intervals is a fundamental problem, finding a wide range of applications. Recent work on managing large collections of intervals in main memory focused on overlap joins an…

cs.DB2020★ 2 cited

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…

cs.DB2019★ 19 cited

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…

cs.DS2018★ 23 cited

Finding k-Dissimilar Paths with Minimum Collective Length

Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper +2

Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we st…

cs.DB2016★ 22 cited

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…

cs.DS2013★ 18 cited

Routing Directions: Keeping it Fast and Simple

Dimitris Sacharidis, Panagiotis Bouros

The problem of providing meaningful routing directions over road networks is of great importance. In many real-life cases, the fastest route may not be the ideal choice for providi…