{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T07:16:40Z","timestamp":1784099800314,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T00:00:00Z","timestamp":1432684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"IKY fellowships of excellence for postgraduate studies in Greece-SIEMENS program","award":["SIEMENS program"],"award-info":[{"award-number":["SIEMENS program"]}]},{"name":"European Union Seventh Framework Programme (FP7\/ 2007-2013)","award":["619706"],"award-info":[{"award-number":["619706"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,27]]},"DOI":"10.1145\/2723372.2723714","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"1777-1792","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Graph-Aware, Workload-Adaptive SPARQL Query Caching"],"prefix":"10.1145","author":[{"given":"Nikolaos","family":"Papailiou","sequence":"first","affiliation":[{"name":"National Technical University of Athens, Athens, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitrios","family":"Tsoumakos","sequence":"additional","affiliation":[{"name":"Ionian University, Corfu, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[{"name":"Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russian Fed."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nectarios","family":"Koziris","sequence":"additional","affiliation":[{"name":"National Technical University of Athens, Athens, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Bliss. http:\/\/www.tcs.tkk.\/Software\/bliss\/index.html.  Bliss. http:\/\/www.tcs.tkk.\/Software\/bliss\/index.html."},{"key":"e_1_3_2_1_2_1","unstructured":"data.gov.uk. http:\/\/data.gov.uk\/.  data.gov.uk. http:\/\/data.gov.uk\/."},{"key":"e_1_3_2_1_3_1","unstructured":"LUBM queries. http:\/\/swat.cse.lehigh.edu\/projects\/lubm.  LUBM queries. http:\/\/swat.cse.lehigh.edu\/projects\/lubm."},{"key":"e_1_3_2_1_4_1","unstructured":"Nauty and Traces. http:\/\/pallini.di.uniroma1.it\/.  Nauty and Traces. http:\/\/pallini.di.uniroma1.it\/."},{"key":"e_1_3_2_1_5_1","unstructured":"RDFS. http:\/\/www.w3.org\/TR\/rdf-schema\/.  RDFS. http:\/\/www.w3.org\/TR\/rdf-schema\/."},{"key":"e_1_3_2_1_6_1","unstructured":"Resource Description Framework (RDF). http:\/\/www.w3.org\/RDF\/.  Resource Description Framework (RDF). http:\/\/www.w3.org\/RDF\/."},{"key":"e_1_3_2_1_7_1","unstructured":"Saucy. http:\/\/vlsicad.eecs.umich.edu\/BK\/SAUCY\/.  Saucy. http:\/\/vlsicad.eecs.umich.edu\/BK\/SAUCY\/."},{"key":"e_1_3_2_1_8_1","unstructured":"SPARQL. http:\/\/www.w3.org\/TR\/rdf-sparql-query\/.  SPARQL. http:\/\/www.w3.org\/TR\/rdf-sparql-query\/."},{"key":"e_1_3_2_1_9_1","unstructured":"Sports Refresh: Dynamic Semantic Publishing. http:\/\/www.bbc.co.uk\/blogs\/bbcinternet\/2012\/04\/sports dynamic semantic.html.  Sports Refresh: Dynamic Semantic Publishing. http:\/\/www.bbc.co.uk\/blogs\/bbcinternet\/2012\/04\/sports dynamic semantic.html."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646514.695831"},{"key":"e_1_3_2_1_11_1","volume-title":"ISWC","author":"Atre M.","year":"2008","unstructured":"M. Atre , J. Srinivasan , and J. Hendler . BitMat: A Main-memory Bit Matrix of RDF Triples for Conjunctive Triple Pattern Queries . In ISWC , 2008 . M. Atre, J. Srinivasan, and J. Hendler. BitMat: A Main-memory Bit Matrix of RDF Triples for Conjunctive Triple Pattern Queries. In ISWC, 2008."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/951953.952382"},{"key":"e_1_3_2_1_13_1","volume-title":"Query optimization in the IBM DB2 family","author":"Gassner P.","year":"1993","unstructured":"P. Gassner , G. M. Lohman , K. B. Schiefer , and Y. Wang . Query optimization in the IBM DB2 family . IEEE Data Eng. Bull ., 16(4), 1993 . P. Gassner, G. M. Lohman, K. B. Schiefer, and Y. Wang. Query optimization in the IBM DB2 family. IEEE Data Eng. Bull., 16(4), 1993."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.06.005"},{"key":"e_1_3_2_1_15_1","volume-title":"Mckay's canonical graph labeling algorithm. Communicating mathematics, 479","author":"Hartke S. G.","year":"2009","unstructured":"S. G. Hartke and A. Radcliffe . Mckay's canonical graph labeling algorithm. Communicating mathematics, 479 , 2009 . S. G. Hartke and A. Radcliffe. Mckay's canonical graph labeling algorithm. Communicating mathematics, 479, 2009."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963296"},{"key":"e_1_3_2_1_17_1","volume-title":"Scalable SPARQL Querying of Large RDF Graphs. PVLDB, 4(11)","author":"Huang J.","year":"2011","unstructured":"J. Huang , D. J. Abadi , and K. Ren . Scalable SPARQL Querying of Large RDF Graphs. PVLDB, 4(11) , 2011 . J. Huang, D. J. Abadi, and K. Ren. Scalable SPARQL Querying of Large RDF Graphs. PVLDB, 4(11), 2011."},{"key":"e_1_3_2_1_18_1","volume-title":"CIDR","author":"Idreos S.","year":"2011","unstructured":"S. Idreos , I. Alagiannis , R. Johnson , and A. Ailamaki . Here are my Data Files. Here are my Queries. Where are my Results ? In CIDR , 2011 . S. Idreos, I. Alagiannis, R. Johnson, and A. Ailamaki. Here are my Data Files. Here are my Queries. Where are my Results? In CIDR, 2011."},{"key":"e_1_3_2_1_19_1","volume-title":"The graph isomorphism problem: its structural complexity","author":"K\u00f6bler J.","year":"1994","unstructured":"J. K\u00f6bler , U. Sch\u00f6ning , and J. Tor\u00e1n . The graph isomorphism problem: its structural complexity . 1994 . J. K\u00f6bler, U. Sch\u00f6ning, and J. Tor\u00e1n. The graph isomorphism problem: its structural complexity. 1994."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304215"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.37"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41242-4_5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13489-0_21"},{"key":"e_1_3_2_1_24_1","volume-title":"Practical Graph Isomorphism. Department of Computer Science","author":"McKay B. D.","year":"1981","unstructured":"B. D. McKay . Practical Graph Isomorphism. Department of Computer Science , Vanderbilt University , 1981 . B. D. McKay. Practical Graph Isomorphism. Department of Computer Science, Vanderbilt University, 1981."},{"key":"e_1_3_2_1_25_1","unstructured":"B. D. McKay and A. Piperno. Nauty and Traces User's Guide.  B. D. McKay and A. Piperno. Nauty and Traces User's Guide."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375703"},{"key":"e_1_3_2_1_27_1","volume-title":"VLDB","author":"Moerkotte G.","year":"2006","unstructured":"G. Moerkotte and T. Neumann . Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products . In VLDB , 2006 . G. Moerkotte and T. Neumann. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products. In VLDB, 2006."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376672"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0165-y"},{"key":"e_1_3_2_1_30_1","volume-title":"H2RDF+: High-performance Distributed Joins over Large-scale RDF Graphs","author":"Papailiou N.","year":"2013","unstructured":"N. Papailiou , I. Konstantinou , D. Tsoumakos , P. Karras , and N. Koziris . H2RDF+: High-performance Distributed Joins over Large-scale RDF Graphs . In IEEE Big Data , 2013 . N. Papailiou, I. Konstantinou, D. Tsoumakos, P. Karras, and N. Koziris. H2RDF+: High-performance Distributed Joins over Large-scale RDF Graphs. In IEEE Big Data, 2013."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187980.2188058"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2594535"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335419"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988758"},{"key":"e_1_3_2_1_35_1","volume-title":"SemData","author":"Tran T.","year":"2010","unstructured":"T. Tran and G. Ladwig . Structure index for rdf data . In SemData , 2010 . T. Tran and G. Ladwig. Structure index for rdf data. In SemData, 2010."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247635"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453965"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963273"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535570.2488333"},{"key":"e_1_3_2_1_41_1","volume-title":"VLDB","author":"Zhao P.","year":"2007","unstructured":"P. Zhao , J. X. Yu , and P. S. Yu . Graph indexing: tree+ delta<= graph . In VLDB , 2007 . P. Zhao, J. X. Yu, and P. S. Yu. Graph indexing: tree+ delta<= graph. In VLDB, 2007."}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","location":"Melbourne Victoria Australia","acronym":"SIGMOD\/PODS'15","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2723714","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2723372.2723714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:57Z","timestamp":1750273437000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2723714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,27]]},"references-count":41,"alternative-id":["10.1145\/2723372.2723714","10.1145\/2723372"],"URL":"https:\/\/doi.org\/10.1145\/2723372.2723714","relation":{},"subject":[],"published":{"date-parts":[[2015,5,27]]},"assertion":[{"value":"2015-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}