Welcome to the InfoSci Platform
Reference Hub4
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS

Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS

Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad Fotouhi
Copyright: © 2008 |Volume: 4 |Issue: 4 |Pages: 30
ISSN: 1552-6283|EISSN: 1552-6291|ISSN: 1552-6283|EISBN13: 9781615204830|EISSN: 1552-6291|DOI: 10.4018/jswis.2008100101
Cite Article Cite Article

MLA

Chebotko, Artem, et al. "Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS." IJSWIS vol.4, no.4 2008: pp.1-30. http://doi.org/10.4018/jswis.2008100101

APA

Chebotko, A., Lu, S., Atay, M., & Fotouhi, F. (2008). Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS. International Journal on Semantic Web and Information Systems (IJSWIS), 4(4), 1-30. http://doi.org/10.4018/jswis.2008100101

Chicago

Chebotko, Artem, et al. "Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS," International Journal on Semantic Web and Information Systems (IJSWIS) 4, no.4: 1-30. http://doi.org/10.4018/jswis.2008100101

Export Reference

Mendeley
Favorite Full-Issue Download

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. In this article, we study how RDF queries with the socalled well-designed graph patterns and nested optional patterns can be efficiently evaluated in an RDBMS. We propose to extend relational databases 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. We design three efficient algorithms to implement the new operator in relational databases: (1) nested-loops NOJ algorithm (NL-NOJ); (2) sortmerge NOJ algorithm (SM-NOJ); and (3) simple hash NOJ algorithm (SH-NOJ). Based on a real-life RDF dataset, we demonstrate the efficiency of our algorithms by comparing them with the corresponding left outer join implementations and explore the effect of join selectivity on the performance of our 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.