GBLENDER: Visual subgraph query formulation meets query processing

Changjiu Jin*, Sourav S. Bhowmick, Xiaokui Xiao, Koon Kau CHOI, Shuigeng Zhou

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

10 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationProceedings of SIGMOD 2011 and PODS 2011
Number of pages3
Publication statusPublished - 2011
Event2011 ACM SIGMOD and 30th PODS 2011 Conference - Athens, Greece
Duration: 12 Jun 201116 Jun 2011

Publication series

NameProceedings of the ACM SIGMOD International Conference on Management of Data
ISSN (Print)0730-8078


Conference2011 ACM SIGMOD and 30th PODS 2011 Conference

Scopus Subject Areas

  • Software
  • Information Systems

User-Defined Keywords

  • frequent subgraphs
  • graph databases
  • graph indexing
  • infrequent subgraphs
  • prefetching
  • visual query formulation


Dive into the research topics of 'GBLENDER: Visual subgraph query formulation meets query processing'. Together they form a unique fingerprint.

Cite this