Database Paper Browser

Back to papers

Numerical Document Queries

Summary: Extend MSO on trees with Presburger predicates on children to capture numerical document queries and provide an automata-theoretic characterization. Existential fragment decidable, full logic undecidable; an order-irrelevant fragment yields decidable satisfiability and a linear-data query algorithm. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1288
Venue
PODS
Year
2003
Pagerank
0.00012581674
Overall Rank
1,324 | 90.80%
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
1,095 The Lixto Data Extraction Project - Back and Forth between Theory and Practice 2004 PODS 0.00014126427
8,311 Satisfiability and Relevance for Queries over Active Documents 2009 PODS 4.5435639e-05
11,641 Containment of Shape Expression Schemas for RDF 2019 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
970 Typechecking for XML Transformers 2000 PODS 0.00014939578
1,370 Monadic Datalog and the Expressive Power of Languages for Web Information Extraction 2002 PODS 0.00012338027
Previous Page 1 / 1 Next

Semantically Similar Papers