The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Dynamically Optimizing High-Dimensional Index Structures
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
High-Performance Extensible Indexing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
An efficient R-tree implementation over flash-memory storage systems
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
FlashDB: dynamic self-tuning database for NAND flash
Proceedings of the 6th international conference on Information processing in sensor networks
The five-minute rule twenty years later, and how flash memory changes the rules
DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
A case for flash memory ssd in enterprise database applications
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Fast scans and joins using flash drives
Proceedings of the 4th international workshop on Data management on new hardware
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Query processing techniques for solid state drives
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Join processing for flash SSDs: remembering past lessons
Proceedings of the Fifth International Workshop on Data Management on New Hardware
ELKI in Time: ELKI 0.2 for the Performance Evaluation of Distance Measures for Time Series
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Data management over flash memory
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A Hybrid Approach to Failed Disk Recovery Using RAID-6 Codes: Algorithms and Performance Evaluation
ACM Transactions on Storage (TOS)
Spatial data management over flash memory
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Reverse-k-Nearest-Neighbor join processing
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
Similarity queries are an important query type in multimedia databases. To implement these types of queries, database systems often use spatial index structures like the R*-Tree. However, the majority of performance evaluations for spatial index structures rely on a conventional background storage layer based on conventional hard drives. Since newer devices like solid-state-disks (SSD) have a completely different performance characteristic, it is an interesting question how far existing index structures profit from these modern storage devices. In this paper, we therefore examine the performance behaviour of the R*-Tree on an SSD compared to a conventional hard drive. Testing various influencing factors like system load, dimensionality and page size of the index our evaluation leads to interesting insights into the performance of spatial index structures on modern background storage layers.