Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching

Author(s):  
Hyunjoon Kim ◽  
Yunyoung Choi ◽  
Kunsoo Park ◽  
Xuemin Lin ◽  
Seok-Hee Hong ◽  
...  
2015 ◽  
Vol 8 (12) ◽  
pp. 1566-1577 ◽  
Author(s):  
Foteini Katsarou ◽  
Nikos Ntarmos ◽  
Peter Triantafillou

Author(s):  
Hongzhi Wang ◽  
Jianzhong Li ◽  
Hong Gao

When data are modeled as graphs, many research issues arise. In particular, there are many new challenges in query processing on graph data. This chapter studies the problem of structural queries on graph data. A hash-based structural join algorithm, HGJoin, is first proposed to handle reachability queries on graph data. Then, it is extended to the algorithms to process structural queries in form of bipartite graphs. Finally, based on these algorithms, a strategy to process subgraph queries in form of general DAGs is proposed. It is notable that all the algorithms above can be slightly modified to process structural queries in form of general graphs.


2009 ◽  
Vol 20 (9) ◽  
pp. 2436-2449 ◽  
Author(s):  
Hong-Zhi WANG ◽  
Ji-Zhou LUO ◽  
Jian-Zhong LI

2008 ◽  
Vol 1 (1) ◽  
pp. 478-489 ◽  
Author(s):  
Hongzhi Wang ◽  
Jianzhong Li ◽  
Jizhou Luo ◽  
Hong Gao

Author(s):  
Wenjing Ruan ◽  
Chaokun Wang ◽  
Lu Han ◽  
Zhuo Peng ◽  
Yiyuan Bai

Sign in / Sign up

Export Citation Format

Share Document