Parallel processing of spatial batch-queries using $${\text {xBR}}^+$$-trees in solid-state drives
George Roumelis, Polychronis Velentzas, Michael Gr. Vassilakopoulos et al. · Cluster Computing · 2019
Cited by 9 works. doi:10.1007/s10586-019-03013-0 Open-access PDF
Authors
- George Roumelis
- Polychronis Velentzas
- Michael Gr. Vassilakopoulos
- Antonio Corral
- Athanasios Fevgas
- Yannis Manolopoulos
References
- The design and analysis of spatial data structures
- The Quadtree and Related Hierarchical Data Structures
- Multidimensional access methods
- An efficient R-tree implementation over flash-memory storage systems
- Platform Storage Performance With 3D XPoint Technology
- Optimizing R-tree for flash memory
- B+-tree index optimization by exploiting internal parallelism of flash-based solid state drives
- Anatomy of a solid-state drive
- Speeding up large-scale point-in-polygon test based spatial join on GPUs
- Efficient indexing data structures for flash-based sensor devices