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:
主要作者: | Ho, Hoang Hung. |
---|---|
其他作者: | Sourav Saha Bhowmick |
格式: | Final Year Project |
語言: | English |
出版: |
2011
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/44869 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Pattern-based visual subgraph query formulation meets query processing
由: Nguyen, Hong Hien.
出版: (2012) -
PRAGUE: towards blending practical visual subgraph query formulation and query processing
由: Bhowmick, Sourav S., et al.
出版: (2013) -
Efficient algorithms for generalized subgraph query processing
由: Bhowmick, Sourav S., et al.
出版: (2013) -
Visual query formulation and query processing in graph database
由: Huynh, Ngoc Anh.
出版: (2013) -
Efficient techniques for subgraph mining and query processing
由: Lin, Wenqing
出版: (2015)