{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:32:36Z","timestamp":1691523156865},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,8]]},"abstract":"<jats:p>We demonstrate a graph caching system GC for expediting subgraph\/supergraph queries, which are computationally expensive due to the entailed NP-Complete subgraph isomorphism problem. Unlike existing caching systems for fast data access where each cache hit saves one disk I\/O, GC reduces the computational costs due to subgraph isomorphism testing. Moreover, GC harnesses both subgraph and supergraph cache hits, extending the traditional exact-match-only hit, thus resulting in significant speedups. Furthermore, GC features dashboards for both skilled developers and general end-users; the former could investigate and experiment with alternative components\/mechanisms while the latter could look into the principle of GC through a number of demonstration scenarios.<\/jats:p>","DOI":"10.14778\/3229863.3236250","type":"journal-article","created":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T12:12:28Z","timestamp":1536581548000},"page":"2022-2025","source":"Crossref","is-referenced-by-count":6,"title":["GC"],"prefix":"10.14778","volume":"11","author":[{"given":"Jing","family":"Wang","sequence":"first","affiliation":[{"name":"Beihang University"}]},{"given":"Zichen","family":"Liu","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences"}]},{"given":"Shuai","family":"Ma","sequence":"additional","affiliation":[{"name":"Beihang University"}]},{"given":"Nikos","family":"Ntarmos","sequence":"additional","affiliation":[{"name":"University of Glasgow"}]},{"given":"Peter","family":"Triantafillou","sequence":"additional","affiliation":[{"name":"University of Warwick"}]}],"member":"320","published-online":{"date-parts":[[2018,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1887854.1887873"},{"key":"e_1_2_1_2_1","volume-title":"Learning Neo4j","author":"Bruggen R. V.","year":"2013"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816650"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035942"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_7_1","volume-title":"March 10","author":"National Cancer Institute.","year":"2013"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723714"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_2_1_10_1","volume-title":"EDBT","author":"Wang J.","year":"2016"},{"key":"e_1_2_1_11_1","volume-title":"EDBT","author":"Wang J.","year":"2017"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3229863.3236250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:12:47Z","timestamp":1672222367000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3229863.3236250"}},"subtitle":["a graph caching system for subgraph\/supergraph queries"],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":11,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["10.14778\/3229863.3236250"],"URL":"https:\/\/doi.org\/10.14778\/3229863.3236250","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}