Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes

@inproceedings{Yi2009DynamicIA,
  title={Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes},
  author={Ke Yi},
  booktitle={PODS},
  year={2009}
}
The <i>B-tree</i> is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of <i>N</i> keys, a range query can be answered in <i>O</i>(log<sub><i>B</i></sub> <i>N</i>over<i>M</i> + <i>K</i>over<i>B</i>) I/Os, where <i>B</i> is the disk block size, <i>K</i> the output size, and <i>M</i> the size of the main memory buffer. When keys are inserted or deleted, the B-tree is updated in <i>O</i>(log<sub><i>B</i></sub> <i>N</i>) I… CONTINUE READING

Tables and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-4 OF 4 CITATIONS

Efficient Range-Based Storage Management for Scalable Datastores

  • IEEE Transactions on Parallel and Distributed Systems
  • 2014
VIEW 13 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.