vix.ing · top · new · best · stats · spec

Searching and Establishment of S-P-O Relationships for Linked RDF Graphs : An Adaptive Approach

2013/11/27 by Ayan Chakraborty, Chakraborty, Ayan, Shiladitya Munshi +3 · 1 citation
Computer Science · #Advanced Database Systems and Queries #Databases (cs.DB) #FOS: Computer and information sciences #Information Retrieval (cs.IR) #Semantic Web and Ontologies #Service-Oriented Architecture and Web Services #cs.DB #cs.IR

paper · pdf · doi:10.48550/arxiv.1311.7200

5 pages, 4 figures. arXiv admin note: text overlap with arXiv:1107.1104 by other authors

openalex publication_date 2013/11/27 · arxiv created 2013/11/28 · arxiv updated 2013/12/02 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28

Abstract

In the coming era of semantic web linked data analysis is a very burning issue for efficient searching and retrieval of information. One way of establishing this link is to implement subject predicate object relationship through Set Theory approach which is already done in our previous work. For analyzing inter relationship between two RDF Graphs, RDF- Schema (RDFS) should also be taken care of. In the present paper, an adaptive combination rule based framework has been proposed for establishment of S P O relationship and RDF Graph searching is reported. Hence the identification of criteria for inter-relationship of RDF Graphs opens up new road in semantic search.

Citations

Cited by

Related