Department of Computer Science
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 recent attempts at implementing this vision [8, 9] show significant improvement in system response time (srt) for subgraph queries. However, these efforts are designed specifically for graph databases containing a large collection of small or medium-sized graphs. In this paper, we propose a novel algorithm called quble (QUery Blender for Large nEtworks) to realize this visual subgraph querying paradigm on very large networks (e.g., protein interaction networks, social networks). First, it decomposes a large network into a set of graphlets and supergraphlets using a minimum cut-based graph partitioning technique. Next, it mines approximate frequent and small infrequent fragments (sifs) from them and identifies their occurrences in these graphlets and supergraphlets. Then, the indexing framework of  is enhanced so that the mined fragments can be exploited to index graphlets for efficient blending of visual subgraph query formulation and query processing. Extensive experiments on large networks demonstrate effectiveness of quble. © 2013 Springer-Verlag Berlin Heidelberg.
Action-aware indices, Action-aware query processing, Blending, Frequent fragments, Large networks, Query formulation, Small infrequent fragments, Visual graph querying
Source Publication Title
The final publication is available at Springer via http://dx.doi.org/10.1007/s00778-013-0322-1
Link to Publisher's Edition
Hung, H., Bhowmick, S., Truong, B., Choi, B., & Zhou, S. (2014). QUBLE: Towards blending interactive visual subgraph search queries on large networks. VLDB Journal, 23 (3), 401-426. https://doi.org/10.1007/s00778-013-0322-1