Speeding up RDF aggregate discovery through sampling - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Speeding up RDF aggregate discovery through sampling

(1) , (1)


RDF graphs can be large and complex; finding out interesting information within them is challenging. One easy method for users to discover such graphs is to be shown interesting aggregates (un-der the form of two-dimensional graphs, i.e., bar charts), where interestingness is evaluated through statistics criteria. Dagger [5] pioneered this approach, however its is quite inefficient, in particular due to the need to evaluate numerous, expensive aggregation queries. In this work, we describe Dagger + , which builds upon Dagger and leverages sampling to speed up the evaluation of potentially interesting aggregates. We show that Dagger + achieves very significant execution time reductions, while reaching results very close to those of the original, less efficient system.
Fichier principal
Vignette du fichier
main-bigvis2019-CAMERA-READY.pdf (628.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02065993 , version 1 (19-03-2019)


  • HAL Id : hal-02065993 , version 1


Ioana Manolescu, Mirjana Mazuran. Speeding up RDF aggregate discovery through sampling. BigVis 2019 - 2nd International Workshop on Big Data Visual Exploration and Analytics, Mar 2019, Lisbon, Portugal. ⟨hal-02065993⟩
79 View
77 Download


Gmail Facebook Twitter LinkedIn More