Welcome to the InfoSci Platform
Nested Optional Join for Efficient Evaluation of SPARQL Nested Optional Graph Patterns

Nested Optional Join for Efficient Evaluation of SPARQL Nested Optional Graph Patterns

Artem Chebotko, Shiyong Lu
Copyright: © 2010 |Pages: 28
ISBN13: 9781605669922|ISBN10: 160566992X|ISBN13 Softcover: 9781616922634|EISBN13: 9781605669939
DOI: 10.4018/978-1-60566-992-2.ch013
Cite Chapter Cite Chapter

MLA

Chebotko, Artem, and Shiyong Lu. "Nested Optional Join for Efficient Evaluation of SPARQL Nested Optional Graph Patterns." Progressive Concepts for Semantic Web Evolution: Applications and Developments, edited by Miltiadis D. Lytras and Amit Sheth, IGI Global, 2010, pp. 281-308. https://doi.org/10.4018/978-1-60566-992-2.ch013

APA

Chebotko, A. & Lu, S. (2010). Nested Optional Join for Efficient Evaluation of SPARQL Nested Optional Graph Patterns. In M. Lytras & A. Sheth (Eds.), Progressive Concepts for Semantic Web Evolution: Applications and Developments (pp. 281-308). IGI Global. https://doi.org/10.4018/978-1-60566-992-2.ch013

Chicago

Chebotko, Artem, and Shiyong Lu. "Nested Optional Join for Efficient Evaluation of SPARQL Nested Optional Graph Patterns." In Progressive Concepts for Semantic Web Evolution: Applications and Developments, edited by Miltiadis D. Lytras and Amit Sheth, 281-308. Hershey, PA: IGI Global, 2010. https://doi.org/10.4018/978-1-60566-992-2.ch013

Export Reference

Mendeley
Favorite

Abstract

Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF data using SQL and RDF query languages. This chapter studies how RDF queries with the so called well-designed graph patterns and nested optional patterns can be efficiently evaluated in an RDBMS. The authors propose to extend relational algebra with a novel relational operator, nested optional join (NOJ), that is more efficient than left outer join in processing nested optional patterns of well-designed graph patterns. They design three efficient algorithms to implement the new operator in relational databases: (1) nested-loops NOJ algorithm, NL-NOJ, (2) sort-merge NOJ algorithm, SM-NOJ, and (3) simple hash NOJ algorithm, SH-NOJ. Using a real life RDF dataset, the authors demonstrate the efficiency of their algorithms by comparing them with the corresponding left outer join implementations and explore the effect of join selectivity on the performance of these algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.