Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Graph Data Model
Relational Data Model
Discussion
Experimental Results
Related Works
Conclusions
References
All Topics
Computer Science
Database Systems

Incremental Consistent Updating of Incomplete Databases

Profile image of Dominique LaurentDominique Laurent

2023, arXiv (Cornell University)

https://doi.org/10.48550/ARXIV.2302.06246
visibility

…

description

30 pages

link

1 file

Abstract

Efficient consistency maintenance of incomplete and dynamic real-life databases is a quality label for further data analysis. In prior work, we tackled the generic problem of database updating in the presence of tuple generating constraints from a theoretical viewpoint. The current paper considers the usability of our approach by (a) introducing incremental update routines (instead of the previous from-scratch versions) and (b) removing the restriction that limits the contents of the database to fit in the main memory. In doing so, this paper offers new algorithms, proposes queries and data models inviting discussions on the representation of incompleteness on databases. We also propose implementations under a graph database model and the traditional relational database model. Our experiments show that computation times are similar globally but point to discrepancies in some steps.

Related papers

Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics
Andrei Lopatenko

2006

Consistent Query Answering (CQA) is the problem of computing from a database the answers to a query that are consistent with respect to certain integrity constraints that the database, as a whole, may fail to satisfy. Consistent answers have been characterized as those that are invariant under certain minimal forms of restoration of the database consistency. In this paper we investigate algorithmic and complexity theoretic issues of CQA under database repairs that minimally depart -wrt the cardinality of the symmetric difference-from the original database. Research on this kind of repairs has been suggested in the literature, but no systematic study had been done. Here we obtain first tight complexity bounds. We also address, considering for the first time a dynamic scenario for CQA, the problem of incremental complexity of CQA, that naturally occurs when an originally consistent database becomes inconsistent after the execution of a sequence of update operations. Tight bounds on incremental complexity are provided for various semantics under denial constraints, e.g. (a) minimum tuple-based repairs wrt cardinality, (b) minimal tuple-based repairs wrt set inclusion, and (c) minimum numerical aggregation of attribute-based repairs. Fixed parameter tractability is also investigated in this dynamic context, where the size of the update sequence becomes the relevant parameter.

View PDFchevron_right
Abstract Consistent Query Answers in Inconsistent Databases
Leopoldo Bertossi

2008

In this paper we consider the problem of the logical char-acterization of the notion of consistent answer in a relational database that may violate given integrity constraints. This notion is captured in terms of the possible repaired versions of the database. A rnethod for computing consistent an-swers is given and its soundness and completeness (for some classes of constraints and queries) proved. The method is based on an iterative procedure whose termination for sev-eral classes of constraints is proved as well. 1

View PDFchevron_right
Consistent Query Answers in Inconsistent Databases
F. Mattace-raso

1999

In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints. This notion is captured in terms of the possible repaired versions of the database. A method for computing consistent answers is given and its soundness and completeness (for some classes of constraints and queries) proved. The method is based on an iterative procedure whose termination for several classes of constraints is proved as well.

View PDFchevron_right
Querying Inconsistent Databases: Algorithms and Implementation
Leopoldo Bertossi

Lecture Notes in Computer Science, 2000

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.

View PDFchevron_right
Consistent query answering in databases
Leopoldo Bertossi

2006

View PDFchevron_right
On the semantics of updates in databases
Ronald Fagin

… of the 2nd ACM SIGACT-SIGMOD …, 1983

We suggest here a methodology for updating databases with integrity constraints and rules for deriving inexphcit information. First we consider the problem of updating arbitrary theories by inserting into them or deleting from them arbitrary sentences. The solution involves two key ideas when replacing an old theory by a new one we wish to minimize the change in the theory, and when there are several theories that involve minimal changes, we look for a new theory that reflects that ambiguity. The methodology is also ...

View PDFchevron_right
ConQuer: a system for efficient querying over inconsistent databases
Diego Fuxman

Proceedings of the 31st International Conference on Very Large Data Bases, 2005

