A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Proceedings of the twelfth international conference on World Wide Web - WWW '03
This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We a d v ocate for the use of labeling schemes for modeling these hierarchies in order to e ciently answer queries such as subsumption check, descendants, ancestors or nearest common ancestor, which usually require costly transitive closure computations. We rst give a qualitative comparison of three main families ofdoi:10.1145/775228.775230 fatcat:ixzhjcenqragbkgjnflsqb7cde