Abstract
Finding satisfiability and implication results among queries is fundamental to several problems in databases especially in distributed databases. The known complexity of finding satisfiability of term S is O(|S|3). Similarly complexity of finding “Is S implies T (S→T)” is O(S 3+K) Where |S| is the number of distinct predicate attributes in S, and K is the number of predicate terms in T (S and T are conjunctive select-project-join(PSJ) queries). We show that with the induction of Cross Attribute Knowledge (C RA ) the above complexity is reduced to O(|S − C RA |3) and O(|S − C RA |3+K) for satisfiability and implication respectively.
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
Halevy, A.Y.: Answering queries using views. VLDB J. 10, 270–294 (2001)
Ren, Q., Dunham, M.H., Kumar, V.: Semantic Caching and Query Processing. IEEE Transactions on Knowledge and Data Engineering, 192–210 (2003)
Dar, S., Franklin, M.J., Jonson, B.T., Srivastava, D., Tan, M.: Semantic Data Caching and Replacement. In: Proceedings of 22nd VLDB Conference, Mumbai (1996)
Keller, A.M., Basu, J.: A Predicate-Based Caching Scheme for Client-Server Database Architectures. VLDB J. 5(2), 35–47 (1996)
Abbas, M.A., Qadir, M.A.: Cross Attribute Knowledge: A Missing Concept in Semantic Cache Query Processing. In: 13th IEEE International Multitopic Conference (INMIC 2009), Islamabad, Pakistan (2009)
Guo, S., Sun, W., Weiss, M.: On satisfiability, equivalence, and implication problems involving conjunctive queries in database systems. IEEE Trans. Knowl. Data Eng. 8(4), 604–616 (1996)
Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. 11. Computer Science Press (1989)
Klug, A.: On Conjunctive Queries Containing Inequalities. ACM 35(1), 146–160 (1988)
Rosenkrantz, D.J., Hunt, H.B.: Processing Conjunctive Predicates and Queries. In: Proc. Conf. Very Large Databases, pp. 64–71 (1980)
Sun, X., Kamell, N.N., Ni, L.M.: Processing implication on queries. IEEE Trans. Softw. Eng. 5(10), 168–175 (1989)
Floyd, R.W.: Algorithm 97 Shortest Path. Comm. ACM 5(6), 345 (1962)
Garca-Molina, H., Ullman, J.D., Widom, J.: Database Systems: the Complete Book. GOAL Series (2001)
Sample database with test suite, Version 1.0.6 (February 2011), https://launchpad.net/test-db
Ali, T., Qadir, M.A., Ahmad, M.: Translation of relational queries into Description Logic for semantic cache query processing. In: 2010 International Conference on Information and Emerging Technologies (ICIET), June 14-16, pp. 1–6 (2010), doi:10.1109/ICIET.2010.5625709
Ali, T., Qadir, M.A.: DL based Subsumption Analysis for Relational Semantic Cache Query Processing and Management. In: 10th International Conference on Knowledge Management and Knowledge Technologies, Messe Congress Graz, Austria, September 13 (2010)
Ahmed, M., Asghar, S., Qadir, M.A., Ali, T.: Graph Based Query Trimming Algorithm for Relational Data Semantic Cache. In: The International Conference on Management of Emergent Digital EcoSystem, MEDES 2010 (2010)
Ahmad, M., Qadir, M.A., Ali, T., Abbas, M.A., Afzal, M.T.: Semantic Cache System, in the book Semantics; Afzal, M.T. (ed.), ISBN: 979-953-307-613-2
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abbas, M.A., Qadir, M.A., Ahmad, M., Ali, T. (2012). Semantic Aware Implication and Satisfiability for Conjunctive Queries in Semantic Caching. In: Benlamri, R. (eds) Networked Digital Technologies. NDT 2012. Communications in Computer and Information Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30507-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-30507-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30506-1
Online ISBN: 978-3-642-30507-8
eBook Packages: Computer ScienceComputer Science (R0)