Constraint databases, data structures and efficient query evaluation

DOI10.1007/978-3-540-25954-1_1MaRDI QIDQ5717745zbMATH OpenOpenAlexFDO

Authors Joos Heintz, Bart Kuijpers

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98003

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Constraint databases, queries and query languages
• Efficient evaluation of specific queries in constraint databases
• Toward practical query evaluation for constraint databases
• Descriptive complexity theory for constraint databases
• The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases

Cited in

(10)

• Toward practical query evaluation for constraint databases
• Static analysis and query answering for incomplete data trees with constraints
• Efficient evaluation of specific queries in constraint databases
• Constraint databases: promising technology or just intellectual exercise?
• Lower complexity bounds for interpolation algorithms
• Constraint databases, queries and query languages
• Database queries and constraints via lifting problems
• Algorithms to decide the generalised alibi query for space-time prisms with stationary activity time
• On the intrinsic complexity of point finding in real singular hypersurfaces
• Some lower bounds for the complexity of the linear programming feasibility problem over the reals

Describes a project that uses

Uses Software

• Kronecker

This page was built for publication: Constraint databases, data structures and efficient query evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717745)