B+ Retake: Sustaining High Volume Inserts into Large Data Pages

@inproceedings{Deschler2001BRS,
  title={B+ Retake: Sustaining High Volume Inserts into Large Data Pages},
  author={Kurt W. Deschler and Elke A. Rundensteiner},
  booktitle={DOLAP},
  year={2001}
}
Modern ad-hoc data mining queries often run on databases over a terabyte in size. At this scale, large data pages are required to obtain sufficient disk performance. Unfortunately, these large data pages greatly increase update costs, especially for packed structures such as the B+ tree. In a frequently updated warehouse, users are often forced to decide between query performance and update performance in order to meet maintenance time windows. Solutions that provide both are welcome.In this… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

Fat B−Tree: An Update Conscious Parallel Directory Structure

H. Yokota, Y. Kamemasa, J. Miyazaki
  • Proceedings of the 15th International IEEE Conference on Data Engineering,
  • 1999
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

A Cost Model for the Internal Organization of B+-Tree Nodes

  • ACM Trans. Program. Lang. Syst.
  • 1981
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL