Linear vs. polynomial constraints in database query languages
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Finitely representable databases (extended abstract)Published by Association for Computing Machinery (ACM) ,1994
- Constraint programming and database query languagesPublished by Springer Nature ,1994
- Querying constraintsPublished by Association for Computing Machinery (ACM) ,1990
- Reasoning about linear constraints using parametric queriesPublished by Springer Nature ,1990
- A closed form for datalog queries with integer orderPublished by Springer Nature ,1990
- Constraint logic programmingPublished by Association for Computing Machinery (ACM) ,1987
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960