Welcome to the InfoSci Platform
Labelling-Scheme-Based Subgraph Query Processing on Graph Data

Labelling-Scheme-Based Subgraph Query Processing on Graph Data

Hongzhi Wang, Jianzhong Li, Hong Gao
Copyright: © 2012 |Pages: 33
ISBN13: 9781613500538|ISBN10: 161350053X|EISBN13: 9781613500545
DOI: 10.4018/978-1-61350-053-8.ch007
Cite Chapter Cite Chapter

MLA

Wang, Hongzhi, et al. "Labelling-Scheme-Based Subgraph Query Processing on Graph Data." Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, IGI Global, 2012, pp. 142-174. https://doi.org/10.4018/978-1-61350-053-8.ch007

APA

Wang, H., Li, J., & Gao, H. (2012). Labelling-Scheme-Based Subgraph Query Processing on Graph Data. In S. Sakr & E. Pardede (Eds.), Graph Data Management: Techniques and Applications (pp. 142-174). IGI Global. https://doi.org/10.4018/978-1-61350-053-8.ch007

Chicago

Wang, Hongzhi, Jianzhong Li, and Hong Gao. "Labelling-Scheme-Based Subgraph Query Processing on Graph Data." In Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, 142-174. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-61350-053-8.ch007

Export Reference

Mendeley
Favorite

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.