FreGraPaD: frequent RDF graph patterns detection for semantic data streams - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

FreGraPaD: frequent RDF graph patterns detection for semantic data streams

Résumé

Nowadays, high volumes of data are generated and published at a very high velocity by real-time systems, such as social networks, e-commerce, weather stations and sensors, producing heterogeneous data streams. To take advantage of linked data and offer interoperable solutions, semantic Web technologies have been used. To analyze these huge volumes of data, different stream mining algorithms exist such as compression or loadshedding. Nevertheless, most of them need many passes through the data and often store part of it on disk. If we want to apply efficient compression on semantic data streams, we need to first detect frequent graph patterns in RDF streams. In this article, we present FreGraPaD, an algorithm that detects those patterns in a single pass, using exclusively internal memory and following a data structure oriented approach. Experimental results clearly confirm the good accuracy of FreGraPaD in detecting frequent graph patterns from semantic data streams

Domaines

Web
Fichier non déposé

Dates et versions

hal-01444487 , version 1 (24-01-2017)

Identifiants

Citer

Fethi Belghaouti, Amel Bouzeghoub, Zakia Imane Kazi-Aoul, Raja Chiky. FreGraPaD: frequent RDF graph patterns detection for semantic data streams. RCIS 2016 : 10th International Conference on Research Challenges in Information Science, Jun 2016, Grenoble, France. pp.1 - 9, ⟨10.1109/RCIS.2016.7549333⟩. ⟨hal-01444487⟩
81 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More