D52

From Kolflow Project

Jump to: navigation, search

Deliverable description

Code : D5.2

Task / Sub-task : Task5

Deadline : month 12

Description : Many semantic web applications integrate data from distributed triple stores and to be efficient, they need to know what kind of content each triple store holds in order to assess if it can contribute to its queries. We present an algorithm to build indexes summarizing the content of triple stores. We extended Depth-First Search coding to provide a canonical representation of RDF graphs and we introduce a new join operator between two graph codes to optimize the generation of an index. We provide an incremental update algorithm and conclude with tests on real datasets.

Concerns : Kolflow

Status : yes


This deliverable corresponds to:

     
This page was last modified on 21 May 2012, at 17:31. This page has been accessed 2,297 times.