Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

GC : a graph caching system for subgraph / supergraph queries

Tools
- Tools
+ Tools

Wang, Jing, Liu, Zichen, Ma, Shuai, Ntarmos, Nikos and Triantafillou, Peter (2018) GC : a graph caching system for subgraph / supergraph queries. In: 44th International conference on very large databases 2018, Rio de Janeiro, Brazil, 27-31 Aug 2018. Published in: Proceedings of the VLDB Endowment, 11 (12). pp. 2022-2025. ISSN 2150-8097. doi:https://doi.org/10.14778/3229863.3236250

[img]
Preview
PDF
WRAP-GC-graph-caching-system-subgraph-queries-Triantafillou-2018.pdf - Published Version - Requires a PDF viewer.
Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0.

Download (1191Kb) | Preview
Official URL: https://doi.org/10.14778/3229863.3236250

Request Changes to record.

Abstract

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 Item (Paper)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Computer science -- Mathematics, Isomorphisms (Mathematics)
Journal or Publication Title: Proceedings of the VLDB Endowment
Publisher: ACM
ISSN: 2150-8097
Official Date: 25 August 2018
Dates:
DateEvent
25 August 2018Accepted
Volume: 11
Number: 12
Page Range: pp. 2022-2025
DOI: https://doi.org/10.14778/3229863.3236250
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
U1636210[NSFC] National Natural Science Foundation of Chinahttp://dx.doi.org/10.13039/501100001809
61421003[NSFC] National Natural Science Foundation of Chinahttp://dx.doi.org/10.13039/501100001809
2014CB340300[MSTPRC] Ministry of Science and Technology of the People's Republic of Chinahttp://dx.doi.org/10.13039/501100002855
Conference Paper Type: Paper
Title of Event: 44th International conference on very large databases 2018
Type of Event: Conference
Location of Event: Rio de Janeiro, Brazil
Date(s) of Event: 27-31 Aug 2018
Related URLs:
  • Organisation
  • Publisher
  • Publisher

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us