Abstract
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. This is a query rewriting algorithm proven to be sound, terminating and complete for some classes of integrity constraints that extend those previously considered in [1]. Complexity issues are addressed.
The implementation of the algorithm in XSB presented here takes advantage of the functionalities of XSB, as a logic programming language with tabling facilities, and the possibility of coupling it to relational database systems.
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.
Similar content being viewed by others
References
M. Arenas, L. Bertossi, and J. Chomicki. Consistent Query Answers in Inconsistent Databases. In Proceedings ACM Symposium on Principles of Database Systems (ACM PODS’ 99, Philadelphia), pages 68–79. ACM Press, 1999.
M. Arenas, L. Bertossi, and J. Chomicki. Aggregation in Inconsistent Databases. In Preparation, 2000.
U.S Chakravarthy, John Grant, and Jack Minker. Logic-Based Approach to Semantic Query Optimization. ACM Transactions on Database Systems, 15(2):162–207, June 1990.
S. Chaudhuri and U. Dayal. An Overview of Data Warehousing and OLAP Technology. SIGMOD Record, 26:65–74, March 1997.
W.W. McCune. OTTER 3.0 Reference Manual and Guide. Argonne National Laboratory, Technical Report ANL-94/6, 1994.
K. F. Sagonas, T. Swift, and D. S. Warren. XSB as an Efficient Deductive Database Engine. In Proceedings of SIGMOD 1994 Conference, pages 442–453. ACM Press, 1994.
J.D. Ullman. Principles of Database and Knoledge-Base Systems, volume I. Computer Science Press, Maryland, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Celle, A., Bertossi, L. (2000). Querying Inconsistent Databases: Algorithms and Implementation. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_63
Download citation
DOI: https://doi.org/10.1007/3-540-44957-4_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67797-0
Online ISBN: 978-3-540-44957-7
eBook Packages: Springer Book Archive