On the data complexity of consistent query answering over graph databases.
Pablo BarcelóGaëlle FontainePublished in: J. Comput. Syst. Sci. (2017)
Keyphrases
- data complexity
- consistent query answering
- graph databases
- conjunctive queries
- query answering
- query language
- integrity constraints
- inconsistent databases
- expressive power
- query evaluation
- regular path queries
- data exchange
- graph mining
- similarity search
- regular expressions
- application domains
- database
- np complete
- index structure
- datalog programs
- data model
- structured data
- data integration
- graph model
- special case
- mining algorithm
- dl lite
- unions of conjunctive queries
- query rewriting
- xml data
- decision procedures
- incomplete information
- xml databases
- protein structure
- query optimization
- computational complexity
- conp complete
- data structure
- metadata