Use of graph-theoretic models for optimal relational database accesses to perform join
ACM Transactions on Database Systems (TODS)
On optimizing an SQL-like nested query
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
The working set model for program behavior
Communications of the ACM
Evaluation of database access paths
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Principles of Database Systems
Principles of Database Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A new way to compute the product and join of relations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Join processing in relational databases
ACM Computing Surveys (CSUR)
Incremental computation of nested relational query expressions
ACM Transactions on Database Systems (TODS)
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
A New Algorithm for Page Access Sequencing in Join Processing
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Page Access Sequencing in Join Processing with Limited Buffer Space
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
A matching-based algorithm for page access sequencing in join processing
Journal of Systems and Software
| Hi-index | 0.01 |
The author examines join processing when the access paths available are nonclustered indexes on the joining attribute(s) for both relations involved in the join. He uses a bipartite graph model to represent the pages from the two relations that contain tuples to be joined. The minimization of the number of page accesses needed to compute a join in the author's database environment is explored from two perspectives. The first is to reduce the maximum buffer size so that no page is accessed more than once, and the second is to reduce the number of page accesses for a fixed buffer size. The author has developed heuristics for these problems. He gives performance comparisons of these heuristics and another method that recently appeared in the literature. Results show that one particular heuristic performs very well for addressing the problem from either perspective.