Subsumtion and indexing in constraint query languages with linear arithmetic constraints.

DOI10.1007/BF01530796zbMath1034.68516OpenAlexW2088372987MaRDI QIDQ1353930

Divesh Srivastava

Publication date: 12 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Towards optimal two-dimensional indexing for constraint databases ⋮ Constrained dependencies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of the differential approach to recursive query evaluation
• A correspondence on strongly prefix codes (Corresp.)
• Pushing constraint selections

This page was built for publication: Subsumtion and indexing in constraint query languages with linear arithmetic constraints.