{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T07:01:13Z","timestamp":1769929273432,"version":"3.49.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2015,8]]},"abstract":"<jats:p>\n            The Resource Description Framework (RDF) is a graph-based data model promoted by the W3C as the standard for Semantic Web applications. Its associated query language is SPARQL. RDF graphs are often\n            <jats:italic>large<\/jats:italic>\n            and\n            <jats:italic>varied<\/jats:italic>\n            , produced in a variety of contexts, e.g., scientific applications, social or online media, government data etc. They are\n            <jats:italic>heterogeneous<\/jats:italic>\n            , i.e., resources described in an RDF graph may have very different sets of properties. An RDF resource may have: no types, one or several types (which may or may not be related to each other).\n            <jats:italic>RDF Schema<\/jats:italic>\n            (RDFS) information may optionally be attached to an RDF graph, to enhance the description of its resources. Such statements also entail that in an RDF graph, some data is\n            <jats:bold>implicit.<\/jats:bold>\n            According to the W3C RDF and SPARQL specification,\n            <jats:bold>the semantics of an RDF graph comprises both its explicit and implicit data<\/jats:bold>\n            ; in particular, SPARQL query answers must be computed\n            <jats:italic>reflecting both the explicit and implicit data.<\/jats:italic>\n            These features make RDF graphs complex, both structurally and conceptually. It is intrinsically hard to get familiar with a new RDF dataset, especially if an RDF schema is sparse or not available at all.\n          <\/jats:p>","DOI":"10.14778\/2824032.2824124","type":"journal-article","created":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T12:18:17Z","timestamp":1442405897000},"page":"2012-2015","source":"Crossref","is-referenced-by-count":29,"title":["Query-oriented summarization of RDF graphs"],"prefix":"10.14778","volume":"8","author":[{"given":"\u0160ejla","family":"\u010cebiri\u0107","sequence":"first","affiliation":[{"name":"INRIA &amp; U. Paris-Sud, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Goasdou\u00e9","sequence":"additional","affiliation":[{"name":"U. Rennes 1 &amp; INRIA, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioana","family":"Manolescu","sequence":"additional","affiliation":[{"name":"INRIA &amp; U. Paris-Sud, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"IDEAS","author":"Campinas St\u00e9phane","year":"2013","unstructured":"St\u00e9phane Campinas , Renaud Delbru , and Giovanni Tummarello . Efficiency and precision trade-offs in graph summary algorithms . In IDEAS , 2013 . St\u00e9phane Campinas, Renaud Delbru, and Giovanni Tummarello. Efficiency and precision trade-offs in graph summary algorithms. In IDEAS, 2013."},{"key":"e_1_2_1_2_1","volume-title":"ICDE","author":"Goasdou\u00e9 Fran\u00e7ois","year":"2015","unstructured":"Fran\u00e7ois Goasdou\u00e9 , Zoi Kaoudi , Ioana Manolescu , Jorge-Arnulfo Quian\u00e9-Ruiz , and Stamatis Zampetakis . CliqueSquare : Flat Plans for Massively Parallel RDF Queries . In ICDE , 2015 . Fran\u00e7ois Goasdou\u00e9, Zoi Kaoudi, Ioana Manolescu, Jorge-Arnulfo Quian\u00e9-Ruiz, and Stamatis Zampetakis. CliqueSquare: Flat Plans for Massively Parallel RDF Queries. In ICDE, 2015."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic graph theory","author":"Godsil Chris","year":"2001","unstructured":"Chris Godsil and Gordon Royle . Algebraic graph theory . Springer-Verlag , 2001 . Chris Godsil and Gordon Royle. Algebraic graph theory. Springer-Verlag, 2001."},{"key":"e_1_2_1_4_1","volume-title":"VLDB","author":"Goldman Roy","year":"1997","unstructured":"Roy Goldman and Jennifer Widom . Dataguides : Enabling query formulation and optimization in semistructured databases . In VLDB , 1997 . Roy Goldman and Jennifer Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In VLDB, 1997."},{"key":"e_1_2_1_5_1","volume-title":"SWIM workshop","author":"Gurajada Sairam","year":"2014","unstructured":"Sairam Gurajada , Stephan Seufert , Iris Miliaraki , and Martin Theobald . Using graph summarization for join-ahead pruning in a distributed RDF engine . In SWIM workshop , 2014 . 10.1145\/2630602.2630610 Sairam Gurajada, Stephan Seufert, Iris Miliaraki, and Martin Theobald. Using graph summarization for join-ahead pruning in a distributed RDF engine. In SWIM workshop, 2014. 10.1145\/2630602.2630610"},{"key":"e_1_2_1_6_1","volume-title":"EGC","author":"Kellou-Menouer Kenza","year":"2015","unstructured":"Kenza Kellou-Menouer and Zoubida Kedad . A clustering based approach for type discovery in RDF data sources . In EGC , 2015 . Kenza Kellou-Menouer and Zoubida Kedad. A clustering based approach for type discovery in RDF data sources. In EGC, 2015."},{"key":"e_1_2_1_7_1","volume-title":"ESWC","author":"Khatchadourian Shahan","year":"2010","unstructured":"Shahan Khatchadourian and Mariano P. Consens . ExpLOD: Summary-based exploration of interlinking and RDF usage in the linked open data cloud . In ESWC , 2010 . 10.1007\/978-3-642-13489-0_19 Shahan Khatchadourian and Mariano P. Consens. ExpLOD: Summary-based exploration of interlinking and RDF usage in the linked open data cloud. In ESWC, 2010. 10.1007\/978-3-642-13489-0_19"},{"key":"e_1_2_1_8_1","volume-title":"EDBT","author":"Lanti Davide","year":"2015","unstructured":"Davide Lanti , Martin Rezk , Guohui Xiao , and Diego Calvanese . The NPD benchmark: Reality check for OBDA systems . In EDBT , 2015 . Davide Lanti, Martin Rezk, Guohui Xiao, and Diego Calvanese. The NPD benchmark: Reality check for OBDA systems. In EDBT, 2015."},{"key":"e_1_2_1_9_1","volume-title":"ESWC","author":"Picalausa Fran\u00e7ois","year":"2012","unstructured":"Fran\u00e7ois Picalausa , Yongming Luo , George H. L. Fletcher , Jan Hidders , and Stijn Vansummeren . A structural approach to indexing triples . In ESWC , 2012 . Fran\u00e7ois Picalausa, Yongming Luo, George H. L. Fletcher, Jan Hidders, and Stijn Vansummeren. A structural approach to indexing triples. In ESWC, 2012."},{"key":"e_1_2_1_10_1","volume-title":"GRIN: A graph based RDF index","author":"Udrea Octavian","year":"2007","unstructured":"Octavian Udrea , Andrea Pugliese , and V. S. Subrahmanian . GRIN: A graph based RDF index . In AAAI. AAAI Press , 2007 . Octavian Udrea, Andrea Pugliese, and V. S. Subrahmanian. GRIN: A graph based RDF index. In AAAI. AAAI Press, 2007."},{"key":"e_1_2_1_11_1","volume-title":"gromgull.net\/blog\/2010\/09\/btc2010-basic-stats","author":"The Billion Triple Challenge Statistics","year":"2010","unstructured":"Statistics on The Billion Triple Challenge Dataset. gromgull.net\/blog\/2010\/09\/btc2010-basic-stats , 2010 . Statistics on The Billion Triple Challenge Dataset. gromgull.net\/blog\/2010\/09\/btc2010-basic-stats, 2010."},{"key":"e_1_2_1_12_1","unstructured":"Extended version of this work (technical report) 2015.  Extended version of this work (technical report) 2015."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2824032.2824124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:04:55Z","timestamp":1672221895000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2824032.2824124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":12,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["10.14778\/2824032.2824124"],"URL":"https:\/\/doi.org\/10.14778\/2824032.2824124","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2015,8]]}}}