A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
VAST-Tree
2012
Proceedings of the 15th International Conference on Extending Database Technology - EDBT '12
We propose a compact and ecient index structure for massive data sets. Several indexing techniques are widely-used and well-known such as binary trees and B+trees. Unfortunately, we nd that these techniques suer major two shortcomings when applied to massive sets; rst, their indices are so large they could overow regular main memory, and, second, they suer from a variety of penalties (e.g., conditional branches, low cache hits, and TLB misses), which restricts the number of instructions
doi:10.1145/2247596.2247643
dblp:conf/edbt/YamamuroOHY12
fatcat:aowshe4vfvhrbae2sctirwbqqq