Maintaining order in a generalized linked list
Acta Informatica
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Efficient handling of multiple inheritance hierarchies
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
RQL: a declarative query language for RDF
Proceedings of the 11th international conference on World Wide Web
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
A Fast Index for Semistructured Data
Proceedings of the 27th International Conference on Very Large Data Bases
On Personalizing the Catalogs of Web Portals
Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference
Benchmarking RDF Schemas for the Semantic Web
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Index structures and algorithms for querying distributed RDF repositories
Proceedings of the 13th international conference on World Wide Web
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Compact reachability labeling for graph-structured data
Proceedings of the 14th ACM international conference on Information and knowledge management
SLS: A numbering scheme for large XML documents
Programming and Computing Software
Locking-aware structural join operators for XML query processing
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
User notification in taxonomy based digital libraries
SIGDOC '06 Proceedings of the 24th annual ACM international conference on Design of communication
Node labeling schemes for dynamic XML documents reconsidered
Data & Knowledge Engineering
An efficient infrastructure for native transactional XML processing
Data & Knowledge Engineering
Indexing views to route queries in a PDMS
Distributed and Parallel Databases
Towards distributed processing of RDF path queries
International Journal of Web Engineering and Technology
Hash-base subgraph query processing method for graph-structured XML documents
Proceedings of the VLDB Endowment
Indexing Method for Transitive Relationships of Product Information
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Implementing and Optimizing Fine-Granular Lock Management for XML Document Trees
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
General spanning trees and reachability query evaluation
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
The Real Performance Drivers behind XML Lock Protocols
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Efficient retrieval of ontology fragments using an interval labeling scheme
Information Sciences: an International Journal
Coloring RDF Triples to Capture Provenance
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Essential Performance Drivers in Native XML DBMSs
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Viewing the semantic web through RVL lenses
Web Semantics: Science, Services and Agents on the World Wide Web
Multiple viewed search engine for an e-journal: a case study on zoological science
HCI'07 Proceedings of the 12th international conference on Human-computer interaction: applications and services
Fast user notification in large-scale digital libraries: experiments and results
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
On the foundations of computing deltas between RDF models
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
RDFProv: A relational RDF store for querying and managing scientific workflow provenance
Data & Knowledge Engineering
On enhancing scalability for distributed RDF/S stores
Proceedings of the 14th International Conference on Extending Database Technology
On Computing Deltas of RDF/S Knowledge Bases
ACM Transactions on the Web (TWEB)
LogMap: logic-based and scalable ontology matching
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Benchmarking database representations of RDF/S stores
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Labeling scheme and structural joins for graph-structured XML data
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Subgraph join: efficient processing subgraph queries on graph-structured XML document
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Compact encodings for all local path information in web taxonomies with application to wordnet
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
A node indexing scheme for web entity retrieval
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Hi-index | 0.00 |
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 advocate for the use of labeling schemes for modeling these hierarchies in order to efficiently answer queries such as subsumption check, descendants, ancestors or nearest common ancestor, which usually require costly transitive closure computations. We first give a qualitative comparison of three main families of schemes, namely bit vector, prefix and interval based schemes. We then show that two labeling schemes are good candidates for an efficient implementation of label querying using standard relational DBMS, namely, the Dewey Prefix scheme [6] and an Interval scheme by Agrawal, Borgida and Jagadish [1]. We compare their storage and query evaluation performance for the 16 ODP hierarchies using the PostgreSQL engine.