DocumentCode
712782
Title
Efficient and Scalable SPARQL Query Processing with Transformed Table
Author
Sheng-Wei Huang ; Chia-Ho Yu ; Ce-Kuen Shieh ; Ming-Fong Tsai
Author_Institution
Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan
fYear
2015
fDate
9-12 March 2015
Firstpage
103
Lastpage
106
Abstract
Resource Description Framework (RDF) is the core technology of Semantic Web and has been more and more popular in recent years. With the rapid growth of the RDF data, the Triple Store, which is the query engine and RDF data storage, requires more scalable and efficient technologies. To improve the scalability and the performance of triple query, which is called SPARQL query processing, Map Reduce programming model and NoSQL database system such as H Base are well-known solutions for large scale data processing. However, in general case, the subject of a triple is regarded as Row Key in the table. In some queries, finding matched triple patterns is a time-consuming job. Therefore, we design another table with different storage schema called Transformed Table to reduce the time cost for read operation. The experimental results show that using Transformed Table can improve the triple query performance significantly.
Keywords
decision tables; pattern matching; query languages; query processing; NoSQL database system; RDF data storage; SPARQL query processing; map reduce programming model; matched triple patterns; query engine; resource description framework; row key; semantic Web; storage schema; transformed table; triple query performance; triple store; Conferences; Data models; Government; Next generation networking; Resource description framework; Time factors;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications and Networking Conference Workshops (WCNCW), 2015 IEEE
Conference_Location
New Orleans, LA
Type
conf
DOI
10.1109/WCNCW.2015.7122537
Filename
7122537
Link To Document