The complexity of querying indefinite data about linearly ordered domains
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3914378 (Why is no real title available?)
- scientific article; zbMATH DE number 67825 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3599517 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A propositional modal logic of time intervals
- Alternation
- An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
- Complexity and algorithms for reasoning about time
- Maintaining knowledge about temporal intervals
- Model theory
- Nonconstructive advances in polynomial-time complexity
- Nonconstructive tools for proving polynomial-time decidability
- On conjunctive queries containing inequalities
- On the representation and querying of sets of possible worlds
- Querying logical databases
- Recursively indefinite databases
- The theory of well-quasi-ordering: a frequently discovered concept
Cited in
(28)- Certain answers over incomplete XML documents: extending tractability boundary
- Querying temporal and spatial constraint networks in PTIME
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- XML with data values: Typechecking revisited.
- On the complexity of tree pattern containment with arithmetic comparisons
- Answering conjunctive queries with inequalities
- Querying incomplete information in RDF with SPARQL
- Data exchange: semantics and query answering
- scientific article; zbMATH DE number 1424049 (Why is no real title available?)
- Constraint-generating dependencies
- Query answering with transitive and linear-ordered data
- The query complexity of order-finding
- Constrained dependencies
- Decidable containment of recursive queries
- Conjunctive query containment with respect to views and constraints
- A technique for proving decidability of containment and equivalence of linear constraint queries
- First-order queries on databases embedded in an infinite structure
- Rewriting queries using views in the presence of arithmetic comparisons
- Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
- On conjunctive queries containing inequalities
- A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
- Computing possible and certain answers over order-incomplete data
- Verification of knowledge bases based on containment checking
- Query containment under bag and bag-set semantics
- Possible and certain answers for queries over order-incomplete data
- Data sufficiency for queries on cache
- An extension of the relational data model to incorporate ordered domains
- scientific article; zbMATH DE number 2242592 (Why is no real title available?)
This page was built for publication: The complexity of querying indefinite data about linearly ordered domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676427)
