{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:19:34Z","timestamp":1777889974391,"version":"3.51.4"},"reference-count":44,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T00:00:00Z","timestamp":1680652800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SW"],"published-print":{"date-parts":[[2023,4,5]]},"abstract":"<jats:p>RDF dataset profiling is the task of extracting a formal representation of a dataset\u2019s features. Such features may cover various aspects of the RDF dataset ranging from information on licensing and provenance to statistical descriptors of the data distribution and its semantics. In this work, we focus on the characteristics sets profile features that capture both structural and semantic information of an RDF dataset, making them a valuable resource for different downstream applications. While previous research demonstrated the benefits of characteristic sets in centralized and federated query processing, access to these fine-grained statistics is taken for granted. However, especially in federated query processing, computing this profile feature is challenging as it can be difficult and\/or costly to access and process the entire data from all federation members. We address this shortcoming by introducing the concept of a profile feature estimation and propose a sampling-based approach to generate estimations for the characteristic sets profile feature. In addition, we showcase the applicability of these feature estimations in federated querying by proposing a query planning approach that is specifically designed to leverage these feature estimations. In our first experimental study, we intrinsically evaluate our approach on the representativeness of the feature estimation. The results show that even small samples of just 0.5 % of the original graph\u2019s entities allow for estimating both structural and statistical properties of the characteristic sets profile features. Our second experimental study extrinsically evaluates the estimations by investigating their applicability in our query planner using the well-known FedBench benchmark. The results of the experiments show that the estimated profile features allow for obtaining efficient query plans.<\/jats:p>","DOI":"10.3233\/sw-222903","type":"journal-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T11:57:22Z","timestamp":1662465442000},"page":"491-526","source":"Crossref","is-referenced-by-count":1,"title":["Characteristic sets profile features: Estimation and application to SPARQL query planning"],"prefix":"10.1177","volume":"14","author":[{"given":"Lars","family":"Heling","sequence":"first","affiliation":[{"name":"AIFB, Karlsruhe Institute of Technology, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maribel","family":"Acosta","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, Ruhr University Bochum, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/SW-222903_ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816740"},{"key":"10.3233\/SW-222903_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63962-8_228-1"},{"key":"10.3233\/SW-222903_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25007-6_7"},{"key":"10.3233\/SW-222903_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25073-6_2"},{"issue":"2","key":"10.3233\/SW-222903_ref5","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/2601438","article-title":"Network sampling: From static to streaming graphs","volume":"8","author":"Ahmed","year":"2013","journal-title":"TKDD"},{"key":"10.3233\/SW-222903_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33876-2_31"},{"key":"10.3233\/SW-222903_ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2010.5452762"},{"key":"10.3233\/SW-222903_ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380123"},{"issue":"3","key":"10.3233\/SW-222903_ref9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00778-018-0528-3","article-title":"Summarizing semantic graphs: A survey, VLDB","volume":"28","author":"Cebiric","year":"2019","journal-title":"J."},{"key":"10.3233\/SW-222903_ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2814864.2814886"},{"key":"10.3233\/SW-222903_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18818-8_14"},{"key":"10.3233\/SW-222903_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63962-8_288-1"},{"issue":"5","key":"10.3233\/SW-222903_ref13","doi-asserted-by":"publisher","first-page":"677","DOI":"10.3233\/SW-180294","article-title":"RDF dataset profiling \u2013 a survey of features, methods, vocabularies and applications","volume":"9","author":"Ellefi","year":"2018","journal-title":"Semantic Web"},{"issue":"2","key":"10.3233\/SW-222903_ref14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1177\/0165551516677945","article-title":"Characterising RDF data sets","volume":"44","author":"Fern\u00e1ndez","year":"2018","journal-title":"J. Inf. Sci."},{"key":"10.3233\/SW-222903_ref15","unstructured":"O. G\u00f6rlitz and S. Staab, SPLENDID: SPARQL endpoint federation exploiting VOID descriptions, in: Proceedings of the Second International Workshop on Consuming Linked Data (COLD2011), Bonn, Germany, October 23, 2011, O. Hartig, A. Harth and J.F. Sequeda, eds, CEUR Workshop Proceedings, Vol. 782, 2011, CEUR-WS.org, http:\/\/ceur-ws.org\/Vol-782\/GoerlitzAndStaab_COLD2011.pdf."},{"key":"10.3233\/SW-222903_ref16","doi-asserted-by":"publisher","DOI":"10.5441\/002\/edbt.2014.40"},{"key":"10.3233\/SW-222903_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-49461-2_10"},{"key":"10.3233\/SW-222903_ref18","doi-asserted-by":"crossref","unstructured":"L. Heling and M. Acosta, Cost- and robustness-based query optimization for linked data fragments, in: ISWC (1), Lecture Notes in Computer Science, Vol. 12506, Springer, 2020, pp. 238\u2013257.","DOI":"10.1007\/978-3-030-62419-4_14"},{"key":"10.3233\/SW-222903_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-8265-9_601"},{"key":"10.3233\/SW-222903_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13489-0_19"},{"key":"10.3233\/SW-222903_ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"10.3233\/SW-222903_ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3366030.3366054"},{"issue":"3","key":"10.3233\/SW-222903_ref23","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/62061.62063","article-title":"Statistical profile estimation in database systems","volume":"20","author":"Mannino","year":"1988","journal-title":"ACM Comput. Surv."},{"key":"10.3233\/SW-222903_ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.106"},{"issue":"1","key":"10.3233\/SW-222903_ref25","doi-asserted-by":"publisher","first-page":"982","DOI":"10.14778\/1687627.1687738","article-title":"Preventing bad plans by bounding the impact of cardinality estimation errors","volume":"2","author":"Moerkotte","year":"2009","journal-title":"PVLDB"},{"key":"10.3233\/SW-222903_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68288-4_28"},{"key":"10.3233\/SW-222903_ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767868"},{"issue":"1","key":"10.3233\/SW-222903_ref28","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00778-009-0165-y","article-title":"The RDF-3X engine for scalable management of RDF data","volume":"19","author":"Neumann","year":"2010","journal-title":"VLDB J."},{"key":"10.3233\/SW-222903_ref29","doi-asserted-by":"crossref","unstructured":"M. Newman, Networks, Oxford University Press, 2018.","DOI":"10.1093\/oso\/9780198805090.001.0001"},{"issue":"8","key":"10.3233\/SW-222903_ref30","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3331166","article-title":"Industry-scale knowledge graphs: Lessons and challenges","volume":"62","author":"Noy","year":"2019","journal-title":"Commun. ACM"},{"key":"10.3233\/SW-222903_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45654-6"},{"key":"10.3233\/SW-222903_ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741121"},{"key":"10.3233\/SW-222903_ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195540"},{"key":"10.3233\/SW-222903_ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11915-1_6"},{"key":"10.3233\/SW-222903_ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07443-6_13"},{"key":"10.3233\/SW-222903_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.09.016"},{"key":"10.3233\/SW-222903_ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25073-6_37"},{"key":"10.3233\/SW-222903_ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1804669.1804675"},{"key":"10.3233\/SW-222903_ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30793-6_33"},{"key":"10.3233\/SW-222903_ref40","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.websem.2016.03.003","article-title":"Triple pattern fragments: A low-cost knowledge graph interface for the Web","volume":"37\u201338","author":"Verborgh","year":"2016","journal-title":"J. Web Semant."},{"key":"10.3233\/SW-222903_ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13486-9_16"},{"issue":"1","key":"10.3233\/SW-222903_ref42","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","article-title":"Random sampling with a reservoir","volume":"11","author":"Vitter","year":"1985","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"10.3233\/SW-222903_ref43","doi-asserted-by":"publisher","first-page":"63","DOI":"10.3233\/SW-150175","article-title":"Quality assessment for linked data: A survey","volume":"7","author":"Zaveri","year":"2016","journal-title":"Semantic Web"},{"key":"10.3233\/SW-222903_ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21348-0_34"}],"container-title":["Semantic Web"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SW-222903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:26:28Z","timestamp":1777613188000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SW-222903"}},"subtitle":[],"editor":[{"given":"Sabrina","family":"Kirrane","sequence":"additional","affiliation":[{"name":"Vienna University of Economics and Business, Austria"}],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Axel-Cyrille","family":"Ngonga Ngomo","sequence":"additional","affiliation":[{"name":"Paderborn University, Germany"}],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Sabrina","family":"Kirrane","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Axel-Cyrille","family":"Ngonga Ngomo","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2023,4,5]]},"references-count":44,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/sw-222903","relation":{},"ISSN":["2210-4968","1570-0844"],"issn-type":[{"value":"2210-4968","type":"electronic"},{"value":"1570-0844","type":"print"}],"subject":[],"published":{"date-parts":[[2023,4,5]]}}}