research-article

Efficient query answering against dynamic RDF databases

Authors:

François Goasdoué,

Ioana Manolescu, and

Alexandra RoatişAuthors Info & Claims

EDBT '13: Proceedings of the 16th International Conference on Extending Database Technology

March 2013

Pages 299 - 310

https://doi.org/10.1145/2452376.2452412

Published: 18 March 2013 Publication History

Abstract

A promising method for efficiently querying RDF data consists of translating SPARQL queries into efficient RDBMS-style operations. However, answering SPARQL queries requires handling RDF reasoning, which must be implemented outside the relational engines that do not support it.

We introduce the database (DB) fragment of RDF, going beyond the expressive power of previously studied RDF fragments. We devise novel sound and complete techniques for answering Basic Graph Pattern (BGP) queries within the DB fragment of RDF, exploring the two established approaches for handling RDF semantics, namely reformulation and saturation. In particular, we focus on handling database updates within each approach and propose a method for incrementally maintaining the saturation; updates raise specific difficulties due to the rich RDF semantics. Our techniques are designed to be deployed on top of any RDBMS(-style) engine, and we experimentally study their performance trade-offs.

References

[1]

"Resource description framework," http://www.w3.org/RDF.

[2]

W3C, "SPARQL protocol and RDF query language," http://www.w3.org/TR/rdf-sparql-query.

[3]

D. J. Abadi, A. Marcus, S. R. Madden, and K. Hollenbach, "Scalable semantic web data management using vertical partitioning," in VLDB, 2007.

Digital Library

[4]

T. Neumann and G. Weikum, "x-RDF-3X: Fast querying, high update rates, and consistency for RDF databases," PVLDB, vol. 3, no. 1, 2010.

Digital Library

[5]

C. Weiss, P. Karras, and A. Bernstein, "Hexastore: sextuple indexing for Semantic Web data management," PVLDB, vol. 1, no. 1, 2008.

Digital Library

[6]

F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider, Eds., The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003.

Digital Library

[7]

P. Adjiman, F. Goasdoué, and M.-C. Rousset, "SomeRDFS in the semantic web," JODS, vol. 8, 2007.

Digital Library

[8]

D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati, "Tractable reasoning and efficient query answering in description logics: The DL-Lite family," Journal of Automated Reasoning (JAR), vol. 39, no. 3, 2007.

Digital Library

[9]

G. Gottlob, G. Orsi, and A. Pieris, "Ontological queries: Rewriting and optimization," in ICDE, 2011, keynote.

Digital Library

[10]

M. Arenas, C. Gutierrez, and J. Pérez, "Foundations of RDF databases," in Reasoning Web, 2009.

Digital Library

[11]

F. Goasdoué, K. Karanasos, J. Leblay, and I. Manolescu, "View selection in semantic web databases," PVLDB, 2011.

Digital Library

[12]

Z. Kaoudi, I. Miliaraki, and M. Koubarakis, "RDFS reasoning and query answering on DHTs," in ISWC, 2008.

Digital Library

[13]

J. Urbani, F. van Harmelen, S. Schlobach, and H. Bal, "QueryPIE: Backward reasoning for OWL Horst over very large knowledge bases," in ISWC, 2011.

Digital Library

[14]

S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases. Addison-Wesley, 1995.

Digital Library

[15]

T. Imielinski and W. L. Jr., "Incomplete information in relational databases," JACM, vol. 31, no. 4, 1984.

Digital Library

[16]

T. Neumann and G. Weikum, "Scalable join processing on very large RDF graphs," in SIGMOD, 2009.

Digital Library

[17]

L. Sidirourgos, R. Goncalves, M. Kersten, N. Nes, and S. Manegold, "Column-store support for RDF data management: not all swans are white," vol. 1, no. 2, 2008.

Digital Library

[18]

T. Neumann and G. Weikum, "RDF-3X: a RISC-style engine for RDF," PVLDB, vol. 1, no. 1, 2008.

Digital Library

[19]

"Extended version (Inria report no. 8018)," http://hal.inria.fr/hal-00719641/, 2012.

[20]

A. Gupta and I. S. M. (editors), Materialized Views: Techniques, Implementations, and Applications. MIT Press, 1999.

Digital Library

[21]

J. Broekstra and A. Kampman, "Inferencing and truth maintenance in RDF Schema: Exploring a naive practical approach," in PSSS Workshop, 2003.

[22]

"Barton," http://simile.mit.edu/rdf-test-data/barton.

[23]

"DBpedia 3.7," http://wiki.dbpedia.org/Downloads37.

[24]

http://kdl.cs.umass.edu/data/dblp/dblp-info.html.

[25]

T. Neumann and G. Weikum, "The RDF-3X engine for scalable management of RDF data," VLDB J., 2010.

Digital Library

[26]

B. Bishop, A. Kiryakov, D. Ognyanoff, I. Peikov, Z. Tashev, and R. Velkov, "OWLIM: A family of scalable semantic repositories," Semantic Web, vol. 2, no. 1, 2011.

Digital Library

[27]

"3store," http://www.aktors.org/technologies/3store.

[28]

"Jena," http://jena.sourceforge.net.

[29]

"Owlim," http://owlim.ontotext.com.

[30]

"Sesame," http://www.openrdf.org.

[31]

"Virtuoso," http://virtuoso.openlinksw.com.

[32]

C. Gutierrez, C. A. Hurtado, and A. A. Vaisman, "RDFS update: From theory to practice," in ESWC, 2011.

Digital Library

[33]

S. J. Russell and P. Norvig, Artificial Intelligence - A Modern Approach. Pearson Education, 2010.

Digital Library

Cited By

Javed HKhan KCheema MAlgarni APark J(2024)Instance-Based Lossless Summarization of Knowledge Graph With Optimized Triples and Corrections (IBA-OTC)IEEE Access10.1109/ACCESS.2023.334098412(5584-5604)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2023.3340984
Rodriguez OUlliana FMugnier M(2023)Scalable Reasoning on Document Stores via Instance-Aware Query RewritingProceedings of the VLDB Endowment10.14778/3611479.361148116:11(2699-2713)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611481
Belhajjame KMejri M(2023)Online maintenance of evolving knowledge graphs with RDFS-based saturation and why-provenance supportWeb Semantics: Science, Services and Agents on the World Wide Web10.1016/j.websem.2023.10079678:COnline publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1016/j.websem.2023.100796
Show More Cited By

Index Terms

Efficient query answering against dynamic RDF databases
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Reformulation-Based Query Answering for RDF Graphs with RDFS Ontologies
The Semantic Web
Abstract
Query answering in RDF knowledge bases has traditionally been performed either through graph saturation, i.e., adding all implicit triples to the graph, or through query reformulation, i.e., modifying the query to look for the explicit triples ...
Read More
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

We propose a new family of description logics (DLs), called DL-Lite , specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts and ...
Read More
Paraconsistent query answering over DL-Lite ontologies

Consistent query answering over description logic based ontologies is an important topic in ontology engineering as it can provide meaningful answers to queries posed over inconsistent ontologies. Current approaches for dealing with this problem usually ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

EDBT '13: Proceedings of the 16th International Conference on Extending Database Technology

March 2013

793 pages

ISBN:9781450315975

DOI:10.1145/2452376

General Chair:
Giovanna Guerrini
Università di Genova, Italy
,
Program Chair:
Norman W. Paton
University of Manchester, UK

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 March 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

EDBT/ICDT '13

EDBT/ICDT '13: Joint 2013 EDBT/ICDT Conferences

March 18 - 22, 2013

Genoa, Italy

Acceptance Rates

Overall Acceptance Rate 7 of 10 submissions, 70%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
267
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)1

Other Metrics

View Author Metrics

Citations

Cited By

Javed HKhan KCheema MAlgarni APark J(2024)Instance-Based Lossless Summarization of Knowledge Graph With Optimized Triples and Corrections (IBA-OTC)IEEE Access10.1109/ACCESS.2023.334098412(5584-5604)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2023.3340984
Rodriguez OUlliana FMugnier M(2023)Scalable Reasoning on Document Stores via Instance-Aware Query RewritingProceedings of the VLDB Endowment10.14778/3611479.361148116:11(2699-2713)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611481
Belhajjame KMejri M(2023)Online maintenance of evolving knowledge graphs with RDFS-based saturation and why-provenance supportWeb Semantics: Science, Services and Agents on the World Wide Web10.1016/j.websem.2023.10079678:COnline publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1016/j.websem.2023.100796
Ambre Ayats HCellier PFerré S(2023)Concepts of Neighbors and their Application to Instance-based Learning on Relational DataInternational Journal of Approximate Reasoning10.1016/j.ijar.2023.109059(109059)Online publication date: Oct-2023
https://doi.org/10.1016/j.ijar.2023.109059
Diao YGuzewicz PManolescu IMazuran MLi GLi ZIdreos SSrivastava D(2021)Efficient Exploration of Interesting Aggregates in RDF GraphsProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3457307(392-404)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3457307
Banane MErraissi AEl Khalyly BBelangour AAzzouazi M(2021)ScalSPARQL: A New Scalable system for the mapping of SPARQL Queries to NoSQL languages Based on MDE approach2021 6th International Conference on Renewable Energy: Generation and Applications (ICREGA)10.1109/ICREGA50506.2021.9388294(101-105)Online publication date: 2-Feb-2021
https://doi.org/10.1109/ICREGA50506.2021.9388294
Jia MZhang YLi D(2021)QRDF: An efficient RDF graph processing system for fast queryConcurrency and Computation: Practice and Experience10.1002/cpe.644133:24Online publication date: 21-Jul-2021
https://doi.org/10.1002/cpe.6441
Kaoudi ZManolescu IZampetakis S(2020)Cloud-Based RDF Data ManagementSynthesis Lectures on Data Management10.2200/S00986ED1V01Y202001DTM06215:1(1-103)Online publication date: 24-Feb-2020
https://doi.org/10.2200/S00986ED1V01Y202001DTM062
Chabin JEichler CHalfeld-Ferrari MHiot N(2020)Graph Rewriting Rules for RDF Database Evolution ManagementProceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services10.1145/3428757.3429126(134-143)Online publication date: 30-Nov-2020
https://dl.acm.org/doi/10.1145/3428757.3429126
Goasdoué FGuzewicz PManolescu I(2020)RDF graph summarization for first-sight structure discoveryThe VLDB Journal10.1007/s00778-020-00611-yOnline publication date: 30-Apr-2020
https://doi.org/10.1007/s00778-020-00611-y
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents