An Approach to Simplify Navigation within Ontologies

Karina Robles, Alejandro Ruiz, Anabel Fraga, Juan Llorens

2012

Abstract

Semantic Web technologies have contributed mainly to organize the knowledge and to search about this organized knowledge. One of the most complex search is to know if two entities are related within a ontology. These are called Semantic Associations, which have been classified using ρ operators: ρ-path, ρ-join and ρ-iso. Then, a ρ-query will solve any of them. Studies about this area offer low performance execution times, but others increase the performance with pre-processing, making use of complex structures in memory. In this paper, we present semantic associations and analyze related studies. We focus on design a simplified representation of the ontology that facilitates the navigation and reduce the algorithms complexity to solve these operators, starting from the first of them: ρ-path.

References

  1. N. Athanasis, V. Christophides, and D. Kotzinos, “Generating On the Fly Queries for the Semantic Web?: The ICS-FORTH Graphical RQL Interface ( GRQL ) 1,” in Proceedings of the Third International SemanticWeb Conference, 2004, pp. 486-501.
  2. T. Catarci, P. Dongilli, T. D. Mascio, E. Franconi, G. Santucci, and S. Tessaris, “An ontology based visual tool for query formulation support,” in Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2005, pp. 308-312.
  3. L. Zhang, Y. Yu, J. Zhou, C. Lin, and Y. Yin, “An Enhanced Model for Searching in Semantic Portals,” in WWW 7805: Proceedings of the 14th international conference on World Wide Web, 2005, pp. 453-462.
  4. D. A. Koutsomitropoulos, R. B. Domenech, and G. D. Solomou, “A Structured Semantic Query Interface for Reasoning-Based Search and Retrieval,” in Proceedings of the 8th extended semantic web conference on The Semantic Web: research and applications, 2011, pp. 17-31.
  5. K. Möller, L. Dragan, and S. Handschuh, “A Visual Interface for Building SPARQL Queries in Konduit,” in 7th International Semantic Web Conference, 2008.
  6. P. R. Smart, A. Russell, D. Braines, Y. Kalfoglou, J. Bao, and N. R. Shadbolt, “A Visual Approach to Semantic Query Design Using a Web-Based Graphical Query Designer,” in Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns, 2008.
  7. G. Zenz, X. Zhou, E. Minack, W. Siberski, and W. Nejdl, “From Keywords to Semantic Queries - Incremental Query Construction on the Semantic Web,” Web Semantics: Science, Services and Agents on the World Wide Web, vol. 7, no. 3, 2009.
  8. G. Karvounarakis, S. Alexaki, V. Christophides, D. Plexousakis, and M. Scholl, “RQL?: A Declarative Query Language for RDF,” in Proceedings of the 11th International World Wide Web Conference (WWW2002), 2002.
  9. L. Miller, A. Seaborne, and A. Reggiori, “Three Implementations of SquishQL , a Simple RDF Query Language Three Implementations of SquishQL , a Simple RDF Query Language,” in Proceedings of the First International Semantic Web Conference on The Semantic Web, 2002, pp. 423- 435.
  10. M. Sintek and S. Decker, “TRIPLE - a query, inference, and trans- formation language for the semantic web,” in Proceedings of the First Inter- national Semantic Web Conference on The Semantic Web, 2002, pp. 364-378.
  11. R. Fikes, P. Hayes, and I. Horrocks, “OWL-QL - A Language for Deductive Query Answering on the Semantic Web,” Web Semantics: Science, Services and Agents on the World Wide Web, vol. 2, no. 1, pp. 19-29, 2004.
  12. V. Haarslev, M. Ralf, and M. Wessel, “Querying the Semantic Web with Racer + nRQL,” in Proceedings of the KI-2004 International Workshop on Applications of Description Logics, 2004.
  13. R. V. Guha, “rdfDB?: An RDF Database.” [Online]. Available: http://www.guha.com/rdfdb/. [Accessed: 30-Jun-2012].
  14. K. Anyanwu and A. Sheth, “The ? Operator?: Discovering and Ranking Associations on the Semantic Web,” ACM SIGMOD Record, vol. 31, no. 4, pp. 42-47, 2002.
  15. K. Anyanwu and A. Sheth, “The ?-Operator?: Enabling Querying for Semantic Associations on the Semantic Web .,” in Proceedings of the 12th International Conference on World Wide Web, 2003.
  16. S. Barton, “Designing Indexing Structure for Discovering Relationships in RDF Graphs,” in Database, Texts, Specifications and Objects Workshop (DATESO), 2004, pp. 7-17.
  17. S. Barton, “Indexing Structure for Discovering Relationships in RDF Graph Recursively Applying Tree Transformation,” in Semantic Web Workshop at 27th Annual International ACM SIGIR Conference, 2004, pp. 58-68.
  18. G. Wu, J. Li, L. Feng, and K. Wang, “Identifying Potentially Important Concepts and Relations in an Ontology,” in Proceedings of the 7th International Conference on The Semantic Web (ISWC 7808), 2008, vol. 5318, pp. 33-49.
  19. R. Rada, H. Mili, E. Bicknell, and M. Blettner, “Development and Application of a Metric on Semantic Nets,” IEEE Transactions on Systems, Man and Cybernetics, vol. 19, no. 1, 1989.
  20. P. Hayes, “RDF Model Theory.” [Online]. Available: http://www.w3.org/TR/rdf-mt. [Accessed: 30-May-2012].
  21. O. Lassila and R. Swick, Resource Description Framework: Model and Syntax Specification. 1999.
  22. M. Hildebrand, J. V. Ossenbruggen, and L. Hardman, “An Analysis of Search-based User Interaction on the Semantic Web,” Information Systems, no. INS-E0706, pp. 1386-3681, 2007.
  23. R. C. Backhouse and B. A. Carré, “Regular Algebra Applied to Path-finding Problems,” Journal of the Institute of Mathematics and Applications, vol. 15, pp. 161-186, 1975.
  24. R. E. Tarjan, “Fast Algorithms for Solving Path Problems,” Journal of the ACM, vol. 28, no. 3, pp. 594-614, Jul. 1981.
  25. R. E. Tarjan, “A Unified Approach to Path Problems,” Journal of ACM, vol. 28, no. 3, pp. 577-593, 1981.
  26. S. Barton and P. Zezula, “?-index - An Index for Graph Structured Data,” in 8th International Workshop of the DELOS Network of Excellence on Digital Libraries, 2005, pp. 57-64.
  27. S. Warshall, “A Theorem on Boolean Matrices*,” Journal of ACM, vol. 9, no. 1, pp. 11-12, 1962.
  28. R. E. Tarjan, “Depth first search and linear graph algorithms,” SIAM Journal of Computing, pp. 146-160, 1972.
  29. P. Walton Purdom, “A transitive closure algorithm,” BIT, vol. 10, pp. 76-94, 1970.
  30. Y. E. Ioannidis and R. Ramakrishnan, “Efficient Transitive Closure Algorithms,” in Proceedings of the Fourteenth International Conference on Very Large Data Bases, 1988, pp. 382-394.
  31. R. Agrawal, “Hybrid Transitive Closure Algorithms,” in 16th International Conference on Very Large DataBases, 1990, pp. 326-334.
  32. S. Barton, “Indexing Graph Structured Data,” Masaryk University, 2007.
  33. P. Zezula, G. Amato, F. Debole, and F. Rabitti, “Tree Signatures for XML Querying and Navigation,” in In 1st International XML Database Symposium, 2003, pp. 149-163.
  34. A. Matono, T. Amagasa, M. Yoshikawa, and S. Uemura, “An Indexing Scheme for RDF and RDF Schema based on Suffix Arrays,” in Proceedings of SWDB'03, The first InternationalWorkshop on SemanticWeb and Databases, Colocated with VLDB 2003, 2003.
  35. R. Agrawal, A. Borgida, and H. V. Jagadish, “Eficient Managemente of Transitive Relationships in Large Data and Knowledge Bases,” in Proceedings of the 1989 ACMSIGMODi nternational con- ference on Management of data, 1989, pp. 253-262.
Download


Paper Citation


in Harvard Style

Robles K., Ruiz A., Fraga A. and Llorens J. (2012). An Approach to Simplify Navigation within Ontologies . In Proceedings of the 3rd International Workshop on Software Knowledge - Volume 1: SKY, (IC3K 2012) ISBN 978-989-8565-32-7, pages 44-53. DOI: 10.5220/0004178500440053


in Bibtex Style

@conference{sky12,
author={Karina Robles and Alejandro Ruiz and Anabel Fraga and Juan Llorens},
title={An Approach to Simplify Navigation within Ontologies},
booktitle={Proceedings of the 3rd International Workshop on Software Knowledge - Volume 1: SKY, (IC3K 2012)},
year={2012},
pages={44-53},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004178500440053},
isbn={978-989-8565-32-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Workshop on Software Knowledge - Volume 1: SKY, (IC3K 2012)
TI - An Approach to Simplify Navigation within Ontologies
SN - 978-989-8565-32-7
AU - Robles K.
AU - Ruiz A.
AU - Fraga A.
AU - Llorens J.
PY - 2012
SP - 44
EP - 53
DO - 10.5220/0004178500440053