Use of graph-theoretic models for optimal relational database accesses to perform join
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Performance of a Composite Attribute and Join Index
IEEE Transactions on Software Engineering
Heuristics for Join Processing Using Nonclustered Indexes
IEEE Transactions on Software Engineering
Access support in object bases
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Join processing in relational databases
ACM Computing Surveys (CSUR)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Indexing Techniques for Queries on Nested Objects
IEEE Transactions on Knowledge and Data Engineering
Optimal Secondary Storage Access Sequence for Performing Relational Join
IEEE Transactions on Knowledge and Data Engineering
Page access scheduling in join processing
Proceedings of the eighth international conference on Information and knowledge management
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
IEEE Transactions on Knowledge and Data Engineering
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
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Finding data broadness via generalized nearest neighbors
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Accelerating spatial join operations using bit-indices
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
| Hi-index | 0.00 |
This paper examines the issue of scheduling page accesses in join processing, and proposes new heuristics for the following scheduling problems: 1) an optimal page access sequence for a join such that there are no page reaccesses using the minimum number of buffer pages, and 2) an optimal page access sequence for a join such that the number of page reaccesses for a given number of buffer pages is minimum. Our experimental performance results show that the new heuristics perform better than existing heuristics for the first problem and also perform better for the second problem, provided that the number of available buffer pages is not much less than the optimal buffer size.