Subsumption and indexing in constraint query languages with linear arithmetic constraints
- 1 September 1993
- journal article
- research article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 8 (3) , 315-343
- https://doi.org/10.1007/bf01530796
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Pushing constraint selectionsPublished by Association for Computing Machinery (ACM) ,1992
- Polynomial time query processing in temporal deductive databasesPublished by Association for Computing Machinery (ACM) ,1990
- A closed form for datalog queries with integer orderPublished by Springer Nature ,1990
- A generalization of the differential approach to recursive query evaluationThe Journal of Logic Programming, 1987
- Constraint logic programmingPublished by Association for Computing Machinery (ACM) ,1987
- Naive Evaluation of Recursively Defined RelationsPublished by Springer Nature ,1986
- R-treesPublished by Association for Computing Machinery (ACM) ,1984