DBScholar

Back to papers

The Finite Model Theory Toolbox of a Database Theoretician

Summary: Practical survey presenting a ready-to-use finite model theory toolbox for database theorists, emphasizing usable results (locality, preservation, definability, model-theoretic reductions) rather than proofs or combinatorial games. Equips DB researchers to apply these tools directly to expressiveness, query languages, and complexity/decidability questions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1477
Venue
PODS
Year
2009
Pagerank
5.093636e-05
Overall Rank
12,487 | 14.33%
DOI
10.1145/1559795.1559807

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{libkin_pods09,
        address = {New York, NY, USA},
        series = {{PODS} '09},
        title = {{The Finite Model Theory Toolbox of a Database Theoretician}},
        url = {https://dl.acm.org/doi/10.1145/1559795.1559807},
        doi = {10.1145/1559795.1559807},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Libkin, Leonid},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
763 On the Complexity of Bounded-Variable Queries 1995 PODS 0.00014230134
2,180 Monadic Datalog and the Expressive Power of Languages for Web Information Extraction 2002 PODS 9.0110009e-05
4,071 Two-Variable Logic on Data Trees and XML Reasoning 2006 PODS 6.927159e-05
Previous Page 1 / 1 Next

Semantically Similar Papers