Database Paper Browser

Back to papers

Cost-Sensitive Reordering of Navigational Primitives

Summary: Cost-sensitive reordering of navigational primitives for path queries using partial path instances; a physical algebra isolates I/O in a single operator with sequential or asynchronous I/O. No special storage formats; relies on simple tree navigations and standard optimizations; XMark experiments show up to 4× speedup from reordering. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3681
Venue
SIGMOD
Year
2005
Pagerank
4.6362551e-05
Overall Rank
7,848 | 45.41%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,317 Distributed Query Evaluation with Performance Guarantees 2007 SIGMOD 5.5719038e-05
12,188 Generating Efficient Execution Plans for Vertically Partitioned XML Databases 2011 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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