Building Summary Graphs of RDF Data in Semantic Web

Ayvaz S., Aydar M., Melton A.

39th IEEE Annual International Computer Software and Applications Conference Workshops (COMPSAC), T'ai-chung, Taiwan, 1 - 05 July 2015, pp.686-691 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume:
  • Doi Number: 10.1109/compsac.2015.107
  • City: T'ai-chung
  • Country: Taiwan
  • Page Numbers: pp.686-691
  • Yıldız Technical University Affiliated: No


The structured data available in the semantic web have been rapidly increasing with the contribution of linked open data and other similar community initiatives in recent years. Thus, searching and processing large data have become more challenging. Building a summary graph can help reduce the computational complexity and query time in semantic searches by providing an intermediate index structure which contains entity type classes and relations between them. In the current study, we propose an algorithm for discovering the types of entities in RDF data and for building a summary graph structure for faster computational processing.