2 papers
cs.GL2004
The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data
Saju Jude Dominic, G. Sajith
In a variety of applications, we need to keep track of the development of a data set over time. For maintaining and querying this multi version data I/O-efficiently, external memor…
cs.DS2004
The Random Buffer Tree : A Randomized Technique for I/O-efficient Algorithms
Saju Jude Dominic, G. Sajith
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 operatio…