Academic
Publications
Evaluating Functional Joins Along Nested Reference Sets in Object-Relational and Object-Oriented Databases

Evaluating Functional Joins Along Nested Reference Sets in Object-Relational and Object-Oriented Databases,Reinhard Braumandl,Jens Claußen,Alfons Kemp

Evaluating Functional Joins Along Nested Reference Sets in Object-Relational and Object-Oriented Databases   (Citations: 13)
BibTex | RIS | RefWorks Download
Previous work on functional joins was constrained in two ways: (1) all approaches we know as- sume references being implemented as physical object identifiers (OIDs) and (2) most approaches are, in addition, limited to single-valued refer- ence attributes. Both are severe limitations since most object-relational and all object-oriented da- tabase systems do support nested reference sets and many object systems do implement references as location-independent (logical) OIDs. In this work, we develop a new functional join algo- rithm that can be used for any realization form for OIDs (physical or logical) and is particu- larly geared towards supporting functional joins along nested reference sets. The algorithm can be applied to evaluate joins along arbitrarily long path expressions which may include one or more reference sets. The new algorithm generalizes previously proposed partition-based pointer joins by repeatedly applying partitioning with inter- leaved re-merging before evaluating the next func- tional join. Consequently, the algorithm is termed P(PM)*M where P stands for partitioning and M denotes merging. Our prototype implementation as well as an analytical assessment based on a cost model prove that this new algorithm performs su- perior in almost all database configurations.
Conference: Very Large Data Bases - VLDB , pp. 110-122, 1998
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: