Indexed by：
Abstract：
With the rapid development of information technology, data grows explosionly, how to deal with the large scale data become more and more important. Based on the characteristics of RDF data, we propose to compress RDF data. We construct an index structure called PAR-Tree Index, then base on the MapReduce parallel computing framework and the PAR-Tree Index to execute the query. Experimental results show that the algorithm can improve the efficiency of large data query. © (2014) Trans Tech Publications, Switzerland.
Keyword：
Reprint 's Address：
Email：
Source ：
Applied Mechanics and Materials
ISSN： 1660-9336
Year： 2014
Volume： 441
Page： 691-694
Language： English
Cited Count：
WoS CC Cited Count： 0
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
