Constraint programming and database query languages

DOI10.1007/3-540-57887-0_92MaRDI QIDQ4490722zbMATH OpenFDO

Authors Paris C. Kanellakis, Dina Goldin

Publication date 20 July 2000

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

Full work available at URL https://doi.org/10.1007/3-540-57887-0_92

Mathematics Subject Classification ID

Database theory (68P15)

Cited in

(12)

• Extended order-generic queries
• Topological queries in spatial databases
• On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
• The complexity of query evaluation in indefinite temporal constraint databases
• Finitely representable databases
• Queries with arithmetical constraints
• An expressive language for linear spatial database queries
• A technique for proving decidability of containment and equivalence of linear constraint queries
• Comparison of expressive power of some query languages for databases
• Dynamic interval index structure in constraint database systems
• On the expressiveness of linear-constraint query languages for spatial databases
• Linear constraint query languages expressive power and complexity

This page was built for publication: Constraint programming and database query languages

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