Benchmarking Queries over Trees: Learning the Hard Truth the Hard Way

Summary: Empirical benchmarking of tree-structured queries (XML/object DBs): navigational/link-following vs associative/indexed access, with experiments on the O2 system. Shows why large associative accesses underperform and offers cost-model insights plus practical tips for benchmark design and system implementors. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 3211
Venue: SIGMOD
Year: 2000
Pagerank: -
Overall Rank: 13,870 | 3.51%
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 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
675	The OO7 Benchmark	1993	SIGMOD	0.00018316592
12,504	On the Path to Efficient XML Queries	2006	VLDB	4.1945683e-05
4,207	Mixed Mode XML Query Processing	2003	VLDB	6.359465e-05
3,902	Cost-based Selection of Path Expression Processing Algorithms in Object-Oriented Databases	1996	VLDB	6.6499453e-05
3,117	Processing Queries on Tree-Structured Data Efficiently	2006	PODS	7.5407318e-05
2,008	Access Support in Object Bases	1990	SIGMOD	9.8029112e-05
7,550	The hcC-tree: An Efficient Index Structure For Object Oriented Databases	1994	VLDB	4.713674e-05
7,302	Benefits of Path Summaries in an XML Query Optimizer Supporting Multiple Access Methods	2005	VLDB	4.7687064e-05
4,933	A Cost Model for Clustered Object-Oriented Databases	1995	VLDB	5.8205625e-05
817	Covering Indexes for Branching Path Queries	2002	SIGMOD	0.00016352717