The BANG file: A new kind of grid file

Freeston, Michael

doi:10.1145/38713.38743

Cited by 159 publications

(40 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[GG97] distinguishes three categories of multidimensional point access methods: Techniques based on hashing (grid files [NHS84], EXCELL [Tam82], multi-level grid files [Hin85], twin grid files [HSW88b] and multidimensional hashing [Fal85,Fal88]), hierarchical access methods (K-D-B-Tree [Rob81], LSD-Tree [HSW89], Buddy Tree [SK90], BANG File [Fre87], hB-Tree [LS90], R-Trees [Gut84, SRF87, BKS+90, BKK96]) and space filling curves in combination with one-dimensional access methods [TH81,OM84,Jag90,AS83,FR89]. Yet another access technique is to use a combination of several one-dimensional access methods like inverted files [Lum70,MHW+90] or bitmap index intersection [OQ97].…”

Section: Multidimensional Access Methodsmentioning

confidence: 99%

MISTRAL: Processing Relational Queries using a Multidimensional Access Technique

Markl

2000

Ausgezeichnete Informatikdissertationen 1999

View full text Add to dashboard Cite

PrefaceClassical one dimensional B-trees have been the standard access method of all commercial database systems for many years. This dissertation is a very promising effort to introduce universal B-trees (UB-trees), the multidimensional variant of Btrees, as a basic access method into the core of fundamental DB-technology. The universal relevance of UB-trees is a consequence of the fact, that every relation can be considered as a set of points in multidimensional space. UB-trees organize this space for efficient processing of the data, resulting for many types of queries in orders of magnitude improvement over classical methods.The thesis lays the theoretical foundations of UB-tress, predicts their performance by analytical models and validates these models by experiments using large real world databases and real life applications and queries from the field of datawarehousing. The need to sort data and intermediate results frequently is an annoying drawback of today' s query processing methods. In combination with the Tetris algorithm UBtrees allow to avoid sorting in most cases, leading to dramatic improvements of response time, storage requirement and overall query processing time.Adding a new access method requires to consider all aspects of database systems:-architecture of subsystems -query optimization -query processing -multiuser operation and synchronization -bulk loading -storage requirement -parallelism, etc.Since UB-trees rely on classical B-trees for their implementation, all of these issues can be solved in a satisfactory way and can be dealt with elegantly.The performance experiments reported in this thesis were carried out with an implementation of UB-trees as a middleware layer on top of SQL. Additional performance improvements can be gained by integrating the UB-tree technology in the kernel of database systems.This thesis is a cornerstone of the MISTRAL project. MISTRAL has the goal to introduce UB-trees as a new access method into database systems with the fascinating vision, to extend fundamental database technology in an essential way. MISTRAL is financially supported by SAP, Teijin, NEC, Hitachi, the European Commission, Project MDA, TAS, Gfk and Microsoft. Abstract:A multidimensional access method offering significant performance increases by intelligently partitioning the query space is applied to relational database management systems (RDBMS). We introduce a formal model for multidimensional partitioned relations and discuss several typical query patterns. The model identifies the significance of multidimensional range queries and sort operations. The discussion of current access methods gives rise to the need for a multidimensional partitioning of relations. A detailed analysis of space partitioning focussing especially on Z-ordering illustrates the principle benefits of multidimensional indexes. After describing the UB-Tree and its standard algorithms for insertion, deletion, point queries, and range queries, we introduce the spiral algorithm for nearest neighbor queries with UB-Tree...

show abstract

Section: Multidimensional Access Methodsmentioning

confidence: 99%

MISTRAL: Processing Relational Queries using a Multidimensional Access Technique

Markl

2000

Ausgezeichnete Informatikdissertationen 1999

View full text Add to dashboard Cite

show abstract

“…They are also commonly known as bucketing methods. Traditionally, bucketing methods such as the grid file [23], BANG file [12], LSD trees [16], Buddy trees [31], BV-trees [11], PK trees [33], etc. have usually been applied to points.…”

Section: Sequential Spatial Data Structuresmentioning

confidence: 99%

Data-parallel polygonization

Hoel

Samet

2003

Parallel Computing

View full text Add to dashboard Cite

show abstract

“…A similar idea was used in the one-dimensional case for DL*-trees in [9]. Holey bricks have also been used in [5] and in [13].…”

Section: Introductionmentioning

confidence: 99%

The hB-tree: a multiattribute indexing method with good guaranteed performance

Lomet

Salzberg

1990

ACM Trans. Database Syst.

208

View full text Add to dashboard Cite

A new multiattribute index structure called the hB-tree is introduced. It is derived from the K-D-Btree of Robinson [15] but has additional desirable properties. The hB-tree internode search and growth processes are precisely analogous to the corresponding processes in B-trees [l]. The intranode processes are unique. A k-d tree is used as the structure within nodes for very efficient searching. Node splitting requires that this k-d tree be split. This produces nodes which no longer represent brick-like regions in k-space, but that can be characterized as holey bricks, bricks in which subregions have been extracted. We present results that guarantee hB-tree users decent storage utilization, reasonable size index terms, and good search and insert performance. These results guarantee that the hB-tree copes well with arbitrary distributions of keys.

show abstract

The BANG file: A new kind of grid file

Abstract: A new multi-dimensional file structure has been developed m the course of a project to devise ways of

Cited by 159 publications

References 7 publications

MISTRAL: Processing Relational Queries using a Multidimensional Access Technique

MISTRAL: Processing Relational Queries using a Multidimensional Access Technique

Data-parallel polygonization

The hB-tree: a multiattribute indexing method with good guaranteed performance

Contact Info

Product

Resources

About