The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
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
Distributed Recovery in Fault-Tolerant Multiprocessor Networks
IEEE Transactions on Computers
ACM Transactions on Database Systems (TODS)
A database machine based on the data distribution approach
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Transactions on large-scale data- and knowledge-centered systems II
Transactions on large-scale data- and knowledge-centered systems II
Finding data broadness via generalized nearest neighbors
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
| Hi-index | 0.00 |
One of the major problems of relational database systems is to find efficient procedures for database operations. This paper discusses procedures to schedule join operations in a paging environment. We assume that the two relations required to be joined are divided into pages and that only a subset of all page-pairs (one page from each relation) are required to be processed. The number of page swappings varies depending on the sequence of the page-pair processing. Our problem is to find the schedules which require the least page-swapping counts. The problem, however, can be represented as a special case of the Hamiltonian path problem and thus it is shown to be NP-complete. Two sufficient conditions for the existence of the minimum solutions are shown, which are based on the Hamiltonian path condition and the Eular path condition. Using these conditions, heuristic procedures for near optimum solutions are obtained.