Database Paper Browser

Back to papers

Query Automata (extended abstract)

Summary: Define Query Automata: deterministic two-way finite automata on ranked and unranked trees that select nodes (unary queries) based on state and label, addressing document DBs' ranked vs unranked grammars. Characterize expressiveness via MSO and give non-emptiness/equivalence complexity. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1175
Venue
PODS
Year
1999
Pagerank
5.2943906e-05
Overall Rank
5,870 | 59.17%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
882 DTD Inference for Views of XML Data 2000 PODS 0.00015657456
4,010 A Web Odyssey: from Codd to XML 2001 PODS 6.5351699e-05
7,361 Extended Path Expressions for XML 2001 PODS 4.7524599e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers