Expressive and efficient pattern languages for tree-structured data (extended abstract)
Summary: Propose a SQL-like pattern language for trees that selects vertices by combining path-to-root regexes with expressive subtree predicates, and prove path-only languages cannot capture full MSO. Allowing a guarded fragment of MSO for subtree conditions yields MSO-equivalence while retaining efficient evaluability and practical usability. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Frank Neven
- 2. Thomas Schwentick
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,370 | Monadic Datalog and the Expressive Power of Languages for Web Information Extraction | 2002 | PODS | 0.00012338027 |
| 1,929 | XPath Satisfiability in the Presence of DTDs | 2005 | PODS | 0.00010058897 |
| 3,851 | The Expressivity of XPath with Transitive Closure* | 2006 | PODS | 6.7057867e-05 |
| 4,010 | A Web Odyssey: from Codd to XML | 2001 | PODS | 6.5351699e-05 |
| 5,296 | Running Tree Automata on Probabilistic XML | 2009 | PODS | 5.5802694e-05 |
| 7,361 | Extended Path Expressions for XML | 2001 | PODS | 4.7524599e-05 |
| 8,314 | Conditional XPath, the first order complete XPath dialect* | 2004 | PODS | 4.5435639e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next