tailieunhanh - Managing and Mining Graph Data part 16

Managing and Mining Graph Data part 16 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. . | 1332 MANAGING AND MINING GRAPH DATA declaration recursively contains G5 itself and a new G1 with connected to Vo where v0 is exported from the nested G5. The first rasulting graph con-siats of node v0 alona. the second consists of node v0 connected to G1 through edge ei the third consists of no de v0 connecXed to two instances of G1 through edge e1 ansi co on. graph Path graph Path nod e Vj edge ej Vi export as v2 graph Cycle graph Path edge l nocle V v2 edge e Vi v2 Figure . a Path and cycle b Repetition of motif G1 graph G5 graph G5 graph G export as v0 edgeegv G v I node v0 e e. a b X Graph Query Language This section ptesents tine GraphQd query language. We first describe the data model. Next we define graph patterns and graph pattern matching. We then present a graph algebra and its hulk operrtoes which is the core of the graph query language. l inaHy. we i I the syntax of the graph query language through an example. XI Data Model Grapht in the real svorld contain not orly graph structural information but atco attributes on nodes and edge. In GraphQL we use a tuple a Istt of name and valus ai s. to reptcrcni. thr attributes of each node edge or graph. A tuple may have an option al tag that dcsotes the fuple lygc. Tuples are annotated to tine gtra ii stnsxtures so fttaf the representations of attributes and structures are dearly separate. figure showt a sample graph that represents a paper the graph lias no edges . No de v1 hat two attributes tide and year . Nodes v2 aed v3 time r tag avriim and ate attribute name . graph G inproceedings node v-i title Title1 year 2006 node v2 author name A node v3 author name B Figure . A sample graph with attributes In die rclalional model tuples are the basic unit of information. Each alge-hraic opcraloi manipulates collections of tuplci. A relational query is always Query Language and Access Methods for Graph Databases 1333 equivalent to an algebraic expression