TY - GEN
T1 - RDF data-centric storage
AU - Levandoski, Justin J.
AU - Mokbel, Mohamed F.
PY - 2009/11/19
Y1 - 2009/11/19
N2 - The vision of the Semantic Web has brought about new challenges at the intersection of web research and data management. One fundamental research issue at this intersection is the storage of the Resource Description Framework (RDF) data: the model at the core of the Semantic Web. We present a data-centric approach for storage of RDF in relational databases. The intuition behind our approach is that each RDF dataset requires a tailored table schema that achieves efficient query processing by (1) reducing the need for joins in the query plan and (2) keeping null storage below a given threshold. Using a basic structure derived from the RDF data, we propose a two-phase algorithm involving clustering and partitioning. The clustering phase aims to reduce the need for joins in a query. The partitioning phase aims to optimize storage of extra (i.e., null) data in the underlying relational database. Our approach does not assume a particular query workload, relevant for RDF knowledge bases with a large number of ad-hoc queries. Extensive experimental evidence using three publicly available real-world RDF data sets (i.e., DBLP, DBPedia, and Uniprot) shows that our schema creation technique provides superior query processing performance compared to state-of-the art storage approaches. Further, our approach is easily implemented, and complements existing RDF-specific databases.
AB - The vision of the Semantic Web has brought about new challenges at the intersection of web research and data management. One fundamental research issue at this intersection is the storage of the Resource Description Framework (RDF) data: the model at the core of the Semantic Web. We present a data-centric approach for storage of RDF in relational databases. The intuition behind our approach is that each RDF dataset requires a tailored table schema that achieves efficient query processing by (1) reducing the need for joins in the query plan and (2) keeping null storage below a given threshold. Using a basic structure derived from the RDF data, we propose a two-phase algorithm involving clustering and partitioning. The clustering phase aims to reduce the need for joins in a query. The partitioning phase aims to optimize storage of extra (i.e., null) data in the underlying relational database. Our approach does not assume a particular query workload, relevant for RDF knowledge bases with a large number of ad-hoc queries. Extensive experimental evidence using three publicly available real-world RDF data sets (i.e., DBLP, DBPedia, and Uniprot) shows that our schema creation technique provides superior query processing performance compared to state-of-the art storage approaches. Further, our approach is easily implemented, and complements existing RDF-specific databases.
UR - http://www.scopus.com/inward/record.url?scp=70449469200&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449469200&partnerID=8YFLogxK
U2 - 10.1109/ICWS.2009.49
DO - 10.1109/ICWS.2009.49
M3 - Conference contribution
AN - SCOPUS:70449469200
SN - 9780769537092
T3 - 2009 IEEE International Conference on Web Services, ICWS 2009
SP - 911
EP - 918
BT - 2009 IEEE International Conference on Web Services, ICWS 2009
T2 - 2009 IEEE International Conference on Web Services, ICWS 2009
Y2 - 6 July 2009 through 10 July 2009
ER -