Although integrity constraints have long been used to maintain data consistency, there are situations in which they may not be enforced or satisfied. In this demo, we showcase ConQuer , a system for efficient and scalable answering of SQL queries on databases that may violate a set of constraints. ConQuer permits users to postulate a set of key constraints together with their queries. The system rewrites the queries to retrieve all (and only) data that is consistent with respect to the constraints. The rewriting is into SQL, so the rewritten queries can be efficiently optimized and executed by commercial database systems.

View PDFchevron_right
On the Use of an Extended Relational Model to Handle Changing Incomplete Information
Arthur Keller

IEEE Transactions on Software Engineering, 2000

In this paper we consider approaches to updating databases containing null values and incomplete information. Our approach distinguishes between modeling incompletely known worlds and modeling changes in these worlds. As an alternative to the open and closed world assumptions, we propose the expanded closed world assumption. Under this assumption, we discuss how to perform updates on databases containing set nulls, marked nulls, and simple conditional tuples, and address some issues of refining incompletely specified information.

View PDFchevron_right
Complexity of Consistent Query Answering in Databases under Cardinality-Based and Incremental Repair Semantics (extended version)
Leopoldo Bertossi

2016

A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering (CQA) is the problem of computing from D the answers to a query that are consistent wrt IC . Consistent answers are invariant under all the repairs of D, i.e. the consistent instances that minimally depart from D. Three classes of repair have been considered in the literature: those that minimize set-theoretically the set of tuples in the symmetric difference; those that minimize the changes of attribute values, and those that minimize the cardinality of the set of tuples in the symmetric difference. The latter class has not been systematically investigated. In this paper we obtain algorithmic and complexity theoretic results for CQA under this cardinality-based repair semantics. We do this in the usual, static setting, but also in a dynamic framework where a consistent database is affected by a sequence of updates, which may make it inconsistent. We also establish comparative re...

View PDFchevron_right
Updates, induction and abduction in deductive databases
Dominique Laurent
View PDFchevron_right

