Structural Change Detection Technique for RDF Data in MapReduce


KIPS Transactions on Software and Data Engineering, Vol. 3, No. 8, pp. 293-298, Aug. 2014
10.3745/KTSDE.2014.3.8.293,   PDF Download:

Abstract

Detecting and understanding the changes between RDF data is crucial in the evolutionary process, synchronization system, and versioning system on the web of data. However, current researches on detecting changes still remain unsatisfactory in that they did neither consider the large scale of RDF data nor accurately produce the RDF deltas. In this paper, we propose a scalable and effective change detection using a MapReduce framework which has been used in many fields to process and analyze large volumes of data. In particular, we focus on the structure-based change detection that adopts a strategy for the comparison of blank nodes in RDF data. To achieve this, we employ a method which is composed of two MapReduce jobs. First job partitions the triples with blank nodes by grouping each triple with the same blank node ID and then computes the incoming path to the blank node. Second job partitions the triples with the same path and matchs blank nodes with the Hungarian method. In experiments, we show that our approach is more accurate and effective than the previous approach.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
T. W. Lee and D. H. In, "Structural Change Detection Technique for RDF Data in MapReduce," KIPS Transactions on Software and Data Engineering, vol. 3, no. 8, pp. 293-298, 2014. DOI: 10.3745/KTSDE.2014.3.8.293.

[ACM Style]
Tae Whi Lee and Dong Hyuk In. 2014. Structural Change Detection Technique for RDF Data in MapReduce. KIPS Transactions on Software and Data Engineering, 3, 8, (2014), 293-298. DOI: 10.3745/KTSDE.2014.3.8.293.