Database Paper Browser

Back to papers

Space-Bounded FOIES

Summary: Characterize space of FOIES by maximal auxiliary arity k; define FOIES_k and prove tight arity bounds and separations for standard graph queries via Ehrenfeucht–Fraïssé arguments. Show undirected transitive closure requires k=2, resolving Patnaik–Immerman PODS'94 open problem. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1063
Venue
PODS
Year
1995
Pagerank
4.1945683e-05
Overall Rank
12,794 | 11.00%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

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 6 of 6 cited papers.

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

Rank Cited Paper Year Venue Pagerank
55 Efficiently Updating Materialized Views 1986 SIGMOD 0.00065762967
95 Maintaining Views Incrementally 1993 SIGMOD 0.00050896659
1,649 Finitely Representable Databases 1994 PODS 0.00011017687
2,131 Incremental Evaluation of Rules and its Relationship to Parallelism 1991 SIGMOD 9.4776341e-05
4,632 Dyn-FO: A Parallel, Dynamic Complexity Class (Preliminary Version) 1994 PODS 6.0342363e-05
5,534 Maintenance of Stratified Databases Viewed as a Belief Revision System 1987 PODS 5.4541693e-05
Previous Page 1 / 1 Next

Semantically Similar Papers