hal-00691201, version 2
Incremental characterization of RDF Triple Stores
N° RR-7941 (2012)
Abstract: 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.
- a – INRIA
- b – Université Gaston Berger
- 1:
- Université Gaston Bergé (Saint-Louis, Sénégal)
- 2:
- INRIA – Université Nice Sophia Antipolis [UNS] – CNRS : UMR7271
- 3:
- Université Gaston Berger de Saint-Louis
- Collaboration : LIRIMA
- Domain : Computer Science/Artificial Intelligence
- Keywords : RDF – graph mining – indexation – DFS coding
- Internal note : RR-7941
- Available versions : v1 (2012-04-25) v2 (2012-06-15)
- hal-00691201, version 2
- http://hal.inria.fr/hal-00691201
- oai:hal.inria.fr:hal-00691201
- From:
- Submitted on: Friday, 15 June 2012 10:54:58
- Updated on: Friday, 22 June 2012 14:27:12






Associated documents
See also
Export