On the Efficiency of Querying and Storing RDF Documents

On the Efficiency of Querying and Storing RDF Documents

Maria-Esther Vidal, Amadís Martínez, Edna Ruckhaus, Tomas Lampo, Javier Sierra
Copyright: © 2012 |Pages: 32
ISBN13: 9781613500538|ISBN10: 161350053X|EISBN13: 9781613500545
DOI: 10.4018/978-1-61350-053-8.ch016
Cite Chapter Cite Chapter

MLA

Vidal, Maria-Esther, et al. "On the Efficiency of Querying and Storing RDF Documents." Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, IGI Global, 2012, pp. 354-385. https://doi.org/10.4018/978-1-61350-053-8.ch016

APA

Vidal, M., Martínez, A., Ruckhaus, E., Lampo, T., & Sierra, J. (2012). On the Efficiency of Querying and Storing RDF Documents. In S. Sakr & E. Pardede (Eds.), Graph Data Management: Techniques and Applications (pp. 354-385). IGI Global. https://doi.org/10.4018/978-1-61350-053-8.ch016

Chicago

Vidal, Maria-Esther, et al. "On the Efficiency of Querying and Storing RDF Documents." In Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, 354-385. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-61350-053-8.ch016

Export Reference

Mendeley
Favorite

Abstract

In the context of the Semantic Web, different approaches have been defined to represent RDF documents, and the selected representation affects storage and time complexity of the RDF data recovery and query processing tasks. This chapter addresses the problem of efficiently querying and storing RDF documents, and presents an alternative representation of RDF data, Bhyper, which is based on hypergraphs. Additionally, access and optimization techniques to efficiently execute queries with low cost, are defined on top of this hypergraph based representation. The chapter’s authors have empirically studied the performance of the Bhyper based techniques, and their experimental results show that the proposed hypergraph based formalization reduces the RDF data access time as well as the space needed to store the Bhyper structures, while the query execution time of state-the-of-art RDF engines can be sped up by up to two orders of magnitude.

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.