FlexTable: Using a dynamic relation model to store RDF data

12Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Efficient management of RDF data is an important factor in realizing the Semantic Web vision. The existing approaches store RDF data based on triples instead of a relation model. In this paper, we propose a system called FlexTable, where all triples of an instance are coalesced into one tuple and all tuples are stored in relation schemas. The main technical challenge is how to partition all the triples into several tables, i.e. it is needed to design an effective and dynamic schema structure to store RDF triples. To deal with this challenge, we firstly propose a schema evolution method called LBA, which is based on a lattice structure to automatically evolve schemas while new triples are inserted. Secondly, we propose a novel page layout with an interpreted storage format to reduce the physical adjustment cost during schema evolution. Finally we perform comprehensive experiments on two practical RDF data sets to demonstrate that FlexTable is superior to the state-of-the-art approaches. © Springer-Verlag Berlin Heidelberg 2010.

Cite

CITATION STYLE

APA

Wang, Y., Du, X., Lu, J., & Wang, X. (2010). FlexTable: Using a dynamic relation model to store RDF data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5981 LNCS, pp. 580–594). https://doi.org/10.1007/978-3-642-12026-8_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free