An asymptotically optimal multiversion B-tree

Becker, Bruno; Gschwind, Stephan; Ohler, Thomas; Seeger, Bernhard; Widmayer, Peter

doi:10.1007/s007780050028

Cited by 302 publications

(281 citation statements)

References 19 publications

Supporting

Mentioning

279

Contrasting

Unclassified

Order By: Relevance

“…Along the same line, we plan to examine other quadtree-based STAMs and study their behavior. Preliminary results have been published in [31], where the structure of a multiversion B-tree (see [32]) is extended by accommodating quadcodes instead of ordinary numeric data. In addition, we believe it would be significant to extend the methods presented to grayscale and/or colored images.…”

Section: Resultsmentioning

confidence: 99%

Overlapping Linear Quadtrees and Spatio-Temporal Query Processing

Tzouramanis¹,

Vassilakopoulos²,

Manolopoulos³

2000

The Computer Journal

View full text Add to dashboard Cite

In this paper, indexing in spatio-temporal databases by using the technique of overlapping is investigated. Overlapping has been previously applied in various access methods to combine consecutive structure instances into a single structure, without storing identical sub-structures. In this way, space is saved without sacrificing time performance. A new access method, overlapping linear quadtrees is introduced. This structure is able to store consecutive historical raster images, a database of evolving images. Moreover, it can be used to support query processing in such a database. Five such spatio-temporal queries along with the respective algorithms that take advantage of the properties of the new structure are introduced. The new access method was implemented and extensive experimental studies for space efficiency and query processing performance were conducted. A number of results of these experiments are presented. As far as space is concerned, these results indicate that, in the case of similar consecutive images, considerable storage is saved in comparison to independent linear quadtrees. In the case of query processing, the results indicate that the proposed algorithmic approaches outperform the respective straightforward algorithms, in most cases. The region data sets used in experiments were real images of meteorological satellite views and synthetic random images with specified aggregation.

show abstract

Section: Resultsmentioning

confidence: 99%

Overlapping Linear Quadtrees and Spatio-Temporal Query Processing

Tzouramanis¹,

Vassilakopoulos²,

Manolopoulos³

2000

The Computer Journal

View full text Add to dashboard Cite

show abstract

“…And methods for other version management system are also to be considered. The relation of time to access cost is varying on the system using difference of object structure or multidimensional index structure [1,3,5].…”

Section: Discussionmentioning

confidence: 99%

“…Usual systems preserve a fundamentel file and contents of the change from the previous version as differential information [1,6,9]. The file of a necessary point is retrieved by collecting differential information and appling them fundamental file again.…”

Section: Introductionmentioning

confidence: 99%

The Versioning System Balancing Data Amount and Access Frequency on Distributed Storage System

Nakano

Kobayashi

Watanabe

et al. 2005

21st International Conference on Data Engineering Workshops (ICDEW'05)

View full text Add to dashboard Cite

show abstract

“…All Ψ t and Ψ b structures are implemented in the same basic way, using a (partially) persistent B-tree [8,4]. A persistent B-tree uses O(N/B) blocks, supports updates in O(log B N ) I/Os in the current version of the structure as normal B-trees, and answers range queries in O(log B N + K/B) I/Os in all the previous versions of the structure.…”

Section: Basic Point Enclosure Structurementioning

confidence: 99%

“…The modification of the Ψ t structure is inspired by the so-called hive-graph technique of Chazelle [10]. In order to describe it, we need the following property of a Ψ t structure (that is, of a persistent B-tree), which follows easily from the discussions in [8].…”

Section: Improved Point Enclosure Structurementioning

confidence: 99%

Optimal External Memory Planar Point Enclosure

Arge

Samoladas

2004

Algorithms – ESA 2004

View full text Add to dashboard Cite

Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) such that all K rectangles containing a query point can be reported I/O-efficiently. This problem has important applications in e.g. spatial and temporal databases, and is dual to the important and well-studied orthogonal range searching problem. Surprisingly, we show that one cannot construct a linear sized external memory point enclosure data structure that can be used to answer a query in O(log B N + K/B) I/Os, where B is the disk block size. To obtain this bound, Ω(N/B 1− ) disk blocks are needed for some constant > 0. With linear space, the best obtainable query bound is O(log 2 N + K/B). To show this we prove a general lower bound on the tradeoff between the size of the data structure and its query cost. We also develop a family of structures with matching space and query bounds.

show abstract

An asymptotically optimal multiversion B-tree

Cited by 302 publications

References 19 publications

Overlapping Linear Quadtrees and Spatio-Temporal Query Processing

Overlapping Linear Quadtrees and Spatio-Temporal Query Processing

The Versioning System Balancing Data Amount and Access Frequency on Distributed Storage System

Optimal External Memory Planar Point Enclosure

Contact Info

Product

Resources

About