The Random Buffer Tree : A Randomized Technique for I/O-efficient Algorithms
数据结构与算法
2007-05-23 v1
摘要
In this paper, we present a probabilistic self-balancing dictionary data structure for massive data sets, and prove expected amortized I/O-optimal bounds on the dictionary operations. We show how to use the structure as an I/O-optimal priority queue. The data structure, which we call as the random buffer tree, abstracts the properties of the random treap and the buffer tree and has the same expected I/O-bounds as the buffer tree.
引用
@article{arxiv.cs/0404028,
title = {The Random Buffer Tree : A Randomized Technique for I/O-efficient Algorithms},
author = {Saju Jude Dominic and G. Sajith},
journal= {arXiv preprint arXiv:cs/0404028},
year = {2007}
}
备注
13 pages with no figures, unpublished