DBScholar

Back to papers

Finitely Representable Databases

Summary: Defines infinite yet finitely representable databases via constraint-based decidable FO theories, motivated by spatial applications. Proves this class violates core classical and finite-model-theory results (compactness, completeness, locality, 0/1-laws), undermining tools for relational-calculus query definability. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1038
Venue
PODS
Year
1994
Pagerank
8.8845324e-05
Overall Rank
2,241 | 84.63%
DOI
10.1145/182591.182654

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{grumbach_pods94,
        address = {New York, NY, USA},
        series = {{PODS} '94},
        title = {{Finitely Representable Databases}},
        url = {https://dl.acm.org/doi/10.1145/182591.182654},
        doi = {10.1145/182591.182654},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Grumbach, Stephane and Su, Jianwen},
        year = {1994}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers