Database Paper Browser

Back to papers

Why Off-the-Shelf RDBMSs are Better at XPath Than You Might Expect

Summary: Off-the-shelf RDBMSs can handle XPath without kernel changes. Partitioned B-trees speed axes; aggregation-based pruning avoids duplicates; optimizer rewritings enable efficient XPath evaluation on DBMS; IBM DB2 experiments confirm practicality. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3920
Venue
SIGMOD
Year
2007
Pagerank
4.6860809e-05
Overall Rank
7,639 | 46.91%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
5,091 Join Query Optimization Techniques for Complex Event Processing Applications 2018 VLDB 5.7010894e-05
8,938 A SQL:1999 Code Generator for the Pathfinder XQuery Compiler 2007 SIGMOD 4.4229886e-05
12,313 Cost Based Plan Selection for XPath 2009 SIGMOD 4.1905499e-05
12,421 Implementing Filesystems by Tree-aware DBMSs 2008 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers