Short Note: Implementation of Overlapping B-Trees for Time and Space Efficient Representation of Collections of Similar Files

Burton, F. Warren; Kollias, John G.; Matsakis, D. G.; Kollias, V. G.

doi:10.1093/comjnl/33.3.279

Cited by 34 publications

(17 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The idea was applied to B-trees in Burton et al [1990] and R-trees in Xu et al [1990] and Nascimento and Silva [1998]. The resulting structures were called overlapping B-trees (OVB-trees) and historical R-trees (HR-trees), respectively.…”

Section: Overlapping and Multiversion Access Methodsmentioning

confidence: 99%

Cost models for overlapping and multiversion structures

Tao

Papadias

Zhang

2002

ACM Trans. Database Syst.

View full text Add to dashboard Cite

Overlapping and multiversion techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databases. Although both frameworks have produced numerous efficient indexing methods, their performance analysis is rather limited; as a result there is no clear understanding about the behavior of the alternative structures and the choice of the best one, given the data and query characteristics. Furthermore, query optimization based on these methods is currently impossible. These are serious problems due to the incorporation of overlapping and multiversion techniques in several traditional (e.g., financial) and emerging (e.g., spatiotemporal) applications. In this article, we reduce performance analysis of overlapping and multiversion structures to that of the corresponding ephemeral structures, thus simplifying the problem significantly. This reduction leads to accurate cost models that predict the sizes of the trees, the node/page accesses, and selectivity of queries. Furthermore, the models offer significant insight into the behavior of the structures and provide guidelines about the selection of the most appropriate method in practice. Extensive experimentation proves that the proposed models yield errors below 5 and 15% for uniform and nonuniform data, respectively.

show abstract

Section: Overlapping and Multiversion Access Methodsmentioning

confidence: 99%

Cost models for overlapping and multiversion structures

Tao

Papadias

Zhang

2002

ACM Trans. Database Syst.

View full text Add to dashboard Cite

show abstract

“…Burton et al [5,6] proposed the concept of overlapping trees to index text files evolving over time. Later, the idea was applied to handle the evolving B þ -tree [14].…”

Section: Indexing Past and Nowmentioning

confidence: 99%

“…The MO-Cube adopts an overlapping technique [5,6]. For each cell, several MO-Slice instances are constructed at different timestamps.…”

Section: Overlapping the Mo-slicesmentioning

confidence: 99%

Adaptive cell-based index for moving objects

Choi

Moon

Lee

2004

Data & Knowledge Engineering

View full text Add to dashboard Cite

“…The references used by RBVM to shared parts with previous versions is reminiscent of the version sharing supported in EXODUS [4] and the Overlapping B-trees [3]. In these approaches a B+-tree is used to represent the physical storage of a large object and subsequent versions share common paths of this B+-tree with the previous version.…”

Section: The Reference-based Schemementioning

confidence: 99%

Efficient schemes for managing multiversionXML documents

Chien

Tsotras

Zaniolo

2002

The VLDB Journal The International Journal on Very Large Data B

View full text Add to dashboard Cite

Abstract. Multiversion support for XML documents is needed in many critical applications, such as software configuration control, cooperative authoring, web information warehouses, and "e-permanence" of web documents. In this paper, we introduce efficient and robust techniques for: (i) storing and retrieving; (ii) viewing and exchanging; and (iii) querying multiversion XML documents. We first discuss the limitations of traditional version control methods, such as RCS and SCCS, and then propose novel techniques that overcome their limitations. Initially, we focus on the problem of managing secondary storage efficiently, and introduce an edit-based versioning scheme that enhances RCS with an effective clustering policy based on the concept of page-usefulness. The new scheme drastically improves version retrieval at the expense of a small (linear) space overhead. However, the edit-based approach falls short of achieving objectives (ii) and (iii). Therefore, we introduce and investigate a second scheme, which is reference-based and preserves the structure of the original document. In the reference-based approach, a multiversion document can be represented as yet another XML document, which can be easily exchanged and viewed on the web; furthermore, simple queries are also expressed and supported well under this representation. To achieve objective (i), we extend the page-usefulness clustering technique to the reference-based scheme. After characterizing the asymptotic behavior of the new techniques proposed, the paper presents the results of an experimental study evaluating and comparing their performance.

show abstract

Short Note: Implementation of Overlapping B-Trees for Time and Space Efficient Representation of Collections of Similar Files

Cited by 34 publications

References 0 publications

Cost models for overlapping and multiversion structures

Cost models for overlapping and multiversion structures

Adaptive cell-based index for moving objects

Efficient schemes for managing multiversionXML documents

Contact Info

Product

Resources

About