Query Execution for RDF Data Using Structure Indexed Vertical Partitioning

The paper explores use of various partitioning methods to store RDF data effectively, to meet the needs of extensively growing highly interactive semantic web applications. It proposes a combinational approach of structure index partitioning and vertical partitioning--SIVP and demonstrates the implementation of SIVP. The paper presents five metrics to measure and analyze performance of SIVP store. SIVP is experimented on FOAF and SwetoDBLP datasets. SIVP store have shown an average of 34% gain over vertical partitioning for FOAF dataset. For SwetoDBLP dataset, SIVP have shown an average of 26% gain over VP. SIVP is better than vertical partitioning provided extra time needed in SIVP, which consists of lookup time and merge time, is compensated by frequency of a query higher than breakeven point for that query.