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
Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient subtyping tests with PQ-encoding
OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A path-based relational RDF database
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Efficient distributed subtyping tests
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Extensible encoding of type hierarchies
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
ODRA: a next generation object-oriented environment for rapid database application development
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Generalized Hybrid Encoding of Polyhierarchical Structures
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.00 |
The problem of efficient processing of the basic operations on ontologies, such as subsumption checking, or finding all subtypes of a given type, becomes of a very high importance. In the paper we present a hybrid approach of organizing multi-hierarchical structures, combining numbering schemes [1], [13] with "gene-based" methods [10], [17]. The proposed method generalizes earlier solutions and inherits advantages of earlier approaches. The obtained structure preserves the feature of incremental changes of the ontology structure. The experiments performed show significant efficiency results in accessing ontology resources for performing processes specific for semantic web.