Database Paper Browser

Back to papers

Taming XPath Queries by Minimizing Wildcard Steps

Summary: Introduces a layer axis to rewrite sequences of wildcard XPath steps into a single layer-axis step. Offers a rewriting algorithm and evaluation strategy that minimizes wildcard steps, enabling selective loading and wildcard-free XPath processing. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9212
Venue
VLDB
Year
2004
Pagerank
4.1945683e-05
Overall Rank
12,605 | 12.31%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
4,354 From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching 2005 VLDB 6.262393e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank Cited Paper Year Venue Pagerank
240 Holistic Twig Joins: Optimal XML Pattern Matching 2002 SIGMOD 0.00031603463
713 Efficient Algorithms for Processing XPath Queries 2002 VLDB 0.00017731096
1,235 Minimization of Tree Pattern Queries 2001 SIGMOD 0.00013120483
1,947 Secure XML Querying with Security Views 2004 SIGMOD 0.00010000435
2,168 ViST: A Dynamic Index Method for Querying XML Data by Tree Structures 2003 SIGMOD 9.3848723e-05
2,956 Efficient Algorithms for Minimizing Tree Pattern Queries 2002 SIGMOD 7.821865e-05
3,120 Holistic Twig Joins on Indexed XML Documents 2003 VLDB 7.5295938e-05
Previous Page 1 / 1 Next

Semantically Similar Papers