http://dx.doi.org/10.1109/ICDE.2012.49">
 

Document Type

Conference Paper

Department/Unit

Department of Computer Science

Title

PRAGUE: Towards blending practical visual subgraph query formulation and query processing

Language

English

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 [8]. Our first attempt at implementing this vision, called GBLENDER [8], 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. © 2012 IEEE.

Publication Date

2012

Source Publication Title

Proceedings: IEEE 28th International Conference on Data Engineering

Start Page

222

End Page

233

Conference Location

Arlington, Virginia

Publisher

IEEE

ISBN (print)

9781467300421

This document is currently not available here.

Share

COinS