PRAGUE: A Practical Framework for Blending Visual Subgraph Query Formulation and Query Processing

@inproceedings{Jin2013PRAGUEAP,
  title={PRAGUE: A Practical Framework for Blending Visual Subgraph Query Formulation and Query Processing},
  author={Changjiu Jin and Sourav S. Bhowmick and Byron Choi and Shuigeng Zhou},
  year={2013}
}
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 [10]. Our first attempt at implementing this vision, called GBLENDER [10], shows significant improvement in system response time (SRT) for subgraph containment queries… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

An Indexing Framework for Efficient Visual Exploratory Subgraph Search in Graph Databases

Chaohui Wang, Miao Xie, +3 authors Shuigeng Zhou
  • 2019 IEEE 35th International Conference on Data Engineering (ICDE)
  • 2019
VIEW 15 EXCERPTS
CITES BACKGROUND & METHODS

FERRARI : An Efficient Framework for Visual Exploratory Subgraph Search in Graph Databases

Chaohui Wang, Miao Xie, +3 authors Shuigeng Zhou
  • 2019
VIEW 10 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS

ViSual: An HCI-inspired simulator for blending visual subgraph query construction and processing

  • 2015 IEEE 31st International Conference on Data Engineering
  • 2015
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS

PRAGUE: Towards Blending Practical Visual Subgraph Query Formulation and Query Processing

  • 2012 IEEE 28th International Conference on Data Engineering
  • 2012
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 28 REFERENCES

Substructure Similarity Search in Graph Databases

  • SIGMOD Conference
  • 2005
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

Sigma: a Set-Cover-Based Inexact Graph Matching Algorithm

  • J. Bioinformatics and Computational Biology
  • 2010
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

A toolkit for addressing HCI issues in visual language environments

  • 2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05)
  • 2005
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Efficient mining of frequent subgraphs in the presence of isomorphism

  • Third IEEE International Conference on Data Mining
  • 2003
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

A graph distance metric based on the maximal common subgraph

  • Pattern Recognition Letters
  • 1998
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Similarity search on supergraph containment

  • 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)
  • 2010