Please use this identifier to cite or link to this item: http://drsr.daiict.ac.in//handle/123456789/562
Title: Schema based indexing for namespace mapping of raw sparql and summarization of lod
Authors: Jat, P. M.
Hapani, Hitesh
Keywords: Information technology
Artificial intelligence
Computational Intelligence
Computer Applications
Semantic Web
Schemas
Psychology
SPARQL
Computer program language
Issue Date: 2015
Publisher: Dhirubhai Ambani Institute of Information and Communication Technology
Citation: Hapani, Hitesh (2015). Schema based indexing for namespace mapping of raw sparql and summarization of lod. Dhirubhai Ambani Institute of Information and Communication Technology, ix, 39 p. (Acc.No: T00525)
Abstract: Linked open data(LOD) in Semantic Web is growing day by day. There are datasets available that can be used in different application. However, identifying useful dataset from cloud, determining the quality and obtaining inductive information from dataset are all tasks that require to be addressed. The more traffic on LOD increases, the more difficult it will become to identify useful dataset. The reason behind this problem is that there is no useful summary available about datasets. While querying any dataset through endpoint, The most cumbersome part is remembering URIs for resources. There is no known interface that provides URIs for the user terms. There are some standard available for providing summary and metadata about datasets. But till now no standard is available that is universally accepted. Index structure proposed in this thesis gives a schema level information about any dataset and provides URI information for dataset. This index structure has been successfully implemented on local dataset server and remote dataset server in this thesis.
URI: http://drsr.daiict.ac.in/handle/123456789/562
Appears in Collections:M Tech Dissertations

Files in This Item:
File Description SizeFormat 
201311031.pdf
  Restricted Access
699.44 kBAdobe PDFThumbnail
View/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.