Consistent query answering for primary keys in logspace
From MaRDI portal
Publication:5091138
Recommendations
- Consistent query answering for primary keys in Datalog
- A remark on the complexity of consistent conjunctive query answering under primary key violations
- Consistent query answering for self-join-free conjunctive queries under primary key constraints
- A survey of the data complexity of consistent query answering under key constraints
- A dichotomy in the complexity of counting database repairs
Cites work
- A dichotomy in the complexity of counting database repairs
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A survey of the data complexity of consistent query answering under key constraints
- An introduction to description logic
- Complexity of conservative constraint satisfaction problems
- Consistent query answering for self-join-free conjunctive queries under primary key constraints
- Database Repairing and Consistent Query Answering
- Database Theory - ICDT 2005
- Directed st-Connectivity Is Not Expressible in Symmetric Datalog
- Elements of finite model theory.
- Finite model theory and its applications.
- First-order query rewriting for inconsistent databases
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Locality of order-invariant first-order formulas
- On the data complexity of consistent query answering over graph databases
- On the relationship between consistent query answering and constraint satisfaction problems
- Scalar aggregation in inconsistent databases.
- Tight hardness for shortest cycles and paths in sparse graphs
- Undirected connectivity in log-space
- Why is it hard to obtain a dichotomy for consistent query answering?
Cited in
(3)
This page was built for publication: Consistent query answering for primary keys in logspace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091138)
