Please use this identifier to cite or link to this item:
|Title:||PRAGUE: towards blending practical visual subgraph query formulation and query processing||Authors:||Bhowmick, Sourav S.
|Issue Date:||2012||Abstract:||In a previous paper, we laid out the vision of a novel graph query processing paradigm where instead of processing a visual query graph after its construction, it interleaves visual query formulation and processing by exploiting the latency offered by the GUI to filter irrelevant matches and prefetch partial query results . Our first attempt at implementing this vision, called GBLENDER , shows significant improvement in system response time (SRT) for sub graph containment queries. However, GBLENDER suffers from two key drawbacks, namely inability to handle visual sub graph similarity queries and inefficient support for visual query modification, limiting its usage in practical environment. In this paper, we propose a novel algorithm called PRAGUE (Practical visu Al Graph QUery Blender), that addresses these limitations by exploiting a novel data structure called spindle-shaped graphs (SPIG). A SPIG succinctly records various information related to the set of super graphs of a newly added edge in the visual query fragment. Specifically, PRAGUE realizes a unified visual framework to support SPIG-based processing of modification-efficient sub graph containment and similarity queries. Extensive experiments on real-world and synthetic datasets demonstrate effectiveness of PRAGUE.||URI:||https://hdl.handle.net/10356/99467
|DOI:||10.1109/ICDE.2012.49||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Conference Papers|
Updated on Jan 18, 2023
Web of ScienceTM
Updated on Jan 31, 2023
Page view(s) 20597
Updated on Feb 7, 2023
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.