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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/44869 |