ACM Computing Surveys (CSUR)
Query optimization by semantic reasoning
Query optimization by semantic reasoning
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Semantic query optimization in expert systems and database systems
Proceedings from the first international workshop on Expert database systems
Principles of artificial intelligence
Principles of artificial intelligence
A knowledge-based approach to multiple transaction processing and distributed database design
A knowledge-based approach to multiple transaction processing and distributed database design
View indexing in relational databases
ACM Transactions on Database Systems (TODS)
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
A clustering algorithm for hierarchical structures
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Design of Database Structures
Common expression analysis in database applications
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
An optimizing prolog front-end to a relational query system
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Proceedings of the Second International Conference on Data Engineering
New features for a relational database system to support computer aided design
New features for a relational database system to support computer aided design
Hi-index | 0.00 |
The collective processing of multiple queries in a database system has recently received renewed attention due to its capability of improving the overall performance of a database system and its applicability to the design of knowledge-based expert systems and extensible database systems. A new multiple query processing strategy is presented which utilizes semantic knowledge on data integrity and information on predicate conditions of the access paths (plans) of queries. The processing of multiple queries is accomplished by the utilization of subset relationships between intermediate results of query executions, which is inferred employing both semantic knowledge and logical information. Given a set of fixed order access plans, the A* algorithm is used to find the set of reformulated access plans which is optimal for a given collection of semantic knowledge.