Range Nesting: A Fast Method to Evaluate Quantified Queries
32 Pages Posted: 31 Oct 2008
Date Written: December 1982
Abstract
Database queries explicitly containing existentialand universal quantification become increasingly importantin a number of areas such as integrity checking, interactionof databases, and statistical databases. Using aconcept of range nesting in relational calculus expressions,the paper describes evaluation algorithms and transformationmethods for an important class of quantified relational calculusqueries called perfect expressions. This class includeswell-known classes of "easy" queries such as tree queries(with free and existentially quantified variables only), andcomplacent (disconnected) queries.
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
An Optimizing Prolog Front-End to a Relational Query System
By Matthias Jarke, James Clifford, ...
-
Common Subexpression Isolation in Multiple Query Optimization
-
Access to Specific Declarative Knowledge by Expert Systems: The Impact of Logic Programming
By Yannis Vassiliou, James Clifford, ...
-
Logic-Based Formula Management Strategies in an Actuarial Consulting System
-
Designing Expert Systems in a Business Environment
By James Clifford, Matthias Jarke, ...
-
Database Access Requirements of Knowledge-Based Systems
By Yannis Vassiliou, Jim Clifford, ...
-
Query Processing Strategies in the Pascal/R Relational Database Management System
By Matthias Jarke and Joachim W. Schmidt
-
Introduction to Query Processing
By Matthias Jarke, Jurgen Koch, ...
-
External Semantic Query Simplification: a Graph-Theoretic Approach and its Implementation in Prolog