Implementing a relational database by means of specialzed hardware
ACM Transactions on Database Systems (TODS)
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Systolic (VLSI) arrays for relational database operations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
A relational database machine architecture
CAW '80 Proceedings of the fifth workshop on Computer architecture for non-numeric processing
Fragmentation: a technique for efficient query processing
ACM Transactions on Database Systems (TODS)
Heuristics for Join Processing Using Nonclustered Indexes
IEEE Transactions on Software Engineering
Join processing in relational databases
ACM Computing Surveys (CSUR)
Towards an efficient management of objects in a distributed environment
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Page access scheduling in join processing
Proceedings of the eighth international conference on Information and knowledge management
Managing Locality Sets: The Model and Fixed-Size Buffers
IEEE Transactions on Computers
Optimal Secondary Storage Access Sequence for Performing Relational Join
IEEE Transactions on Knowledge and Data Engineering
Utilizing Page-Level Join Index for Optimization in Parallel Join Execution
IEEE Transactions on Knowledge and Data Engineering
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
| Hi-index | 0.00 |
A graph model is presented to analyze the performance of a relational join. The amount of page reaccesses, the page access sequence, and the amount of buffer needed are represented in terms of graph parameters. By using the graph model formed from the index on the join attributes, we determine the relationships between these parameters. Two types of buffer allocation strategies are studied, and the upper bound on the buffer size with no page reaccess is given. This bound is shown to be the maximum cut value of a graph. Hence, the problem of computing this upper bound is NP-hard. We also give algorithms to determine a page access sequence requiring a near optimal buffer size with no page reaccess. The optimal page access sequence for a fixed buffer size has also been considered.