Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Optimizing the performance of a relational algebra database interface
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Evaluation of database access paths
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
An approach to implementing a relational data management system
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
On the optimal nesting order for computing N-relational joins
ACM Transactions on Database Systems (TODS)
Fragmentation: a technique for efficient query processing
ACM Transactions on Database Systems (TODS)
Buffer management in relational database systems
ACM Transactions on Database Systems (TODS)
The Architecture of SM3: A Dynamically Partitionable Multicomputer System
IEEE Transactions on Computers
Heuristics for Join Processing Using Nonclustered Indexes
IEEE Transactions on Software Engineering
Optimization Strategies for Relational Queries
IEEE Transactions on Software Engineering
Optimizing equijoin queries in distributed databases where relations are hash partitioned
ACM Transactions on Database Systems (TODS)
Distributive join: a new algorithm for joining relations
ACM Transactions on Database Systems (TODS)
Join processing in relational databases
ACM Computing Surveys (CSUR)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Disk-tape joins: synchronizing disk and tape access
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
An architecture for query optimization
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Query processing strategies in the PASCAL/R relational database management system
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Managing Locality Sets: The Model and Fixed-Size Buffers
IEEE Transactions on Computers
A Parallel Sort Merge Join Algorithm for Managing Data Skew
IEEE Transactions on Parallel and Distributed Systems
An Observation on Database Buffering Performance Metrics
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A Data Transformation System for Biological Data Sources
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
Sing the truth about ad hoc join costs
The VLDB Journal — The International Journal on Very Large Data Bases
Scheduling of page-fetches in join operations
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Parallelizing query optimization
Proceedings of the VLDB Endowment
Relational nested optional join for efficient semantic web query processing
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Optimization of joins using random record generation method
Proceedings of the 1st Amrita ACM-W Celebration on Women in Computing in India
Early evaluating XML trees in object repositories
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
New algorithms for join and grouping operations
Computer Science - Research and Development
| Hi-index | 0.01 |
This paper presents a new method of computing the product or join of n relations in a paged-memory environment. The method, termed the nested-block method, is an attempt to take maximum advantage of available main-memory buffer space. The problem of finding an optimal allocation of main-memory buffer space for the nested-block method of scanning n relations poses a nonlinear integer-programming problem. This paper first describes the operation of the nested-block method, and derives corresponding cost formula. It then presents an efficient heuristic algorithm for determining a near-optimal allocation of main-memory buffer space. The need to compute the product of relations arises naturally in processing n-relation queries. Conventional techniques for computing the join of relations can be complemented by the nested-block method. This paper examines these two important applications of the nested-block method.