0000000000873721

AUTHOR

Manolis Terrovitis

showing 3 related works from this author

A Two-level Spatial In-Memory Index

2020

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 consider the current state of commodity hardware, having relatively large memory and the ability of parallel multi-core processing. In this work, we re-consider the design of spatial indexing under this new reality. Specifically, we propose a main-memory indexing approach for objects with spatial extent, which is based on a classic regular space partitioning into disjoint tiles. The novelty of our index is that the contents of each tile are further partitioned into four classes. This second-level partitioning not onl…

FOS: Computer and information sciencesComputer Science - DatabasesDatabases (cs.DB)
researchProduct

Parallel In-Memory Evaluation of Spatial Joins

2019

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 supports parallel processing, there is a need to revamp classic join algorithms which have been designed for I/O-bound processing. In view of this, we study the in-memory and parallel evaluation of spatial joins, by re-designing a classic partitioning-based algorithm to consider alternative approaches for space partitioning. Our study shows that, compared to a straightforward implementation of the algorithm, our tuning can improve performance significantly. We also show how to select appropriate partitioning parame…

FOS: Computer and information sciencesComputer Science - DatabasesComputer Science - Distributed Parallel and Cluster ComputingParallel processing (DSP implementation)Computer scienceOrder (business)JoinsJoin (sigma algebra)Databases (cs.DB)Parallel computingDistributed Parallel and Cluster Computing (cs.DC)Computer Science::Databases
researchProduct

A Two-layer Partitioning for Non-point Spatial Data

2021

Non-point spatial objects (e.g., polygons, linestrings, etc.) are ubiquitous and their effective management is always timely. We study the problem of indexing non-point objects in memory. We propose a secondary partitioning technique for space-oriented partitioning indices (e.g., grids), which improves their performance significantly, by avoiding the generation and elimination of duplicate results. Our approach is novel and of a high impact, as (i) it is extremely easy to implement and (ii) it can be used by any space-partitioning index. We show how our approach can be used to boost the performance of spatial range queries. We also show how we can avoid performing the expensive refinement s…

Information engineeringDistributed databaseRange query (data structures)Computer scienceSearch engine indexingScalabilityTwo layerPoint (geometry)Data miningcomputer.software_genreSpatial analysiscomputer
researchProduct