PRAGUE: towards blending practical visual subgraph query formulation and query processing
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 prefetc...
Saved in:
Main Authors: | Bhowmick, Sourav S., Jin, Changjiu, Choi, Byron, Zhou, Shuigeng |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Online Access: | https://hdl.handle.net/10356/99467 http://hdl.handle.net/10220/12884 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Blending visual subgraph similarity query formulation and query processing on large graphs
by: Ho, Hoang Hung.
Published: (2011) -
Pattern-based visual subgraph query formulation meets query processing
by: Nguyen, Hong Hien.
Published: (2012) -
Efficient algorithms for generalized subgraph query processing
by: Bhowmick, Sourav S., et al.
Published: (2013) -
FERRARI: an efficient framework for visual exploratory subgraph search in graph databases
by: Wang, Chaohui, et al.
Published: (2022) -
PICASSO : exploratory search of connected subgraph substructures in graph databases
by: Bhowmick, Sourav Saha, et al.
Published: (2019)