Πλοήγηση ανά Θέμα "R-trees"

Efficient query processing on large spatial databases: A performance study

Roumelis G., Vassilakopoulos M., Corral A., Manolopoulos Y. (2017)

Processing of spatial queries has been studied extensively in the literature. In most cases, it is accomplished by indexing spatial data using spatial access methods. Spatial indexes, such as those based on the Quadtree, ...

Join-queries between two spatial datasets indexed by a single R*-tree

Vassilakopoulos, M.; Corral, A.; Karanikolas, N. N. (2011)

A spatial join, a common query in Spatial Databases and Geographical Information Systems (GIS), consists in testing every possible pair of data elements belonging to two spatial datasets against a spatial predicate. This ...

Porting disk-based spatial index structures to flash-based solid state drives

Carniel A.C., Roumelis G., Ciferri R.R., Vassilakopoulos M., Corral A., Aguiar C.D. (2022)

Indexing data on flash-based Solid State Drives (SSDs) is an important paradigm recently applied in spatial data management. During last years, the design of new spatial access methods for SSDs, named flash-aware spatial ...

Predictive join processing between regions and moving objects

Corral, A.; Torres, M.; Vassilakopoulos, M.; Manolopoulos, Y. (2008)

The family of R-trees is suitable for indexing various kinds of multidimensional objects. TPR*-trees are R-tree based structures that have been proposed for indexing a moving object database, e.g. a data-base of moving ...

A Study of R-tree Performance in Hybrid Flash/3DXPoint Storage

Fevgas A., Akritidis L., Alamaniotis M., Tsompanopoulou P., Bozanis P. (2019)

The flash based solid state drives have become the storage medium of choice for many applications, replacing traditional HDDs in almost any data center. Their advent has motivated many research efforts in data management. ...