XPath Whole Query Optimization

Summary: Presents tree automata as a general framework for whole-query XPath optimization, identifying “relevant nodes” that a minimal automaton must inspect to skip subtrees and internal nodes. On-the-fly determinization and implementation techniques yield efficient evaluation, validated experimentally even without specialized indexes. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 10325
Venue: VLDB
Year: 2010
Pagerank: 5.093636e-05
Overall Rank: 12,476 | 14.41%
DOI: 10.14778/1920841.1920954

Incoming Non-self Citations Over Time

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

Authors

1. Sebastian Maneth (National Information and Communications Technology Australia; University of New South Wales)
2. Kim Nguyen (National Information and Communications Technology Australia)

BibTeX Citation

@article{maneth_vldb10,
        title = {{XPath Whole Query Optimization}},
        author = {Maneth, Sebastian and Nguyen, Kim},
        journal = {PVLDB},
        series = {{VLDB} '10},
        volume = {3},
        number = {1},
        pages = {882--893},
        doi = {10.14778/1920841.1920954},
        url = {https://doi.org/10.14778/1920841.1920954},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
79	XMark: A Benchmark for XML Data Management	2002	VLDB	0.00036555628
666	Efficient Algorithms for Processing XPath Queries	2002	VLDB	0.00015166582
2,625	Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach	2003	VLDB	8.3300135e-05
3,727	Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps	2003	VLDB	7.1689738e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,564	Conjunctive Queries over Trees	2004	PODS
2	12,534	Efficient Rewriting of XPath Queries Using Query Set Specifications	2009	VLDB
3	8,066	Semantic Query Optimization for XQuery over XML Streams	2005	VLDB
4	3,167	From Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery	2003	VLDB
5	3,129	Structure and Value Synopses for XML Data Graphs	2002	VLDB
6	9,338	Tree-Pattern Queries on a Lightweight XML Processor	2005	VLDB
7	666	Efficient Algorithms for Processing XPath Queries	2002	VLDB
8	2,472	Path Queries on Compressed XML	2003	VLDB
9	2,625	Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach	2003	VLDB
10	2,817	On the minimization of XPath queries	2003	VLDB