International Journal of Advanced Computing and Communication Systems

Ranking Complex Relationship Search Results on the Semantic Web

Monica G and Saranya N, Department of CSE, Sri Eshwar College of Engineering, Coimbatore, TamilNadu, India.

Prabhakar G, Software Engineer, Amazon.

International Journal of Advanced Computing and Communication Systems

ISSN (Online) : 2347 - 9299

ISSN (Print) : 2347 - 9280

Received On :

Revised On :

Accepted On :

Published On :

Volume 04, Issue 02

Page No : 033-045

Abstract

While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently gained some ground, the issue of how search results will be ranked remains largely unaddressed. Since it is expected that the number of relationships between entities in a knowledge base will be much larger than the number of entities themselves, the likelihood that Semantic Association searches would result in an overwhelming number of results for users is increased, therefore elevating the need for appropriate ranking schemes. Furthermore, it is unlikely that ranking schemes for ranking entities (documents, resources, etc.) may be applied to complex structures such as Semantic Associations.

Keywords

Semantic Web, SemRank, Semantic Ranking, Ranking Complex Relationships, Semantic Associations Search, Semantic Relationship Search, Semantic Match, Semantic Similarity, Discovery Query, Path Expression Tree, Semantic Summary.

Cite this Article

Monica G, Saranya N and Prabhakar G, “Ranking Complex Relationship Search Results on the Semantic Web, ”International Journal of Advanced Computing and Communication Systems, pp. 033-045, July, 2017.

Copyright

© 2017 Monica G, Saranya N and Prabhakar G. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.