Finitely Representable Databases
- 1 October 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 55 (2) , 273-298
- https://doi.org/10.1006/jcss.1997.1524
Abstract
No abstract availableKeywords
This publication has 45 references indexed in Scilit:
- On the structure of queries in constraint query languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Relational expressive power of constraint query languagesPublished by Association for Computing Machinery (ACM) ,1996
- Variable independence and aggregation closurePublished by Association for Computing Machinery (ACM) ,1996
- Linear vs. polynomial constraints in database query languagesPublished by Springer Nature ,1994
- Datalog extensions for database queries and updatesJournal of Computer and System Sciences, 1991
- The complexity of elementary algebra and geometryJournal of Computer and System Sciences, 1986
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- A relational model of data for large shared data banksCommunications of the ACM, 1970