References (32)

  1. Abiteboul, S., and Grahne, G. Mise-à-jour des bases de données contenant de l'information incomplète. In Journées Bases de Données Avancés, 6-8 Mars 1985, St. Pierre de Chartreuse (Informal Proceedings). (1985).
  2. Abiteboul, S., Hull, R., and Vianu, V. Foundations of databases, vol. 8. Addison-Wesley Reading, 1995.
  3. Abrão, M. A., Bouchou, B., Halfeld Ferrari, M., Laurent, D., and Musicante, M. A. Incremental constraint checking for XML documents. In XSym (2004), no. 3186 in LNCS, pp. 112-127.
  4. Aho, A. V., Sagiv, Y., and Ullman, J. D. Efficient optimization of a class of relational expressions. ACM Trans. Database Syst. 4, 4 (1979), 435-454.
  5. Alotaibi, R., Lei, C., Quamar, A., Efthymiou, V., and Özcan, F. Property graph schema optimization for domain-specific knowledge graphs. In 37th IEEE International Con- ference on Data Engineering, ICDE 2021, Chania, Greece, April 19-22, 2021 (2021), IEEE, pp. 924-935.
  6. Balmin, A., Papakonstantinou, Y., and Vianu, V. Incremental validation of xml docu- ments. ACM Trans. Database Syst. 29, 4 (2004), 710-751.
  7. Benedikt, M., Konstantinidis, G., Mecca, G., Motik, B., Papotti, P., Santoro, D., and Tsamoura, E. Benchmarking the chase. In Proceedings of the 36th ACM SIGMOD- SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017 (2017), pp. 37-52.
  8. Bouchou, B., and Halfeld Ferrari Alves, M. Updates and incremental validation of XML documents. In The 9th International Workshop on Data Base Programming Languages (DBPL) (2003), Springer, Ed., no. 2921 in LNCS.
  9. Chabin, J., Halfeld Ferrari, M., and Laurent, D. Consistent updating of databases with marked nulls. Knowl. Inf. Syst. 62, 4 (2020), 1571-1609.
  10. Chandra, A. K., and Merlin, P. M. Optimal implementation of conjunctive queries in relational data bases. In Symposium on the Theory of Computing (1977).
  11. Fagin, R., Kolaitis, P. G., and Popa, L. Data exchange: getting to the core. ACM Trans. Database Syst. 30, 1 (2005), 174-210.
  12. Fagin, R., Kuper, G. M., Ullman, J. D., and Vardi, M. Y. Updating logical databases. Advances in Computing Research 3 (1986), 1-18.
  13. Fagin, R., Ullman, J. D., and Vardi, M. Y. On the semantics of updates in databases. In Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Colony Square Hotel, Atlanta, Georgia, USA (1983), pp. 352-365.
  14. Fan, W., Tian, C., Xu, R., Yin, Q., Yu, W., and Zhou, J. Incrementalizing graph algorithms. In SIGMOD '21: International Conference on Management of Data, Virtual Event, China, June 20-25, 2021 (2021), G. Li, Z. Li, S. Idreos, and D. Srivastava, Eds., ACM, pp. 459- 471.
  15. Flouris, G., Konstantinidis, G., Antoniou, G., and Christophides, V. Formal foun- dations for RDF/S KB evolution. Knowl. Inf. Syst. 35, 1 (2013), 153-191.
  16. Francis, N., Green, A., Guagliardo, P., Libkin, L., Lindaaker, T., Marsault, V., Plantikow, S., Rydberg, M., Selmer, P., and Taylor, A. Cypher: An evolving query language for property graphs. In Proceedings of the 2018 International Conference on Man- agement of Data, SIGMOD Conference 2018, Houston, TX, USA, June 10-15, 2018 (2018), G. Das, C. M. Jermaine, and P. A. Bernstein, Eds., ACM, pp. 1433-1445.
  17. Gottlob, G., Orsi, G., and Pieris, A. Ontological queries: Rewriting and optimization. In Proceedings of the 27th International Conference on Data Engineering, ICDE, Germany (2011), pp. 2-13.
  18. Grahne, G. The Problem of Incomplete Information in Relational Databases, vol. 554 of Lecture Notes in Computer Science. Springer, 1991.
  19. Halfeld Ferrari, M., Hara, C. S., and Uber, F. R. RDF updates with constraints. In Knowledge Engineering and Semantic Web -8th International Conference, KESW, Szczecin, Poland, Proceedings (2017), pp. 229-245.
  20. Halfeld Ferrari, M., and Laurent, D. Updating RDF/S databases under constraints. In Advances in Databases and Information Systems -21st European Conference, ADBIS, Nicosia, Cyprus, Proceedings (2017), pp. 357-371.
  21. Halfeld Ferrari Alves, M., Laurent, D., and Spyratos, N. Update rules in datalog programs. J. Log. Comput. 8, 6 (1998), 745-775.
  22. Hell, P., and Nesetril, J. The core of a graph. Discrete Mathematics 109, 1-3 (1992), 117-126.
  23. Imielinski, T., and Lipski Jr., W. information in relational databases. J. ACM 31, 4 (1984), 761-791.
  24. Lausen, G., Meier, M., and Schmidt, M. Sparqling constraints for RDF. In EDBT, 11th International Conference on Extending Database Technology, France, Proceedings (2008), pp. 499-509.
  25. Link, S., and Schewe, K. An arithmetic theory of consistency enforcement. Acta Cybern. 15, 3 (2002), 379-416.
  26. Onet, A. The chase procedure and its applications in data exchange. In Data Exchange, Integration, and Streams. 2013, pp. 1-37.
  27. Patel-Schneider, P. F. Using description logics for RDF constraint checking and closed- world recognition. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelli- gence, USA. (2015), pp. 247-253.
  28. Reiter, R. A sound and sometimes complete query evaluation algorithm for relational databases with null values. J. ACM 33, 2 (1986), 349-370.
  29. Schewe, K., and Thalheim, B. Limitations of rule triggering systems for integrity mainte- nance in the context of transition specifications. Acta Cybern. 13, 3 (1998), 277-304.
  30. Sirangelo, C. Representing and Querying Incomplete Information: a Data Interoperability Perspective. 2014.
  31. Winslett, M. Updating Logical Databases. Cambridge University Press, New York, NY, USA, 1990.
  32. Zaniolo, C. Database relations with null values. J. Comput. Syst. Sci. 28, 1 (1984), 142-166.

