Use of graph-theoretic models for optimal relational database accesses to perform join
ACM Transactions on Database Systems (TODS)
Fragmentation: a technique for efficient query processing
ACM Transactions on Database Systems (TODS)
Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
Buffer management in relational database systems
ACM Transactions on Database Systems (TODS)
Performance Analysis of a Database Filter Search Hardware
IEEE Transactions on Computers
ACM Transactions on Database Systems (TODS)
Design and evaluation of parallel pipelined join algorithms
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Optimizing the cost of relational queries using partial-relation schemes
Information Systems
Implementing a generalized access path structure for a relational database system
ACM Transactions on Database Systems (TODS)
Advanced Database Machine Architecture
Advanced Database Machine Architecture
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Join processing in relational databases
ACM Computing Surveys (CSUR)
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Page access scheduling in join processing
Proceedings of the eighth international conference on Information and knowledge management
Efficient Scheduling of Page Access in Index-Based Join Processing
IEEE Transactions on Knowledge and Data Engineering
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
IEEE Transactions on Knowledge and Data Engineering
Extensible Buffer Management of Indexes
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Two graph models are developed to determine the minimum required buffer size for achieving the theoretical lower bound on the number of disk accesses for performing relational joins. Here, the lower bound implies only one disk access per joining block or page. The first graph model is based on the block connectivity of the joining relations. Using this model, the problem of determining an ordered list of joining blocks that requires the smallest buffer is considered. It is shown that this problem as well as the problem of computing the least upper bound on the buffer size is NP-hard. The second graph model represents the page connectivity of the joining relations. It is shown that the problem of computing the least upper bound on the buffer size for the page connectivity model is also NP-hard. Heuristic procedures are presented for the page connectivity model and it is shown that the sequence obtained using the heuristics requires a near-optimal buffer size The authors also show the performance improvement of the proposed heuristics over the hybrid-has join algorithm for a wide range of join factors.