R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
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
Design of flash-based DBMS: an in-page logging approach
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Microhash: an efficient index structure for fash-based sensor devices
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
μ-tree: an ordered index structure for NAND flash memory
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
A case for flash memory ssd in enterprise database applications
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A New Dynamic Hash Index for Flash-Based Storage
WAIM '08 Proceedings of the 2008 The Ninth International Conference on Web-Age Information Management
Proceedings of the VLDB Endowment
PBFilter: indexing flash-resident data through partitioned summaries
Proceedings of the 17th ACM conference on Information and knowledge management
In-Page Logging B-Tree for Flash Memory
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Dynamic in-page logging for flash-aware B-tree index
Proceedings of the 18th ACM conference on Information and knowledge management
Lazy-Adaptive Tree: an optimized index structure for flash devices
Proceedings of the VLDB Endowment
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Tree indexing on solid state drives
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
R-Tree structure is widely adopted as a general spatial index with the assumption that the deployed system is equipped with magnetic hard disk. While the application of SSD becomes more and more popular, traditional optimization of R-Tree structure on SSD is much less desirable than that on magnetic hard disk. Existing flash-aware index approaches employ log mechanism to reduce random writes at a cost of large amount of read. A novel index named Log Compact R-Tree (LCR-tree) is proposed in this paper. Distinguished from previous attempts, compacted log is introduced to combine newly arrival log with origin ones on the same node, which renders great decrement of random writes with at most one additional read for each node access. Extensive experiments illustrate that the proposed LCR-Tree can achieve up to 3 times benefit against existing approaches.