Related papers

Efficient approximation algorithms for repairing inconsistent databases
Andrei Lopatenko

2007

We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integrity constraints with numerical built-in predicates. So far research in this context has concentrated in computational complexity analysis. In this paper we focus on efficient approximation algorithms to obtain a database repair and we present an algorithm that runs in O(n log n) wrt the size of the database. Our experimental evaluations show that even for large databases an approximate repair of the database can be computed efficiently despite the fact that the exact problem is computationally intractable. Finally, we show that our results can also be applied to database repairs obtained by a minimal number of tuple deletions.

View PDFchevron_right
Towards an efficient method for updating consistent deductive databases
Ernest Teniente

Basque International Workshop on …, 1996

An important problem that arises when updating a deductive database is the one related to integrity constraints maintenance. That is, given a consistent database and an update request, to obtain all possible ways of updating the base facts such that the request is ...

View PDFchevron_right
Making More Out of an Inconsistent Database
Jef Wijsen

Lecture Notes in Computer Science, 2004

Repairing a database means making the database consistent by applying changes that are as small as possible. Nearly all approaches to repairing have assumed deletions and insertions of entire tuples as basic repair primitives. A negative effect of deletions is that when a tuple is deleted because it contains an error, the correct values contained in that tuple are also lost. It can be semantically more meaningful to update erroneous values in place, called update-based repairing. We prove that a previously proposed approach to update-based repairing leads to intractability. Nevertheless, we also show that the complexity decreases under the rather plausible assumption that database errors are mutually independent. An inconsistent database can generally be repaired in many ways. The consistent answer to a query on a database is usually defined as the intersection of the answers to the query on all repaired versions of the database. We propose an alternative semantics, defining the consistent answer as being maximal homomorphic to the answers on all repairs. This new semantics always produces more informative answers and ensures closure of conjunctive queries under composition.

View PDFchevron_right
E.: The view-update problem for indefinite databases
Irina Trubitsyna

2016

This paper introduces and studies a declarative framework for updating views over indefinite databases. An indefinite database is a database with null values that are represented, following the standard database approach, by a single null constant. The paper formalizes views over such databases as indefinite deductive databases, and defines for them several classes of database repairs that realize view-update requests. Most notable is the class of constrained repairs. Constrained repairs change the database "minimally" and avoid making arbitrary commitments. They narrow down the space of alternative ways to fulfill the view-update request to those that are grounded, in a certain strong sense, in the database, the view and the view-update request. Lemma 1. If I , η is consistent, then it has a possible world U such that |Dom(U)| = O(size(I ) + size(η)).

View PDFchevron_right
Certain query answering in partially consistent databases
Jef Wijsen

Proceedings of the VLDB Endowment, 2014

A database is called uncertain if two or more tuples of the same relation are allowed to agree on their primary key. Intuitively, such tuples act as alternatives for each other. A repair (or possible world) of such uncertain database is obtained by selecting a maximal number of tuples without ever selecting two tuples of the same relation that agree on their primary key. For a Boolean query q , the problem CERTAINTY( q ) takes as input an uncertain database db and asks whether q evaluates to true on every repair of db. In recent years, the complexity of CERTAINTY( q ) has been studied under different restrictions on q . These complexity studies have assumed no restrictions on the uncertain databases that are input to CERTAINTY( q ). In practice, however, it may be known that these input databases are partially consistent, in the sense that they satisfy some dependencies (e.g., functional dependencies). In this article, we introduce the problem CERTAINTY( q ) in the presence of a set...

View PDFchevron_right

Related topics

  • Computer Science
  • Relational Database
  • Usability
  • Database theory
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved