Managing and Mining Graph Data part 23 is a comprehensive survey book in graph data analytics. It contains extensive surveys on important graph topics such as graph languages, indexing, clustering, data generation, pattern mining, classification, keyword search, pattern matching, and privacy. It also studies a number of domain-specific scenarios such as stream mining, web graphs, social networks, chemical and biological data. The chapters are written by leading researchers, and provide a broad perspective of the area. This is the first comprehensive survey book in the emerging topic of graph data processing. . | 202 MANAGING AND MINING GRAPH DATA minimum 2-h p cover to cover reachability cross Ga and Gd from the nodes appcaring in E j. It is important to note ihrtl between the two subgraphs Ga ami Gd are o-oinpln-tc n covered by the set. of 2-hop clusters using the tet of nodes Vw. Based on Vw Cheng et al. extract a iy induced subgraph of Ga denoted Gt which does not include any nodes in Vw and extract an induced subgraph of Gd denoted Ga which doec not include any nodes in Vw. Itoth Gt ami Ga aot treated as G in the next atops to bisect. 2-Hop Cover Maintenance A 2sftop cover is hard to computCc Sciconlrci et al. in 30 and Bramandia cl td. in 5 study the 2ohop covet maintenance problem to minimize the effort of i tiv latirg lhe 2-hop covet when updates occur and avoid computing a 2-tcoti covar from the beginningt There aire four operations insertion deletion of nodea edges. ftto 11. 11111 00 x10111 to deal withtnscrlions. Consider an insertion of a new edge between an exiriing node and a new node v to G. A oirnple volution is to insert S ancs v v desc v into rhe 2thop coven . inserting v to the Lin ttml LOMt of dt nodes in desc v ami ancs v iivsi c lyc The deteCon of nodex edges bet ntnes nonrtrivtali because a deletion of a node w mao affect the reachability u v it w G Lout u ami w G Lin v . Removing w oram Lout u ami Lin v may make u v to be wrongly answered as fatse r ccau . thecc may he other paths from u to v. The existí no work focus on deletion operationSi tn this article. we rnalnty discuss their approaches to handte the detersión of an existing node. The 101 idea can be applied to handling the doiclion ot an existing edge. Re-labeling a subgraph. When there tt a t leCtion oi an existing node SttCnenkel et al. in 3 compute a 2-hop cover L of a subgraph Grel of G in order to retted ott the affected connections in G due to ttt detcicon of an exridng node v. The existing 2fhop cover L lor die troph G helóse updating wtll be updated to tc .
