Fully persistent B-trees
18
TL;DR: This work introduces an implementation for ephemeral B-trees that supports searches and updates in O ( log B n ) I/Os, using O ( n / B ) blocks, where moreover every update makes a worst-case constant number of modifications to the structure.
read more
About: This article is published in Theoretical Computer Science. The article was published on 12 Nov 2020. and is currently open access.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
I/O-efficient Point Location Using Persistent B-Trees.
Lars Arge,Andrew Danner,Sha-Mayn Teh +2 more
- 01 Jan 2003
TL;DR: An extensive experimental evaluation shows that, on a range of real-world Geographic Information Systems (GIS) data, the developed structure uses a similar number of I/Os as the structure of Vahrenhold and Hinrichs to answer a query, and on a synthetically generated worst-case dataset the structure uses significantly fewer I/ Os.
35
•Posted Content
Minuet: A Scalable Distributed Multiversion B-Tree
TL;DR: Minuet uses main-memory storage to enable low-latency transactional operations as well as analytics queries without compromising transaction performance, and supports writable clones, so that users can create branching versions of the data.
24
Physical Data Warehouse Design Using Neural Network
TL;DR: Neural network based physical design is suggested, a class of artificial neural network known as self-organizing net is used for indexing data warehouse at physical level and accuracy of this selforganizing net based indexing system in mapping key values with distorted keys is found to be high.
A Distributed Indexing Method for Timeline Similarity Query
Zhenwen He,Xiaogang Ma +1 more
TL;DR: The experimental results show that the DTI-tree provides an effective and efficient distributed index solution to big timeline data.
6
Cache-Oblivious Persistence
Pooya Davoodi,Jeremy T. Fineman,John Iacono,Özgür Özkan +3 more
- 08 Sep 2014
TL;DR: This work presents the first general transformation for making cache-oblivious model data structures partially persistent, which takes a data structure and allows queries to be executed on any past state of the structure.
References
Ubiquitous B-Tree
TL;DR: The major variations of the B-tree are discussed, especially the B+-tree, contrasting the merits and costs of each implementation and illustrating a general purpose access method that uses a B- tree.
2.1K
The input/output complexity of sorting and related problems
Alok Aggarwal,S. Vitter Jeffrey +1 more
TL;DR: Tight upper and lower bounds are provided for the number of inputs and outputs (I/OS) between internal memory and secondary storage required for five sorting-related problems: sorting, the fast Fourier transform (FFT), permutation networks, permuting, and matrix transposition.
Organization and maintenance of large ordered indexes
Rudolf Bayer,Edward M. McCreight +1 more
TL;DR: In this paper, the index is maintained with an average of 9 (at least 4) transactions per second on an IBM 360/44 with a 2311 disc and the index pages are organized in a special datastructure, so-called B-trees.
1.3K
Making data structures persistent
James R. Driscoll,Neil Sarnak,Daniel D. Sleator,Robert E. Tarjan +3 more
- 01 Nov 1986
TL;DR: This paper develops simple, systematic, and efficient techniques for making linked data structures persistent, and uses them to devise persistent forms of binary search trees with logarithmic access, insertion, and deletion times and O (1) space bounds for insertion and deletion.
Organization and maintenance of large ordered indices
Rudolf Bayer,E. McCreight +1 more
- 15 Nov 1970
TL;DR: The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logk I where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal.
Related Papers (5)
Gerth Stølting Brodal,Konstantinos Tsakalidis,Spyros Sioutas,Kostas Tsichlas +3 more
- 17 Jan 2012
Xiaocheng Hu,Miao Qiao,Yufei Tao +2 more
- 18 Jun 2014