Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Making B+- trees cache conscious in main memory
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
Fractal prefetching B+-Trees: optimizing both cache and disk performance
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Proceedings of the 17th International Conference on Data Engineering
Cache Conscious Indexing for Decision-Support in Main Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Effect of node size on the performance of cache-conscious B+-trees
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SIAM Journal on Computing
Making CSB+-Trees processor conscious
DaMoN '05 Proceedings of the 1st international workshop on Data management on new hardware
FlashDB: dynamic self-tuning database for NAND flash
Proceedings of the 6th international conference on Information processing in sensor networks
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
An efficient B-tree layer implementation for flash-memory storage systems
ACM Transactions on Embedded Computing Systems (TECS)
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Data management over flash memory
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Designing a flash-aware two-level cache
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
| Hi-index | 0.00 |
We present an indexing structure for secondary storage based on the B+-tree, but tailored for asymmetric i/o. In contrast to the traditional B+-tree, the tree is not kept balanced at all times; rather, it is kept unbalanced to cope with the i/o asymmetry commonly found in contemporary systems. We identify when imbalance is beneficial and present the unbalanced B+-tree, or the uB+-tree, its maintenance algorithms and its variants. We evaluate the uB+-tree by comparing it to the B+-tree. Our results show that the uB+-tree is highly competitive and significantly outperforms the B+-tree in environments of asymmetric i/o.