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
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Introduction to 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
On labeling schemes for the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Fast and practical indexing and querying of very large graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Dynamic interval-based labeling scheme for efficient XML query and update processing
Journal of Systems and Software
Ontology management for large-scale enterprise systems
Electronic Commerce Research and Applications
Building an operational product ontology system
Electronic Commerce Research and Applications
| Hi-index | 0.00 |
For successfully using a RDBMS as repository for the Product information, it is essential that the ontological query be processed efficiently and answered properly on RDBMS. The key point of well processing the ontological queries is whether the various semantic relationships among the concepts of the product ontology are likewise well-processed. Especially, the transitive relationships (i.e. ISA, component-of relationships, etc.) such as ancestors-descendents, parents-children, and taxonomy of products must be processed successfully. To processing the queries over transitive relationships, we suggest the efficient index using the numbering schemes.