Efficient Indexing RDF Query Algorithm for Big Data

Yi Qun Zeng; Jing Bin Wang

doi:10.4028/www.scientific.net/AMM.441.691

Paper Titles

A Non-Uniform Regional Partition Coding of One Dimension Signal and its Application
p.674

An Extended Knapsack Public Key Cryptosystem
p.678

Boundary Detection for Non-Ideal Iris Based on Gray Transform
p.682

Comparison of Rapid Extraction Algorithms of Major Colors
p.687

Efficient Indexing RDF Query Algorithm for Big Data
p.691

Method for CCD Edge Signal Processing
p.695

Recent Advances in High Dynamic Range Imaging
p.699

Personal Identification Using Finger-Knuckle-Print Based on Local Binary Pattern
p.703

Color and Texture Features Based Image Retrieval
p.707

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 441Efficient Indexing RDF Query Algorithm for Big...

Efficient Indexing RDF Query Algorithm for Big Data

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.

You might also be interested in these eBooks

Machinery Electronics and Control Engineering III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 441)

Pages:

691-694

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.441.691

Citation:

Cite this paper

Online since:

December 2013

Authors:

Yi Qun Zeng, Jing Bin Wang

Keywords:

Hadoop, PAR-Tree Index, RDF, SPARQL

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Klyne G, Carroll J J, McBride B. Resource description ramework(RDF): Conceptes and abstract syntax, W3C recommendation. World Wide Web Consortium(W3C), (2004).

Google Scholar

[2] Prud'hommeaux E, Seaborne A . SPARQL query language for RDF. W3C rendatiom Wom Wide Web ConsortiLlln(W3C), (2008).

Google Scholar

[3] Udrea O, Pugliese A, Subrahmanian VS. Grin: A graph based RDF index. In: Holte RC, ed. Proc. of the 23rd AAAI Conf. on Artificial Intelligence (AAAI 2007). Vancouver: AAAI Press, 2007. 1465−1470.

Google Scholar

[4] Zou L, Mo J, Chen L, et al. gStore: answering SPARQL queries via subgraph matching[J]. Proceedings of the VLDB Endowment, 2011, 4(8): 482-493.

DOI: 10.14778/2002974.2002976

Google Scholar

[5] Lu Bin, Du Xiaoyong, and Wang Yan. SPARQL Query Optimization Based on Property Correlations [J]. Journal of Computer Research and Development, 2009, 46: 119-125.

Google Scholar

[6] Query S. SPARQL Query Optimization Based on Dynamic Schema Structure[J]. Journal of Computer Research and Development, 2010, 47: 43-47.

Google Scholar

[7] Ye Y X, Ouyang D T. Optimize SPARQL by combining semantic reduction and selectivity estimation[J]. Dianzi Xuebao(Acta Electronica Sinica), 2010, 38(5): 1205-1210.

Google Scholar

[8] White T. Hadoop: the definitive guide[M]. O'Reilly, (2012).

Google Scholar

[9] Borthakur D. HDFS architecture guide[J]. Hadoop Apache Project. http: /hadoop. apache. org/common/docs/current/hdfs_design. pdf, (2008).

Google Scholar

[10] Guo Y, Pan Z, Heflin J. LUBM: A benchmark for OWL knowledge base systems[J]. Web Semantics: Science, Services and Agents on the World Wide Web, 2005, 3(2): 158-182.

DOI: 10.1016/j.websem.2005.06.005

Google Scholar