Abstract
We identify some essential features or functionalities involved in querying databases with incomplete designs/plans and study the intrinsic complexity of such operations when presented in a declarative setting. These results thus form a kind of “lower bound” on the complexity of query evaluation of any language incorporating these features. We also identify syntactic restrictions that yield tractable subclasses and show that these restrictions are meaningful in the real world. Finally we study a query evaluation procedure for languages incorporating these features. We show that the usual SLD-resolution procedure can be extended straight-forwardly. Since our language involves computing with sets, such a proof procedure is of intrinsic interest in itself.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, C. Kanellakis, Object Identity as a Query language Primitive, Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data.
C. Beeri, S. Naqvi, O. Shmueli, and S. Tsur, Set Constructors in a Logic Database Language, accepted for publication in Journal of Logic Programming. Extended abstract in ACM PODS, 1987.
A. K. Chandra, and D. Harel Structure and Complexity of relational queries J. of Comp. Syst. Sci., 25 pp99–128.
M. Garey and D. Johnson, Computers and Intractability A guide to the theory of NP-Completeness, W.H. Freeman and Company, NY.
R. Hull, J.Su, Untyped sets, invention, and computable queries, Proc. of 8th PODS, Philadelphia, 1989.
T. Imielinski and W. Lipski, Incomplete information in relational databases, JACM 31(4):761–791, October, 1984.
T. Imielinski, S. Naqvi and K. Vadaparty, Incomplete Objects — A Data Model for Design and Planning Applications, Accepted for publication in Proceedings of SIGMOD 1991.
T. Imielinski, S. Naqvi and K. Vadaparty, A Query Language for Databases with Incomplete Objects, a manuscript.
T.Imielinski and K. Vadaparty, Complexity of Querying Databases with or-objects, Proceedings of the Eighth ACM Symposium on Principles of Database Systems (PODS), 1989.
J. Lloyd, Foundations of Logic Programming, Springer Verlag, 1984.
J. Siekmann, Unification Theory, Journal of Symbolic Computation, 7, 207–274, 1989. Journal of Symbolic Computation, 7, 207–274, 1989.
K. Vadaparty, On the power of rule based languages with sets, Proceedings of the Tenth ACM on Principles of Database Systems (PODS), 1991.
M. Vardi, The Complexity of Relational Query Languages, Proc. of 14th STOC, 137–146, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Imielinski, T., Naqvi, S., Vadaparty, K. (1991). Querying design and planning databases. In: Delobel, C., Kifer, M., Masunaga, Y. (eds) Deductive and Object-Oriented Databases. DOOD 1991. Lecture Notes in Computer Science, vol 566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55015-1_28
Download citation
DOI: https://doi.org/10.1007/3-540-55015-1_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55015-0
Online ISBN: 978-3-540-46646-8
eBook Packages: Springer Book Archive