Between Dec 19, 2024 and Jan 2, 2025, datasets can be submitted to DRUM but will not be processed until after the break. Staff will not be available to answer email during this period, and will not be able to provide DOIs until after Jan 2. If you are in need of a DOI during this period, consider Dryad or OpenICPSR. Submission responses to the UDC may also be delayed during this time.
 

Efficient Join-Index-Based Join Processing: A Clustering Approach

Loading...
Thumbnail Image

View/Download File

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Efficient Join-Index-Based Join Processing: A Clustering Approach

Published Date

1999-08-06

Publisher

Type

Report

Abstract

A Join Index is a data structure used for processing join queries in databases. Join indices usepre-computation techniques to speed up online query processing and are useful for data-sets which are updated infrequently. The cost of join computation using a join-index with limited buffer space depends primarily on the page-access sequence used to fetch the pages of the base relations. Given the join-index, we introduce a suite of methods based on clustering to compute the joins. We derive upper-bounds on the lengths of the page-access sequences. Experimental results with Sequoia 2000 data sets show that the clustering method outperforms the existing methods based on sorting and online-clustering heuristics.

Keywords

Description

Related to

Replaces

License

Series/Report Number

Technical Report; 99-030

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Other identifiers

Suggested citation

Shekhar, Shashi; Lu, Chang-tien; Chawla, Sanjay. (1999). Efficient Join-Index-Based Join Processing: A Clustering Approach. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215386.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.