The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data

Details The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data

2004-04-15

arxiv.org/abs/cs/0404033v1

Computer Science

General Literature

11 pages with no figures, unpublished

Scientific paper

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 memory data structures are required. In this paper, we present a probabilistic self-balancing persistent data structure in external memory called the persistent buffer tree, which supports insertions, updates and deletions of data items at the present version and range queries for any version, past or present. The persistent buffer tree is I/O-optimal in the sense that the expected amortized I/O performance bounds are asymptotically the same as the deterministic amortized bounds of the (single version) buffer tree in the worst case.

Affiliated with

Also associated with

No associations

Rating

The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556650