Database Paper Browser

Back to papers

Incomplete Path Expressions and their Disambiguation

Summary: Disambiguates incomplete path expressions in object-oriented DBs by mapping them to optimal, fully specified paths in the schema graph via transitive-closure. Domain-independent, it relies on schema semantics rather than data contents and is validated with human-subject experiments. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2721
Venue
SIGMOD
Year
1994
Pagerank
4.1945683e-05
Overall Rank
12,835 | 10.71%
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
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
175 Traversal Recursion: A Practical Approach to Supporting Recursive Applications 1986 SIGMOD 0.00038338694
1,937 Windows On The World 1983 SIGMOD 0.00010029315
4,847 The Design and Implementation of CoBase 1993 SIGMOD 5.8780071e-05
Previous Page 1 / 1 Next

Semantically Similar Papers