Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Completeness management for RDF data sources
Darari F., Nutt W., Pirrò G., Razniewski S. ACM Transactions on the Web12 (3):1-53,2018.Type:Article
Date Reviewed: Apr 23 2019

The resource description framework (RDF), a standardized concept to model data intercommunication on the web, associates relationships between things to structures of triples or graphs. SPARQL is a semantic query language tailored to explore data stored in RDF format. The aim of the paper is to provide a machine understandable scheme to formulate queries that would ensure a better quality of services for web users. It addresses the question of completeness of retrieved data on the Web, that is, to what extent the information recovered by a querying engine is full and unabridged. The paper improved the authors’ earlier work by including such concepts as timestamp or relevance of the completeness statements, which allow query optimization. The authors investigate several subsets of SPARQL to implement the completeness entailment over single data sources or federations of data sources.

The content is organized in nine sections. The introductory sections provide background information about RDF and SPARQL and present examples to illustrate the completeness problem. The examples are very accessible, coming from IMDb and Wikipedia. Chapters 2 through 5 present the theoretical premises that define the scope of the completeness concept, and theorize the completeness operation by exploring the RDF underlining graph structure and correlating it to certain elements of SPARQL; section 9 contains the proofs of these results. Section 6 evaluates the framework and describes how to achieve completeness in an efficient way. Section 7 presents a historical perspective of the completeness notion and places the present work in this context, while section 8 discusses both technical and practical perspectives.

Although it is highly formalized content, the issues presented have real practical benefits and represent a profitable lecture for the Internet science community.

Reviewer:  Svetlana Segarceanu Review #: CR146543 (1907-0282)
Bookmark and Share
 
Query Languages (H.2.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Query Languages": Date

Zhang Z., Mendelzon A.Type: Article
Jan 1 1986
Negation in rule-based database languages
Bidoit N. Theoretical Computer Science 78(1): 3-83, 1991. Type: Article
Oct 1 1992
A query language for retrieving information from hierarchical text structures
MacLeod I. The Computer Journal 34(3): 254-264, 1991. Type: Article
Sep 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy