Query processing techniques for solid state drives
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
On Computational Models for Flash Memory Devices
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
FAWN: a fast array of wimpy nodes
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Lazy-Adaptive Tree: an optimized index structure for flash devices
Proceedings of the VLDB Endowment
Online Paging for Flash Memory Devices
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Flash-aware record management method
Proceedings of the 2010 ACM Symposium on Applied Computing
Enhancing energy efficiency of database applications using SSDs
Proceedings of the Third C* Conference on Computer Science and Software Engineering
On the impact of flash SSDs on spatial indexing
Proceedings of the Sixth International Workshop on Data Management on New Hardware
Data structures: time, I/Os, entropy, joules!
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Tree indexing on solid state drives
Proceedings of the VLDB Endowment
Consistent and durable data structures for non-volatile byte-addressable memory
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Operation-aware buffer management in flash-based systems
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Data management over flash memory
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Log-compact R-tree: an efficient spatial index for SSD
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
FAST: a generic framework for flash-aware spatial trees
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
An efficient multi-tier tablet server storage architecture
Proceedings of the 2nd ACM Symposium on Cloud Computing
Update migration: an efficient B+ tree for flash storage
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Improving database performance using a flash-based write cache
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
An efficient method for record management in flash memory environment
Journal of Systems Architecture: the EUROMICRO Journal
Adapting the b+-tree for asymmetric i/o
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Extending SSD lifetime in database applications with page overwrites
Proceedings of the 6th International Systems and Storage Conference
Making updates disk-I/O friendly using SSDs
Proceedings of the VLDB Endowment
Resolving journaling of journal anomaly in android I/O: multi-version B-tree with lazy split
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
Hi-index | 0.00 |
Large flash disks have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption and other features. However, writes, especially random writes, on the flash disk are inherently much slower than reads because of the erase-before-write mechanism. To address this asymmetry of read-write speeds in indexing on the flash disk, we propose the FD-tree, a tree index designed with the logarithmic method and fractional cascading techniques. With the logarithmic method, an FD-tree consists of the head tree – a small B+-tree on the top, and a few levels of sorted runs of increasing sizes at the bottom. This design is write-optimized for the flash disk; in particular, an index search will potentially go through more levels or visit more nodes, but random writes are limited to the head tree and are subsequently transformed into sequential ones through merging into the lower runs. With the fractional cascading technique, we store pointers, called fences, in lower level runs to speed up the search. We evaluate the FD-tree in comparison with representative B+-tree variants under a variety of workloads. Our results show that the FD-tree has a similar search performance to the standard B+-tree, and a similar update performance to the write-optimized B+-tree variant. As a result, FD-tree outperforms all these B+-tree index variants on both update- and search-intensive workloads.