IDEAS home Printed from https://ideas.repec.org/a/igg/jswis0/v4y2008i4p1-30.html
   My bibliography  Save this article

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

Author

Listed:
  • Artem Chebotko

    (University of Texas - Pan American, USA)

  • Shiyong Lu

    (Wayne State University, USA)

  • Mustafa Atay

    (Winston-Salem State University, USA)

  • Farshad Fotouhi

    (Wayne State University, USA)

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.

Suggested Citation

  • Artem Chebotko & Shiyong Lu & Mustafa Atay & Farshad Fotouhi, 2008. "Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS," International Journal on Semantic Web and Information Systems (IJSWIS), IGI Global, vol. 4(4), pages 1-30, October.
    • Handle: RePEc:igg:jswis0:v:4:y:2008:i:4:p:1-30
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jswis.2008100101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jswis0:v:4:y:2008:i:4:p:1-30. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.