Please wait a minute...
Front. Inform. Technol. Electron. Eng.  2012, Vol. 13 Issue (4): 281-294    DOI: 10.1631/jzus.C1101009
    
Improving SPARQL query performance with algebraic expression tree based caching and entity caching
Gang Wu, Meng-dong Yang
College of Information Science and Engineering, Northeastern University, Shenyang 110004, China; MOE Key Laboratory of Medical Image Computing, Northeastern University, Shenyang 110004, China; School of Computer Science and Engineering, Southeast University, Nanjing 210096, China
Download:   PDF(0KB)
Export: BibTeX | EndNote (RIS)      

Abstract  To obtain comparable high query performance with relational databases, diverse database technologies have to be adapted to confront the complexity posed by both Resource Description Framework (RDF) data and SPARQL query. Database caching is one of such technologies that improves the performance of database with reasonable space expense based on the spatial/ temporal/semantic locality principle. However, existing caching schemes exploited in RDF stores are found to be dysfunctional for complex query semantics. Although semantic caching approaches work effectively in this case, little work has been done in this area. In this paper, we try to improve SPARQL query performance with semantic caching approaches, i.e., SPARQL algebraic expression tree (AET) based caching and entity caching. Successive queries with multiple identical sub-queries and star-shaped joins can be efficiently evaluated with these two approaches. The approaches are implemented on a two-level-storage structure. The main memory stores the most frequently accessed cache items, and items swapped out are stored on the disk for future possible reuse. Evaluation results on three mainstream RDF benchmarks illustrate the effectiveness and efficiency of our approaches. Comparisons with previous research are also provided.

Key wordsSPARQL      Resource Description Framework (RDF)      Semantic caching      Algebraic expression tree (AET)      Entity     
Received: 08 August 2011      Published: 07 April 2012
CLC:  TP392  
Cite this article:

Gang Wu, Meng-dong Yang. Improving SPARQL query performance with algebraic expression tree based caching and entity caching. Front. Inform. Technol. Electron. Eng., 2012, 13(4): 281-294.

URL:

http://www.zjujournals.com/xueshu/fitee/10.1631/jzus.C1101009     OR     http://www.zjujournals.com/xueshu/fitee/Y2012/V13/I4/281


Improving SPARQL query performance with algebraic expression tree based caching and entity caching

To obtain comparable high query performance with relational databases, diverse database technologies have to be adapted to confront the complexity posed by both Resource Description Framework (RDF) data and SPARQL query. Database caching is one of such technologies that improves the performance of database with reasonable space expense based on the spatial/ temporal/semantic locality principle. However, existing caching schemes exploited in RDF stores are found to be dysfunctional for complex query semantics. Although semantic caching approaches work effectively in this case, little work has been done in this area. In this paper, we try to improve SPARQL query performance with semantic caching approaches, i.e., SPARQL algebraic expression tree (AET) based caching and entity caching. Successive queries with multiple identical sub-queries and star-shaped joins can be efficiently evaluated with these two approaches. The approaches are implemented on a two-level-storage structure. The main memory stores the most frequently accessed cache items, and items swapped out are stored on the disk for future possible reuse. Evaluation results on three mainstream RDF benchmarks illustrate the effectiveness and efficiency of our approaches. Comparisons with previous research are also provided.

关键词: SPARQL,  Resource Description Framework (RDF),  Semantic caching,  Algebraic expression tree (AET),  Entity 
[1] Hui Chen, Bao-gang Wei, Yi-ming Li, Yong-huai Liu, Wen-hao Zhu. An easy-to-use evaluation framework for benchmarking entity recognition and disambiguation systems[J]. Front. Inform. Technol. Electron. Eng., 2017, 18(2): 195-205.
[2] Le-kui Zhou, Si-liang Tang, Jun Xiao, Fei Wu, Yue-ting Zhuang. Disambiguating named entities with deep supervised learning via crowd labels[J]. Front. Inform. Technol. Electron. Eng., 2017, 18(1): 97-106.
[3] Feng-he Wang, Chun-xiao Wang, Zhen-hua Liu. Efficient hierarchical identity based encryption scheme in the standard model over lattices[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(8): 781-791.
[4] Jia Xie, Yu-pu Hu, Jun-tao Gao, Wen Gao. Efficient identity-based signature over NTRU lattice[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(2): 135-142.
[5] Jie Zhou, Bi-cheng Li, Gang Chen. Automatically building large-scale named entity recognition corpora from Chinese Wikipedia[J]. Front. Inform. Technol. Electron. Eng., 2015, 16(11): 940-956.
[6] Shuang Tan, Yan Jia. NaEPASC: a novel and efficient public auditing scheme for cloud data[J]. Front. Inform. Technol. Electron. Eng., 2014, 15(9): 794-804.
[7] Yang Yang, Yu-pu Hu, Le-you Zhang, Chun-hui Sun. CCA2 secure biometric identity based encryption with constant-size ciphertext[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(10): 819-827.