Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
A preliminary system for the design of DBTG data structures
Communications of the ACM
Fundamentals of Computer Alori
Fundamentals of Computer Alori
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
An extended relational algebra with control over duplicate elimination
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
View Processing in MULTIBASE, A Heterogeneous Database System
ER '81 Proceedings of the Second International Conference on the Entity-Relationship Approach to Information Modeling and Analysis
Using the Entity-Relationship Model for Implementing Multi-Model Database Systems
ER '81 Proceedings of the Second International Conference on the Entity-Relationship Approach to Information Modeling and Analysis
Implications of data independence on the architecture of database management systems
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
DATAPLEX: an access to heterogeneous distributed databases
Communications of the ACM
Federated database systems for managing distributed, heterogeneous, and autonomous databases
ACM Computing Surveys (CSUR) - Special issue on heterogeneous databases
A database management capability for Ada
WADAS '85 Proceedings of the second annual Washington Ada symposium on Ada: Ada in the mainstream: applications and education
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Range nesting: a fast method to evaluate quantified queries
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Processing queries with quantifiers a horticultural approach
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Combining relational and network retrieval methods
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Query Optimization by Stored Queries
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Processing Queries Over Generalization Hierarchies in a Multidatabase System
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Local query translation and optimization in a distributed system
AFIPS '83 Proceedings of the May 16-19, 1983, national computer conference
DBToaster: higher-order delta processing for dynamic, frequently fresh views
Proceedings of the VLDB Endowment
| Hi-index | 0.02 |
One of the tasks of MULTIBASE, a system for integrated access to heterogeneous distributed databases, is to present a high-level query interface to navigational systems such as CODASYL. The interface compiles queries into efficient programs that implement the queries. The principal problem in constructing such an interface is access path optimization, i.e., the selection of an optimal sequence of access paths that must be traversed to process a given query. This paper identifies a class of queries for which efficient programs can be synthesized. It characterizes the strategies for processing a given query, and shows how to synthesize a program for implementing each strategy. It develops a model for estimating the cost of executing a program, and uses this model to find the optimal strategy for processing a given query.