Scalar aggregation in inconsistent databases.
From MaRDI portal
Publication:1401279
DOI10.1016/S0304-3975(02)00737-5zbMath1045.68049OpenAlexW2616737215MaRDI QIDQ1401279
Xin He, Jan Chomicki, Vijay Raghavan, Leopoldo Bertossi, Marcelo Arenas, Jeremy P. Spinrad
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00737-5
Related Items
Data cleaning and query answering with matching dependencies and matching functions, From causes for database queries to repairs and model-based diagnosis and back, On repairing and querying inconsistent probabilistic spatio-temporal databases, A dichotomy in the complexity of counting database repairs, A three-valued semantics for querying and repairing inconsistent databases, On measuring inconsistency in definite and indefinite databases with denial constraints, Prioritized repairing and consistent query answering in relational databases, Consistency checking and querying in probabilistic databases under integrity constraints, Minimal-change integrity maintenance using tuple deletions, Unnamed Item, Incorporating cardinality constraints and synonym rules into conditional functional dependencies, Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking, Consistent query answering for primary keys in Datalog, A dichotomy in the complexity of consistent query answering for queries with two atoms, Foundations of ontology-based data access under bag semantics, On the complexity of inconsistency measurement, Policy-based inconsistency management in relational databases
Cites Work
- Foundations of aggregation constraints
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Computable queries for relational data bases
- Programming with non-determinism in deductive databases
- Incomplete Information in Relational Databases
- Datalog with non-deterministic choice computes NDB-PTIME
- Answer sets for consistent query answering in inconsistent databases
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
