From Kolflow Project
(Difference between revisions)
|
|
| (9 intermediate revisions not shown) |
| Line 3: |
Line 3: |
| | | deadline=12 | | | deadline=12 |
| | | task=Task5 | | | task=Task5 |
| - | | source=[[Incremental characterization of RDF Triple Stores RR-7941 http://hal.inria.fr/hal-00691201]] | + | | source=Kolflow |
| - | | description=Algorithm to summarize the content of a base | + | | 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. |
| | + | |status=yes |
| | }} | | }} |
| | + | |
| | + | This deliverable corresponds to: |
| | + | * [http://hal.inria.fr/hal-00691201 Incremental characterization of RDF Triple Stores, N° RR-7941 (2012)] Adrien Basse, Fabien Gandon, Isabelle Mirbel, Moussa Lo |
Latest revision as of 17:31, 21 May 2012
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:
