Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Clifford, J., Lindsay, B., Maier, D. (eds.) 1989 ACM SIGMOD, pp. 253–262. ACM, New York (1989)
Ait-Kaci, H., Boyer, R., Lincoln, P., Nasr, R.: Efficient implementation of lattice operations. ACM Trans. Program. Lang. Syst. 11(1), 115–146 (1989)
Alavi, H.S., Gilbert, S., Guerraoui, R.: Extensible encoding of type hierarchies. In: 35th Ann. ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages, pp. 349–358 (2008)
Baehni, S., Barreto, J., Eugster, P., Guerraoui, R.: Efficient distributed subtyping tests. In: 2007 Inaugural Int’l Conf. on Distributed Event-Based Systems, vol. 233, pp. 214–225. ACM, New York (2007)
Bender, M.A., Pemmasani, G., Skiena, S., Sumazin, P.: Finding least common ancestors in directed acyclic graphs. In: 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 845–854. SIAM, Philadelphia (2001)
Caseau, Y.: Efficient handling of multiple inheritance hierarchies. In: 8th Ann. Conf. on Object-Oriented Programming Systems, Languages, and Applications, pp. 271–287. ACM, New York (1993)
Dietz, P.F.: Maintaining order in a linked list. In: 14th Ann. ACM Symp. on Theory of Computing, pp. 122–127. ACM, New York (1982)
Gene Ontology, http://www.geneontology.org
Hsu, W.: PC-Trees vs. PQ-Trees. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 207–217. Springer, Heidelberg (2001)
Krall, A., Vitek, J., Horspool, R.N.: Near optimal hierarchical encoding of types. In: Aksit, M., Matsuoka, S. (eds.) ECOOP 1997. LNCS, vol. 1241, pp. 128–145. Springer, Heidelberg (1997)
Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: Apers, P.M., Atzeni, P., Ceri, S., Paraboschi, S., Ramamohanarao, K., Snodgrass, R.T. (eds.) 27th Int’l Conf. on VLDB, pp. 361–370 (2001)
Lentner, M., Subieta, K.: ODRA: A Next Generation Object-Oriented Environment for Rapid Database Application Development. In: Ioannidis, Y., Novikov, B., Rachev, B. (eds.) ADBIS 2007. LNCS, vol. 4690, pp. 130–140. Springer, Heidelberg (2007)
Matono, A., Amagasa, T., Yoshikawa, M., Uemura, S.: A path-based relational RDF database. In: H. E. Williams and G. Dobbie (eds.) 16th Australasian Database Conf., vol. 39; ACM Int’l Conf. Proc. Series, vol. 103, pp. 95–103. Australian Computer Society, Darlinghurst (2005)
Maier, D.: An Efficient Method for Storing Ancestor Information in Trees. SIAM Journal on Computing 8(4), 599–618 (1979)
OWL Web Ontology Language Overview, http://www.w3.org/TR/owl-features
Pizza Ontology v1.5, http://www.co-ode.org/ontologies/pizza/2007/02/12
Preuveneers, D., Berbers, Y.: Prime Numbers Considered Useful: Ontology Encoding for Efficient Subsumption Testing: Technical report CW464, Department of Computer Science, Katholieke Universiteit, Leuven (2006)
Sans, V., Laurent, D.: Prefix based numbering schemes for XML: techniques, applications and performances. In: Proc. VLDB, vol. 1(2), pp. 1564–1573 (2008)
Suggested Upper Merged Ontology, http://www.ontologyportal.org
Zibin, Y., Gil, J.Y.: Efficient subtyping tests with PQ-encoding. In: 16th ACM SIGPLAN Conf. on Object-Oriented Programming, Systems, Languages, and Applications, pp. 96–107 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lewandowski, J., Rybinski, H. (2009). A Hybrid Method of Indexing Multiple-Inheritance Hierarchies. In: Rauch, J., Raś, Z.W., Berka, P., Elomaa, T. (eds) Foundations of Intelligent Systems. ISMIS 2009. Lecture Notes in Computer Science(), vol 5722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04125-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-04125-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04124-2
Online ISBN: 978-3-642-04125-9
eBook Packages: Computer ScienceComputer Science (R0)