{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:27:11Z","timestamp":1758274031635},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2019,8]]},"abstract":"\n RDF data is complex; exploring it is hard, and can be done through many different metaphors. We have developed and propose to demonstrate Spade, a tool helping users discover meaningful content of an RDF graph by showing them the results of\n aggregation (OLAP-style)<\/jats:italic>\n queries automatically identified from the data. Spade chooses aggregates that are\n visually interesting<\/jats:italic>\n , a property formally based on statistic properties of the aggregation query results.\n <\/jats:p>\n \n While well understood for relational data, such exploration raises multiple challenges for RDF: facts, dimensions and measures have to be\n identified<\/jats:italic>\n (as opposed to known beforehand); as there are more candidate aggregates, assessing their interestingness can be very costly; finally,\n ontologies<\/jats:italic>\n bring novel specific challenges but also novel opportunities, enabling\n ontology-driven exploration<\/jats:italic>\n from an aggregate initially proposed by the system.\n <\/jats:p>\n \n Spade is a\n generic, extensible framework<\/jats:italic>\n , which we instantiated with: (\n i<\/jats:italic>\n ) novel methods for enumerating candidate measures and dimensions in the vast space of possibilities provided by an RDF graph; (\n ii<\/jats:italic>\n ) a set of aggregate interestingness functions; (\n iii<\/jats:italic>\n ) ontology-based interactive exploration, and (\n iv<\/jats:italic>\n ) efficient early-stop techniques for estimating the interestingness of an aggregate query.\n <\/jats:p>\n The demonstration will comprise interactive scenarios on a variety of large, interesting RDF graphs.<\/jats:p>","DOI":"10.14778\/3352063.3352101","type":"journal-article","created":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T18:36:11Z","timestamp":1568831771000},"page":"1926-1929","source":"Crossref","is-referenced-by-count":8,"title":["Spade"],"prefix":"10.14778","volume":"12","author":[{"given":"Yanlei","family":"Diao","sequence":"first","affiliation":[{"name":"LIX, France and University of Massachusetts"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Guzewicz","sequence":"additional","affiliation":[{"name":"LIX, France and Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioana","family":"Manolescu","sequence":"additional","affiliation":[{"name":"LIX, France and Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirjana","family":"Mazuran","sequence":"additional","affiliation":[{"name":"LIX, France and Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2015.7129548"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2018.11.007"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994532"},{"key":"e_1_2_1_4_1","volume-title":"ISWC Posters & Demonstrations and Industry Tracks","author":"Diao Y.","year":"2017","unstructured":"Y. Diao , I. Manolescu , and S. Shang . Dagger: Digging for interesting aggregates in RDF graphs . In ISWC Posters & Demonstrations and Industry Tracks , 2017 . Y. Diao, I. Manolescu, and S. Shang. Dagger: Digging for interesting aggregates in RDF graphs. In ISWC Posters & Demonstrations and Industry Tracks, 2017."},{"key":"e_1_2_1_5_1","first-page":"566","volume-title":"EDBT","author":"Goasdou\u00e9 F.","year":"2019","unstructured":"F. Goasdou\u00e9 , P. Guzewicz , and I. Manolescu . Incremental structural summarization of RDF graphs . In EDBT , pages 566 -- 569 , 2019 . F. Goasdou\u00e9, P. Guzewicz, and I. Manolescu. Incremental structural summarization of RDF graphs. In EDBT, pages 566--569, 2019."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658047"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233333"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253291"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3193545"},{"key":"e_1_2_1_10_1","volume-title":"EDBT Workshops","author":"Manolescu I.","year":"2019","unstructured":"I. Manolescu and M. Mazuran . Speeding up RDF aggregate discovery through sampling . In EDBT Workshops , 2019 . I. Manolescu and M. Mazuran. Speeding up RDF aggregate discovery through sampling. In EDBT Workshops, 2019."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035922"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831371"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3193566"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253288"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3352063.3352101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:36:05Z","timestamp":1672223765000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3352063.3352101"}},"subtitle":["a modular framework for analytical exploration of RDF graphs"],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":14,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["10.14778\/3352063.3352101"],"URL":"https:\/\/doi.org\/10.14778\/3352063.3352101","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}