skip to main content
10.1145/1989323.1989489acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
demonstration

GBLENDER: visual subgraph query formulation meets query processing

Published: 12 June 2011 Publication History

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.

References

[1]
L.P. CORDELLA, ET AL. An improved algorithm for matching large graphs. Proceedings of the 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition, 2001.
[2]
C. JIN, ET AL. GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases. In ACM SIGMOD, 2010.
[3]
C. JIN, ET AL. A Practical Framework for Blending Visual Subgraph Query Formulation and Query Processing. In Technical Report, Available at http://www.cais.ntu.edu.sg/ assourav/TechReports/GBlender-TR.pdf, 2010.
[4]
E. PIETRIGA. A Toolkit for Addressing HCI Issues in Visual Language Environments.In IEEE Symp. on Vis. Lang. and Human-Centric Comp., 2005.
[5]
H. SHANG, ET AL. Connected Substructure Similarity Search. In SIGMOD, 2010.
[6]
X. YAN, ET AL. gSpan: Graph-based Substructure Pattern Mining. In ICDM, 2002.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
June 2011
1364 pages
ISBN:9781450306614
DOI:10.1145/1989323

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 June 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. frequent subgraphs
  2. graph databases
  3. graph indexing
  4. infrequent subgraphs
  5. prefetching
  6. visual query formulation

Qualifiers

  • Demonstration

Conference

SIGMOD/PODS '11
Sponsor:

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 24 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media