Optimizing taxonomic semantic web queries using labeling schemes

摘要: Abstract This paper focuses on the optimization of navigation through voluminous subsumption hierarchies topics employed by portal catalogs like Netscape Open Directory (ODP). We advocate for use labeling schemes modeling these in order to efficiently answer queries such as check, descendants, ancestors or nearest common ancestor, which usually require costly transitive closure computations. first give a qualitative comparison three main families schemes, namely bit vector, prefix and interval based schemes. then show that two are good candidates an efficient implementation label querying using standard relational DBMS, Dewey scheme Agrawal et al. compare their storage query evaluation performance 16 ODP PostgreSQL engine.