Abstract
The paper examines query subsumptions in a relational context and develops a general subsumption technique for queries with function-free firstorder predicates. The predicates are compacted (removing redundant terms) and then expressed as of a disjunction of conjunctions without negations, which is then transformed into a canonical form, along with the rest of the query. Queries in this form are then checked for both result and attribute subsumptions. In the process it highlights some of the logical pitfalls and discusses how they are taken into account in the proposed technique. A filter is then used to derive the new query from the old one.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Al-Qasem, M. and S. Deen. “Query Subsumption” In Proceedings of the third International Conference of Flexible Query Answering Systems (FQAS’98), T. Andreasen et al. (eds), Roskilde University, Denmark, May 1998; Springer, 1998.
Beneventano, D. et al, “Using Subsumption in Semantic Query Optimization”. IJCAI Workshop on Object-Based Representation System, Chambery, France, August 1993
Bergamaschi, S., “Extraction of Informations from Highly Heterogeneous Sources of Textual Data”. Proceeding of the First International Workshop of Cooperative Information Agents(CIA’97), Kiel, Germany, February 1997.
Chan, Em., “Containment and Minimization of Positive Conjunctive Queries in OODB’s”. In Proceeding of 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database Systems. PP 202–211, 1992.
Chang, K. et al, “Predicate Rewriting for Translation Boolean Query in a Heterogeneous Information System”. available at http://wwwdb.stanfors.edu/pub/papers/pred_rewriting.ps.
Chang, K. et al, “Boolean Query Mapping Across Heterogeneous Information Sources”. IEEE Transaction on Knowledge and Data Engineering, Vol. 8, NO. 4, 1996.
Chu, W. and Q. Chen, “A Structure Approach for Cooperative Query Answering”. IEEE Transaction on Knowledge and Data Engineering, Vol. 6, NO. 5, pp738–749, 1994.
Deen, S., “An Architectural Framework For CKBS Applications”. IEEE Transaction on Knowledge and Data Engineering, Vol. 8, NO. 4, 1996.
Garcia-Molina, H. et al, “The TSIMMIS Approach to Mediation: Data Models and Languages”. Journal Of Intelligent Information Systems 8, pp 117–132, 1997.
Harinarayan, V. and Ai. Gupta, “Optimization Using Tuple Subsumption”. In Database Theory-ICDT’95, 5th International Conference Proceeding, edited by G. Gottlob and M. Vardi. Prague, Czech Republic, January 1995.
Mena, Em. et al, “OBSERVER: An Approach for Query Processing in Global Information Systems Based on Interoperation Across Pre-existing Ontologies”. Proceedings of the First IFCIS International Conference on Cooperative Information Systems (CoopIS’96), Brusseles, Belgium, June 1996.
Papakonstantinou, Y. et al, “A Query Translation Schema for Rapid Implementation of Wrappers”. available at: ftp://db.stanford.edu/pub/papakonstantinou/1995/querytranextended.ps.
Staudt, M. and V. Thadden, “A Generic Subsumption Testing Toolkit for Knowledge Base Queries”. In 7th International Conference, DEXA’96, Proceeding, edited by R. Wagner and H. Thoma. Zurich, Switzerland, September 1996.
Ullman, J., “Principles of Database and Knowledge-Base Systems”, Volume 2. Computer Science Press, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deen, S.M., Al-Qasem, M. (1999). A Query Subsumption Technique. In: Bench-Capon, T.J., Soda, G., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1999. Lecture Notes in Computer Science, vol 1677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48309-8_34
Download citation
DOI: https://doi.org/10.1007/3-540-48309-8_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66448-2
Online ISBN: 978-3-540-48309-0
eBook Packages: Springer Book Archive