Blending visual subgraph similarity query formulation and query processing on large graphs
Recently, a novel graph query processing paradigm is proposed and realized in a system called GBLENDER++. It interleaves visual query graph formulation and processing by exploiting the latency offered by the GUI to remove false matches and prefetch partial results. The system can handle both exact a...
Saved in:
Main Author: | Ho, Hoang Hung. |
---|---|
Other Authors: | Sourav Saha Bhowmick |
Format: | Final Year Project |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/44869 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Pattern-based visual subgraph query formulation meets query processing
by: Nguyen, Hong Hien.
Published: (2012) -
PRAGUE: towards blending practical visual subgraph query formulation and query processing
by: Bhowmick, Sourav S., et al.
Published: (2013) -
Visual query formulation and query processing in graph database
by: Huynh, Ngoc Anh.
Published: (2013) -
Efficient algorithms for generalized subgraph query processing
by: Bhowmick, Sourav S., et al.
Published: (2013) -
Efficient techniques for subgraph mining and query processing
by: Lin, Wenqing
Published: (2015)