The Persistent Buffer Tree：一种有效的时态数据I/O索引
The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data
摘要：
在各种应用程序中，我们需要跟踪数据集随时间的发展。为了有效地维护和查询这种多版本数据I/O，需要外部存储器数据结构。在本文中，我们提出了一个概率自平衡持久数据结构在外部存储器中称为持久缓冲树，它支持插入，更新和删除的数据项在当前版本和范围查询的任何版本，过去或现在。持久缓冲树是I/O最优的，在这个意义上，预期的摊销I/O性能界限是渐近相同的确定性摊销界限的（单一版本）缓冲树在最坏的情况。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
