Pages that link to "Item:Q676427"

The following pages link to The complexity of querying indefinite data about linearly ordered domains (Q676427):

Displaying 20 items.

• Certain answers over incomplete XML documents: extending tractability boundary (Q269320) (← links)
• Querying incomplete information in RDF with SPARQL (Q286403) (← links)
• Data sufficiency for queries on cache (Q293243) (← links)
• Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons (Q506166) (← links)
• On the finite controllability of conjunctive query answering in databases under open-world assumption (Q532372) (← links)
• Decidable containment of recursive queries (Q555766) (← links)
• Data exchange: semantics and query answering (Q555772) (← links)
• Query containment under bag and bag-set semantics (Q656574) (← links)
• Conjunctive query containment with respect to views and constraints (Q672739) (← links)
• Rewriting queries using views in the presence of arithmetic comparisons (Q859842) (← links)
• Verification of knowledge bases based on containment checking (Q1274279) (← links)
• Constrained dependencies (Q1391931) (← links)
• XML with data values: Typechecking revisited. (Q1401966) (← links)
• Querying temporal and spatial constraint networks in PTIME (Q1589478) (← links)
• A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
• Constraint-generating dependencies (Q1807678) (← links)
• A linear time algorithm for monadic querying of indefinite data over linearly ordered domains (Q1887153) (← links)
• On the complexity of tree pattern containment with arithmetic comparisons (Q1944129) (← links)
• Computing possible and certain answers over order-incomplete data (Q2334598) (← links)
• Answering conjunctive queries with inequalities (Q2402612) (← links)