Join strategies using data space partitioning

Date

1988-06-01

Author

Ozkarahan, Esen A.
Bozşahin, Hüseyin Cem

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

14
views

0
downloads

Cite This

In the recent investigations of reducing the relational join operation complexity several hash-based partitioned-join stategies have been introduced. All of these strategies depend upon the costly operation of data space partitioning before the join can be carried out. We had previously introduced a partitioned-join based on a dynamic and order preserving multidimensional data organization called DYOP. The present study extends the earlier research on DYOP and constructs a simulation model. The simulation studies on DYOP and subsequent comparisons of all the partitioned-join methodologies including DYOP have proven that space utilization of DYOP improves with the increasing number of attributes. Furthermore, the DYOP based join outperforms all the hash-based methodologies by greatly reducing the total I/O bandwidth required for the entire partitioned-join operation. The comparison model is independent of the architectural issues such as multiprocessing, multiple disk usage, and large memory availability all of which help to further increase the efficiency of the operation. © 1988 Ohmsha, Ltd. and Springer.

Subject Keywords

Architectures, Data Partitioning, Database Machines, Join, Multi-dimensional Order Preserving, Partitioned Joins, Performance Simulation, Projection, Relational Databases/Algebra

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0039612741&origin=inward
https://hdl.handle.net/11511/107014

Collections

Graduate School of Informatics, Article