Abstract
Although there has been much work in recent years on answering queries using views, there has been less work on deriving answers from partial databases. That is given a partial database state DV, materialized via the view V, what queries can be asked over DV that can be answered with certainty using only the instance of the partial database and standard query evaluation mechanisms. We define these as the derivable answers and show several special cases in which we can compute and intensionally describe them.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abiteboul, S., & Duschka, O. (1998). Complexity of answering queries using materialized views. In Sym. on principles of database systems (pp. 254–263).
Abiteboul, S., Viannu, R., & Hull, V. (1995). Foundations of database systems. Reading: Addison Wesley.
Andreka, H., van Benthem, J., & Nemeti, I. (1998). Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27, 217–274.
Bernays, P., & Schönfinkel, M. (1928). Zum Entscheidungsproblem der mathematischen Logik. Mathematische Annalen, 99, 342–372.
Börger, E., Grädel, E., & Gurevich, Y. (1997). The classical decision problem. Perspectives of mathematical logic. New York: Springer.
Chandra, A., & Merlin, P. (1977). Optimal implementation of conjunctive queries in relational databases. In Proc. 9 of the ACM sym. on the theory of computing (pp. 77–90).
Codd, E. (1972). Relational completeness of data base sublanguages. In R. Rustin (Ed.), Database systems (pp. 33–64). Englewood Cliffs: Prentice-Hall.
Ganzinger, H., & de Nivelle, H. (1999). A superposition decision procedure for the guarded fragment with equality. In LICS (pp. 295–304).
Grädel, E. (1999). On the restraining power of guards. Symbolic Logic, 64, 1719–1742.
Halevy, A. (1996). Obtaining complete answers from incomplete databases. In Proc. of VLDB (pp. 402–412).
Halevy, A. (2000). Thery of answering queries using views. SIGMOD Record, 29(4), 40–47.
Halevy, A. (2001). Answering queries using views: A survey. VLDB Journal, 10(4), 270–294.
Imieliński, T., & Lipski, W. (1981). On representing incomplete information in a relational database. In VLDB (pp. 388–397). Cannes, France.
Larson, P., & Yang, H. (1985). Computing queries from derived relations. In VLDB (pp. 259–269).
Minock, M. (2006). Modular generation of relational query paraphrases. Research on Language and Computation, 4(1), 1–29.
Minock, M. (2007). A STEP towards realizing Codd’s vision of rendezvous with the casual user. In 33rd International conference on very large data bases (VLDB). Vienna, Austria. Demonstration session.
Motro, A. (1986). Completeness information and its application to query processing. In VLDB ( pp. 170–178).
Motro, A. (1989). Integrity = validity + completeness. TODS, 14(4), 480–502.
Motro, A. (1996). Panorama: A database system that annotates its answers to queries with their properties. Intelligent Information System, 7(1), 51–73.
Reiter, R. (1978). Logic and databases, chapter on closed world databases. New York: Plenum.
Ullman, J. (1989). Principles of database and knowledge-base bystems. Rockville: Computer Science.
Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobalt, C., & Topić, D. (2002). SPASS version 2.0. In 18th International conference on automated deduction (pp. 275–279). Kopenhagen, Denmark.
Zloof, M. (1977). Query-by-example: A data base language. IBM Systems Journal, 16(4), 324–343.
Acknowledgements
I thank Steve Hegner and David Maier for their comments on an earlier draft of this paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Minock, M.J. Describing and deriving certain answers over partial databases. J Intell Inf Syst 35, 245–260 (2010). https://doi.org/10.1007/s10844-009-0095-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10844-009-0095-6