(Enter summary)
Abstract: We study infinite but finitely representable databases based on constraints, motivated by new database
applications such as those involving spatio-temporal information. We introduce a general definition of
finite representation, and define the concept of a query as a generalization of a query over relational
databases. We investigate the theory of finitely representable models and prove that it differs from both
classical model theory and finite model theory. In particular, we show the failure... (Update)
Cited by: More
Metafinite Model Theory - Erich Gradel Yuri (1995)
(Correct)
Fixed-Point Query Languages for Linear Constraint Databases - Kreutzer (2000)
(Correct)
Query Languages for Constraint Databases: First-Order Logic.. - Kreutzer (2001)
(Correct)
Similar documents (at the sentence level):
13.4%: Finitely Representable Databases - Grumbach, Su (1995)
(Correct)
Active bibliography (related documents): More All
1.2: Finitely Representable Databases (Extended Abstract) - Grumbach, al.
(Correct)
0.7: Queries with Arithmetical Constraints - Grumbach, Su (1997)
(Correct)
0.7: Dense-Order Constraint Databases (Extended Abstract) - Grumbach, Su (1995)
(Correct)
Similar documents based on text: More All
0.4: An Algebra for Pomsets - St'ephane Grumbach Rocquencourt (1995)
(Correct)
0.2: Linear Constraint Databases (Extended Abstract) - Grumbach, al.
(Correct)
0.2: New Techniques for Studying Set Languages, Bag Languages and.. - Libkin, Wong (1994)
(Correct)
Related documents from co-citation: More All
67: Constraint Query Languages
- Kanellakis, Kuper et al. - 1990
39: Towards a theory of spatial database queries (context) - Paredaens, Van den Bussche et al. - 1994
38: Relational expressive power of constraint query languages
- Benedikt, Dong et al. - 1995
BibTeX entry: (Update)
S. Grumbach and J. Su. Finitely representable databases. Journal of Computer and System Sciences, Vol 55(2), pages 273-298, 1997. http://citeseer.comp.nus.edu.sg/129676.html More
@misc{ grumbach97finitely,
author = "S. Grumbach and J. Su",
title = "Finitely representable databases",
text = "S. Grumbach and J. Su. Finitely representable databases. Journal of Computer
and System Sciences, Vol 55(2), pages 273-298, 1997.",
year = "1997",
url = "citeseer.comp.nus.edu.sg/129676.html" }
Citations (may not include all citations):
775
Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
370
A Mathematical Introduction to Logic (context) - Enderton - 1972
315
Constraint query languages
- Kanellakis, Kuper et al. - 1995
283
A relational model of data for large shared data banks (context) - Codd - 1970
245
Relational queries computable in polynomial time
- Immerman - 1986
229
A Decision Method for Elementary Algebra and Geometry (context) - Tarski - 1951
211
Languages that capture complexity classes
- Immerman - 1987
198
Structure and complexity of relational queries
- Chandra, Harel - 1982
189
Computable queries for relational data bases
- Chandra, Harel - 1980
185
Principles of Database Systems (context) - Ullman - 1982
133
Quantifier elimination for real closed fields by cylindric d.. (context) - Collins - 1975
124
Datalog extensions for database queries and updates (context) - Abiteboul, Vianu - 1991
116
On local and non local properties (context) - Gaifman - 1981
115
An application of games to the completeness problem for form.. (context) - Ehrenfeucht - 1961
110
the computational complexity and geometry of the first-order.. (context) - Renegar - 1992
103
Indexing for data models with constraints and classes
- Kanellakis, Ramaswamy et al. - 1993
87
Towards a theory of spatial database queries (context) - Paredaens, Van den Bussche et al. - 1994
83
Relational expressive power of constraint query languages
- Benedikt, Dong et al. - 1996
81
Mathematical Logic (context) - Ebbinghaus, Flum et al. - 1984
81
Probabilities on finite models (context) - Fagin - 1976
75
and the polynomial-time hierarchy (context) - Furst, Saxe et al. - 1984
74
Relative information capacity of simple relational schemata (context) - Hull - 1986
72
Finitely representable databases
- Grumbach, Su - 1994
64
Constraint programming and database query languages
- Kanellakis, Goldin - 1994
58
A closed form for datalog queries with integer order (context) - Revesz - 1990
57
The complexity of elementary algebra and geometry (context) - Ben-Or, Kozen et al. - 1986
46
Finite model theory --- a personal perspective
- Fagin - 1993
44
First-order queries on finite structures over the reals
- Paredaens, Van den Bussche et al. - 1995
44
the expressive power of database queries with intermediate t.. (context) - Hull, Su - 1991
41
Topological queries in spatial databases
- Papadimitriou, Suciu et al. - 1996
34
Aggregation in constraint databases
- Kuper - 1993
31
laws in logic and combinatorics (context) - Compton - 1988
29
Variable independence and aggregation closure
- Chomicki, Goldin et al. - 1996
28
Dense order constraint databases (context) - Grumbach, Su - 1995
27
The elementary theory of restricted analytic fields with exp.. (context) - Van den Dries, Macintyre et al. - 1994
27
polynomial constraints in database query languages (context) - Afrati, Cosmadakis et al. - 1994
24
Computational geometry (context) - Yao - 1990
23
Domain independence and the relational calculus
- Hull, Su - 1994
23
Linear constraint query languages: Expressive power and comp.. (context) - Grumbach, Su et al. - 1994
23
the structure of queries in constraint query languages
- Benedikt, Libkin - 1996
21
Lossless representation of topological spatial data
- Kuijpers, Paredaens et al. - 1995
17
the expressive power of the relational calculus with arithme.. (context) - Kuper - 1990
17
Algebraic and calculus query languages for recursively typed.. (context) - Hull, Su - 1993
16
the desirability and limitations of linear spatial database .. (context) - Vandeurzen, Gyssens et al. - 1995
13
Completeness results of recursive data bases
- Hirst, Harel - 1993
13
Remarks on Tarski's problem concerning (context) - Van den Dries - 1982
11
formulae on finite structures (context) - Ajtai - 1983
11
Metafinite model theory
- Gradel, Gurevich - 1994
10
Sentences true in all constructive models (context) - Vaught - 1960
9
Towards practical constraint databases (context) - Grumbach, Su - 1996
6
Relational queries computable in polynomial time (context) - Vardi - 1982
6
volume 73 of Studies in Logic (context) - Chang, Keisler - 1973
3
Personal communications (context) - Kuper - 1993
3
Personal communications (context) - Vianu - 1993
3
Recursive model theory (context) - Hirst, Harel - 1994
1
Proc. Int. Conf. on Principles and Practice of Constraint Pr.. (context) - Grumbach, Su et al. - 1996
1
Sur les classifications des systemes de relations (context) - Frasse - 1954
1
The impossibiltyof an algorithm for the decision problem for.. (context) - Trakhtenbrot - 1950
1
order constrained queries over rational databases (context) - Stolboushkin, Taitslin - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucsb.edu/~su/pub/ftp/index.html): More
Domain Independence and the Relational Calculus - Hull, Su (1993)
(Correct)
Towards Practical Constraint Databases (Extended Abstract) - Grumbach, Su (1996)
(Correct)
The Design of an Interactive Online Help Desk in the Alexandria.. - Prince (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.