On labeling schemes for the semantic web

Vassilis Christophides, Dimitris Plexousakis, Michel Scholl, Sotirios Tourtounis
2003 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 of
more » ... namely bit vector, pre x and interval based schemes. We then show that two labeling schemes are good candidates for an e cient implementation of label querying using standard relational DBMS, namely, the Dewey Pre x scheme 6] and an Interval scheme by A g r a wal, Borgida and Jagadish 1]. We compare their storage and query evaluation performance for the 16 ODP hierarchies using the PostgreSQL engine.
doi:10.1145/775228.775230 fatcat:ixzhjcenqragbkgjnflsqb7cde