A. R. Su, S. Afrati, S. Cosmadakis, G. Grumbach, ]. S. Kuperahv95 et al., Expressiveness of linear vs. polynomial constraints in database query languages, Proceedings , Workshop on the Principles and Practice of Constraint Programming, 1971.

A. , S. Abiteboul, V. Vianu, . Datalog, . For et al., System Sci Relational expressive power of constraint query languages The complexity of elementary algebra and geometry Variable independence and aggregation closure Computable queries for relational data bases, 1 formulae on finite structures, Ann. Pure Appl. Logic Proc eedings , ACM Symposium on Principles of Database Systems 2511264. [BL96] M. Benedikt and L. Libkin, On the structure of queries in constraint query languages Proceedings , 11th Annual IEEE Symposium on Logic in Computer Science Proceedings , ACM Symposium on Principles of Database Systems 156678. [CH82] A. K. Chandra and D. Harel, Structure and complexity of relational queriesCod70] E. F. Codd, A relational model of data for large shared data banks 3777387. [Col75] G. E. Collins, Quantifier elimination for real closed fields by cylindric decompositions Proceedings , 2nd GI Conference Automata Theory and Formal Languages laws in logic and combinatorics, in`` in`` NATO Adv. Study Inst. on Algorithms and Order'' (I. Rival, pp.1148-622124, 1970.

L. Van-den-dries, A. Macintyre, and D. Marker, The Elementary Theory of Restricted Analytic Fields with Exponentiation, The Annals of Mathematics, vol.140, issue.1, 1994.
DOI : 10.2307/2118545

+. , _. H. Ebbinghaus, J. Flum, and W. Thomas, Remarks on Tarski's problem concerning in``in`` Logic Colloquium, p.49, 1961.

]. H. End72 and . Enderton, A Mathematical Introduction to Logic, Fag76] R. Fagin, Probabilities on finite models, p.50058, 1972.

F. Representable and . File, DISTIL 152426 By:DS . Date:14:10:97

Y. [. Gra-del, . [. Gurevich, J. Grumbach, . [. Su, J. Grumbach et al., Metafinite model theory Logic and Computational Dense order constraint databases Queries with arithmetical constraints , Theoretical Computer Science (1996), to appear. An extended abstract appeared in (CP95)'' under the titlè`First-order Definability over Constraint Databases Towards practical constraint databases Completeness results of recursive data bases Recursive model theory, draft On the expressive power of database queries with intermediate types Algebraic and calculus query languages for recursively typed complex objects Relative information capacity of simple relational schemata, Codes: 15095 Signs: 6480 . Length: 56 pic 0 pts, 236 mm 3331. [Fra54] R. Fra@ sse , Sur les classifications des systeÁ mes de relations Proceedings , Herbrand Symposium Logic Colloquium Lecture Notes in Computer Science Finitely representable databases (extended abstract), in``in`` Proceedings , ACM Symposium on Principles of Database Systems Proceedings , 14th ACM Symposium on Principles of Database Systems Proceedings , International Conference on Principles and Practice of Constraint Programming Proceedings , ACM Symposium on Principles of Database Systems Linear constraint query languages: Expressive power and complexity Logic and Computational Complexity: International Workshop LCC '94 Proceedings , 12th ACM Symposium on Principles of Database Systems 121156. [HS94] R. Hull and J. Su, Domain independence and the relational calculus 5133524. [Hul86] R. Hull 8566886. [Imm86] N. Immerman, Relational queries computable in polynomial time 866104. [Imm87] N. Immerman, Languages that capture complexity classes, SIAM J. Comput 7600778. [KG94] P. C. Kanellakis and D. Q. Goldin, Constraint programming and database query languages, in``in`` Proceedings , 2nd Conference on Theoretical Aspects of Computer Software (TACS), pp.13327-1055135, 1954.

P. Kanellakis, G. Kuper, and P. Revesz, Constraint Query Languages, 26652. (An extended abstract appeared in Proceedings, PODS '90), 1995.
DOI : 10.1006/jcss.1995.1051

J. [. Kuijpers, J. Paredaens, . Van-den-bussche-[-krvv93-]-p, S. Kanellakis, D. Ramaswamy et al., Lossless representation of topological spatial data Advances in Spatial Databases Indexing for data models with constraints and classes, 4th Int. Symp., SSD '95'' (M. J. Egenhofer and Proceedings , ACM Symposium on Principles of Database Systems Kuper, On the expressive power of the relational calculus with arithmetic constraints, in``in`` Proceedings , International Conference on Database Theory, pp.1113-2333243, 1990.

G. M. Kuper, J. Paredaens, D. Van-den-bussche, D. Van-gucht, and . Van-gucht, Topological queries in spatial databases Towards a theory of spatial database queries, in``in`` Pro ceedings First-order queries on finite structures over the reals On the computational complexity and geometry of the first-order theory of the reals A closed form for datalog queries with integer order Linear vs. order constrained queries over rational databasesA Decision Method for Elementary Algebra and Geometry The impossibility of an algorithm for the decision problem for finite models, Aggregation in constraint databases Proceedings , Workshop on the Principles and Practice of Constraint Programming Proceedings , ACM Symposium on Principles of Database Systems 13th ACM Symposium on Principles of Database Systems 279988. [PVV95] J. Paredaens, J. Van den Bussche, Proceedings , IEEE Symposium on Logic in Computer Science Proceedings , International Conference on Database Theory Proceedings , ACM Symposium on Principles of Database Systems 5699572. [Ull82] J. D. UllmanPrinciples of Database Systems Relational queries computable in polynomial time, in``in`` Proceedings , 14th ACM Symposium on Theory of ComputingVau60] R. L. Vaught, Sentences true in all constructive models, J. Symb. Logic, pp.1766183-2555352, 1950.

L. Vandeurzen, M. Gyssens, and D. Van-gucht, On the desirability and limitations of linear spatial database models Advances in Spatial Databases, 4th International Symposium, SSD '95Via93] V. Vianu, personal communications, pp.14428-3433389, 1990.