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)
Incoming Non-self Citations Over Time
Authors
- 1. Helmut Seidl
- 2. Thomas Schwentick
- 3. Anca Muscholl
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,094 | The Lixto Data Extraction Project - Back and Forth between Theory and Practice | 2004 | PODS | 0.00014105105 |
| 8,305 | Satisfiability and Relevance for Queries over Active Documents | 2009 | PODS | 4.5392079e-05 |
| 11,645 | Containment of Shape Expression Schemas for RDF | 2019 | PODS | 4.1905499e-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.00014924533 |
| 1,374 | Monadic Datalog and the Expressive Power of Languages for Web Information Extraction | 2002 | PODS | 0.00012325543 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,475 | Querying Aggregate Data | 1999 | PODS | 8.6942707e-05 |
| 823 | On the Representation and Querying of Sets of Possible Worlds | 1987 | SIGMOD | 0.00016225326 |
| 7,603 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.6959912e-05 |
| 5,719 | On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract) | 1997 | PODS | 5.3551435e-05 |
| 6,847 | Flag & Check: Data Access with Monadically Defined Queries | 2013 | PODS | 4.9042778e-05 |
| 11,164 | Querying Incomplete Numerical Data: Between Certain and Possible Answers | 2023 | PODS | 4.1905499e-05 |
| 1,489 | On the Decidability of Query Containment under Constraints | 1998 | PODS | 0.00011687823 |
| 5,874 | Query Automata (extended abstract) | 1999 | PODS | 5.2893146e-05 |
| 11,328 | Data Path Queries over Embedded Graph Databases | 2022 | PODS | 4.1905499e-05 |
| 582 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS | 0.00019753367 |