GC: A Graph Caching System for Subgraph/Supergraph Queries

Wang, J., Liu, Z., Ma, S., Ntarmos, N. and Triantafillou, P. (2018) GC: A Graph Caching System for Subgraph/Supergraph Queries. In: 44th International Conference on Very Large Data Bases (VLDB 2018), Rio de Janeiro, Brazil, 27-31 Aug 2018, pp. 2022-2025. (doi: 10.14778/3229863.3236250)

[img] Text
164170.pdf - Published Version
Restricted to Repository staff only
Available under License Creative Commons Attribution Non-commercial No Derivatives.



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.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Triantafillou, Professor Peter and Ntarmos, Dr Nikos
Authors: Wang, J., Liu, Z., Ma, S., Ntarmos, N., and Triantafillou, P.
College/School:College of Science and Engineering > School of Computing Science
Copyright Holders:Copyright © 2018 VLDB Endowment
First Published:First published in Proceedings of the VLDB Endowment 11(12):2022-2025
Publisher Policy:Reproduced under a Creative Commons License
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record