Utilization of B-trees with inserts, deletes and modifies
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
B-tree page size when caching is considered
ACM SIGMOD Record
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
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Finding hierarchical heavy hitters in data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Approximate NN queries on streams with guaranteed error/performance bounds
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
RCached-tree: an index structure for efficiently answering popular queries
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.89 |
We propose the Cache Coherent B^+-tree (CCB^+-tree), an indexing structure that can improve search performance compared to the traditional B^+-tree. The CCB^+-tree makes use of the unused space in the internal nodes of a B^+-tree to cache frequently queried leaf node addresses, thus saving node accesses. An experimental study shows that the CCB^+-tree can outperform the traditional B^+-tree on workloads where certain queries are much more popular than the others.