{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T15:50:13Z","timestamp":1786290613985,"version":"3.56.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T00:00:00Z","timestamp":1588204800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T00:00:00Z","timestamp":1588204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00778-020-00611-y","type":"journal-article","created":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T17:04:31Z","timestamp":1588266271000},"page":"1191-1218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["RDF graph summarization for first-sight structure discovery"],"prefix":"10.1007","volume":"29","author":[{"given":"Fran\u00e7ois","family":"Goasdou\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Guzewicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ioana","family":"Manolescu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"611_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)"},{"key":"611_CR2","doi-asserted-by":"crossref","unstructured":"Alu\u00e7, G., Hartig, O., \u00d6zsu, M.T., Daudjee, K.: Diversified stress testing of RDF data management systems. In: ISWC, pp. 197\u2013212 (2014)","DOI":"10.1007\/978-3-319-11964-9_13"},{"issue":"2","key":"611_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2009040101","volume":"5","author":"C Bizer","year":"2009","unstructured":"Bizer, C., Schultz, A.: The Berlin SPARQL benchmark. Int. J. Semantic Web Inf. Syst. 5(2), 1\u201324 (2009)","journal-title":"Int. J. Semantic Web Inf. Syst."},{"key":"611_CR4","unstructured":"Bohannon, P., Freire, J., Roy, P., Sim\u00e9on, J.: From XML schema to relations: a cost-based approach to XML storage. In: ICDE (2002)"},{"key":"611_CR5","doi-asserted-by":"crossref","unstructured":"Campinas, S., Delbru, R., Tummarello, G.: Efficiency and precision trade-offs in graph summary algorithms. In: IDEAS (2013)","DOI":"10.1145\/2513591.2513654"},{"key":"611_CR6","unstructured":"\u010cebiri\u0107, \u0160., Goasdou\u00e9, F., Guzewicz, P., Manolescu, I.: Compact summaries of rich heterogeneous graphs. In: Research Report RR-8920, INRIA and U. Rennes 1 (2018). https:\/\/hal.inria.fr\/hal-01325900v6. See also previous version (v5)"},{"key":"611_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00778-018-0528-3","volume":"28","author":"S Cebiric","year":"2018","unstructured":"Cebiric, S., Goasdou\u00e9, F., Kondylakis, H., Kotzinos, D., Manolescu, I., Troullinou, G., Zneika, M.: Summarizing semantic graphs: a survey. VLDB J 28, 295\u2013327 (2018)","journal-title":"VLDB J"},{"key":"611_CR8","unstructured":"\u010cebiri\u0107, \u0160., Goasdou\u00e9, F., Manolescu, I.: A framework for efficient representative summarization of RDF graphs. In: ISWC (poster) (2017)"},{"issue":"1","key":"611_CR9","first-page":"742","volume":"2","author":"C Chen","year":"2009","unstructured":"Chen, C., Lin, C.X., Fredrikson, M., Christodorescu, M., Yan, X., Han, J.: Mining graph patterns efficiently via randomized summaries. PVLDB 2(1), 742\u2013753 (2009)","journal-title":"PVLDB"},{"key":"611_CR10","doi-asserted-by":"crossref","unstructured":"Chen, Q., Lim, A., Ong, K.W.: $$D(K)$$-index: An adaptive structural summary for graph-structured data. In: SIGMOD (2003)","DOI":"10.1145\/872757.872776"},{"issue":"3","key":"611_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1806916.1806920","volume":"4","author":"MP Consens","year":"2010","unstructured":"Consens, M.P., Miller, R.J., Rizzolo, F., Vaisman, A.A.: Exploring XML web collections with DescribeX. TWEB 4(3), 1\u201346 (2010)","journal-title":"TWEB"},{"key":"611_CR12","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Fern\u00e1ndez, M.F., Suciu, D.: Storing semistructured data with STORED. In: SIGMOD (1999)","DOI":"10.1145\/304182.304220"},{"key":"611_CR13","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Wang, X., Wu, Y.: Query preserving graph compression. In: SIGMOD (2012)","DOI":"10.1145\/2213836.2213855"},{"issue":"3","key":"611_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/116873.116878","volume":"23","author":"Z Galil","year":"1991","unstructured":"Galil, Z., Italiano, G.F.: Data structures and algorithms for disjoint set union problems. ACM Comput. Surv. 23(3), 319\u2013344 (1991)","journal-title":"ACM Comput. Surv."},{"key":"611_CR15","unstructured":"Goasdou\u00e9, F., Guzewicz, P., Manolescu, I.: Incremental structural summarization of RDF graphs. In: EDBT. Lisbon (2019). https:\/\/hal.inria.fr\/hal-01978784"},{"key":"611_CR16","doi-asserted-by":"crossref","unstructured":"Goasdou\u00e9, F., Manolescu, I., Roati\u015f, A.: Efficient query answering against dynamic RDF databases. In: EDBT (2013)","DOI":"10.1145\/2452376.2452412"},{"key":"611_CR17","unstructured":"Goldman, R., Widom, J.: Dataguides: Enabling query formulation and optimization in semistructured databases. In: VLDB (1997)"},{"key":"611_CR18","unstructured":"Gubichev, A., Neumann, T.: Exploiting the query structure for efficient join ordering in SPARQL queries. In: EDBT, pp. 439\u2013450 (2014)"},{"issue":"2\u20133","key":"611_CR19","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","volume":"3","author":"Y Guo","year":"2005","unstructured":"Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for OWL knowledge base systems. J. Web Semant. 3(2\u20133), 158\u2013182 (2005)","journal-title":"J. Web Semant."},{"key":"611_CR20","doi-asserted-by":"crossref","unstructured":"Gurajada, S., Seufert, S., Miliaraki, I., Theobald, M.: Using graph summarization for join-ahead pruning in a distributed RDF engine. In: SWIM Workshop (2014)","DOI":"10.1145\/2630602.2630610"},{"key":"611_CR21","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: FOCS (1995)"},{"key":"611_CR22","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: SIGMOD (2002)","DOI":"10.1145\/564691.564707"},{"key":"611_CR23","unstructured":"Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting local similarity for indexing paths in graph-structured data. In: ICDE (2002)"},{"issue":"12","key":"611_CR24","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s00607-015-0454-9","volume":"97","author":"K Khan","year":"2015","unstructured":"Khan, K., Nawaz, W., Lee, Y.: Set-based approximate approach for lossless graph summarization. Computing 97(12), 1185\u20131207 (2015)","journal-title":"Computing"},{"key":"611_CR25","doi-asserted-by":"crossref","unstructured":"Khatchadourian, S., Consens, M.P.: ExpLOD: summary-based exploration of interlinking and RDF usage in the linked open data cloud. In: ESWC (2010)","DOI":"10.1007\/978-3-642-13489-0_19"},{"key":"611_CR26","doi-asserted-by":"crossref","unstructured":"Khatchadourian, S., Consens, M.P.: Constructing bisimulation summaries on a multi-core graph processing framework. In: GRADES Workshop (2015)","DOI":"10.1145\/2764947.2764955"},{"issue":"11","key":"611_CR27","first-page":"2774","volume":"26","author":"W Le","year":"2014","unstructured":"Le, W., Li, F., Kementsietsidis, A., Duan, S.: Scalable keyword search on large RDF data. IEEE TKDE 26(11), 2774\u20132788 (2014)","journal-title":"IEEE TKDE"},{"key":"611_CR28","doi-asserted-by":"crossref","unstructured":"LeFevre, K., Terzi, E.: GraSS: graph structure summarization. In: SDM (2010)","DOI":"10.1137\/1.9781611972801.40"},{"issue":"3","key":"611_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186727","volume":"51","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Safavi, T., Dighe, A., Koutra, D.: Graph summarization methods and applications: a survey. ACM Comput. Surv. 51(3), 1\u201334 (2018)","journal-title":"ACM Comput. Surv."},{"key":"611_CR30","doi-asserted-by":"crossref","unstructured":"Milo, T., Suciu, D.: Index structures for path expressions. In: ICDT (1999)","DOI":"10.1007\/3-540-49257-7_18"},{"key":"611_CR31","doi-asserted-by":"crossref","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376661"},{"key":"611_CR32","doi-asserted-by":"crossref","unstructured":"Neumann, T., Moerkotte, G.: Characteristic sets: Accurate cardinality estimation for RDF queries with multiple joins. In: ICDE (2011)","DOI":"10.1109\/ICDE.2011.5767868"},{"key":"611_CR33","doi-asserted-by":"crossref","unstructured":"Principe, R.A.A., Spahiu, B., Palmonari, M., Rula, A., Paoli, F.D., Maurino, A.: ABSTAT 1.0: Compute, manage and share semantic profiles of RDF knowledge graphs. In: ESWC (2018)","DOI":"10.1007\/978-3-319-98192-5_32"},{"key":"611_CR34","doi-asserted-by":"crossref","unstructured":"Rudolf, M., Paradies, M., Bornh\u00f6vd, C., Lehner, W.: SynopSys: large graph analytics in the SAP HANA database through summarization. In: GRADES (2013)","DOI":"10.1145\/2484425.2484441"},{"key":"611_CR35","doi-asserted-by":"crossref","unstructured":"Sch\u00e4tzle, A., Neu, A., Lausen, G., Przyjaciel-Zablocki, M.: Large-scale bisimulation of RDF graphs. In: SWIM Workshop (2013)","DOI":"10.1145\/2484712.2484713"},{"key":"611_CR36","doi-asserted-by":"crossref","unstructured":"Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: SIGMOD. ACM (2008)","DOI":"10.1145\/1376616.1376675"},{"issue":"9","key":"611_CR37","first-page":"2076","volume":"25","author":"T Tran","year":"2013","unstructured":"Tran, T., Ladwig, G., Rudolph, S.: Managing structured and semistructured RDF data using structure indexes. IEEE TKDE 25(9), 2076\u20132089 (2013)","journal-title":"IEEE TKDE"},{"key":"611_CR38","unstructured":"W3C: Resource description framework. http:\/\/www.w3.org\/RDF\/"},{"key":"611_CR39","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: Tree + delta>= graph. In: VLDB (2007)"},{"key":"611_CR40","doi-asserted-by":"publisher","first-page":"555","DOI":"10.3233\/SW-190346","volume":"10","author":"M Zneika","year":"2018","unstructured":"Zneika, M., Vodislav, D., Kotzinos, D.: Quality metrics for RDF graph summarization. Semant. Web 10, 555\u2013584 (2018)","journal-title":"Semant. Web"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00611-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-020-00611-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00611-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T00:23:19Z","timestamp":1619742199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-020-00611-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,30]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["611"],"URL":"https:\/\/doi.org\/10.1007\/s00778-020-00611-y","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,30]]},"assertion":[{"value":"17 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}