Database Paper Browser

Back to papers

Cost-based Selection of Path Expression Processing Algorithms in Object-Oriented Databases

Summary: Cost-based selection of path-expression processing for object queries with predicates; compares DFS, forward, and reverse joins under memory, selectivity, and fan-out. Proposes a heuristic to prune the n-ary traversal operator search space, validated on an O2 implementation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8361
Venue
VLDB
Year
1996
Pagerank
6.6437893e-05
Overall Rank
3,904 | 72.87%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

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
144 Optimization of Nonrecursive Queries 1986 VLDB 0.00041430126
272 Querying Object-Oriented Databases 1992 SIGMOD 0.0002942487
1,465 Experiences Building the Open OODB Query Optimizer 1993 SIGMOD 0.00011846984
2,015 Access Support in Object Bases 1990 SIGMOD 9.7938967e-05
2,107 A Performance Evaluation of Pointer-Based Joins 1990 SIGMOD 9.5285135e-05
2,223 Efficient Assembly of Complex Objects 1991 SIGMOD 9.2579138e-05
4,944 A Cost Model for Clustered Object-Oriented Databases 1995 VLDB 5.8120276e-05
Previous Page 1 / 1 Next

Semantically Similar Papers