GBLENDER: visual subgraph query formulation meets query processing

Authors:
Changjiu Jin;Sourav S. Bhowmick;Xiaokui Xiao;Byron Choi;Shuigeng Zhou
Affiliations:
Nanyang Technological University, Singapore, China;Nanyang Technological University, Singapore, China;Nanyang Technological University, Singapore, China;Hong Kong Baptist University, Hong Kong, China;Fudan University, Shanghai, China
Venue:
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Year:
2011

Citing 4
Cited 1

gSpan: Graph-Based Substructure Pattern Mining

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
A Toolkit for Addressing HCI Issues in Visual Language Environments

VLHCC '05 Proceedings of the 2005 IEEE Symposium on Visual Languages and Human-Centric Computing
GBLENDER: towards blending visual query formulation and query processing in graph databases

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Connected substructure similarity search

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data

QUBLE: blending visual subgraph query formulation with query processing on large networks

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data management tools to wider community. We present a novel HCI (human-computer interaction)-aware graph query processing paradigm, where instead of processing a query graph after its construction, it interleaves visual query construction and processing to improve system response time. We demonstrate a system called GBLENDER that exploits GUI latency to prune false results and prefetch candidate data graphs by employing a novel action-aware indexing scheme and a data structure called spindle-shaped graphs (SPIG). We demonstrate various innovative features of GBLENDER and its promising performance in evaluating subgraph containment and similarity queries.