Please use this identifier to cite or link to this item:
Title: Framework for scheduling partition-based joins
Authors: Tan, K.-L. 
Yu, J.X.
Keywords: Join process
Partition-based joins
Three-phase scheduling framework
Issue Date: Jul-1997
Citation: Tan, K.-L.,Yu, J.X. (1997-07). Framework for scheduling partition-based joins. Computer Systems Science and Engineering 12 (4) : 263-273. ScholarBank@NUS Repository.
Abstract: This paper presents a framework for scheduling partition-based joins. Partition-based joins are commonly used in databases, be it relation-al,temporal or spatial databases. Under a partition-based algorithm,the data are organized into partitions. During the join process, a partition in one relation only needs to join with some, but not all, partitions of the other relation. Depending on the orders in which partitions are processed, the number of I/Os incurred varies. We propose a three-phase scheduling framework to minimize the number I/Os incurred. From the framework, a large number of scheduling strategies can be derived. We also demonstrate the effectiveness of the framework on an application - temporal intersection join in temporal databases.
Source Title: Computer Systems Science and Engineering
ISSN: 02676192
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Oct 11, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.