Abstract
In the real world, various applications can be modeled as large-scale label graphs, which labels can be represented the feature of nodes. Subgraph query is a problem of finding isomorphism subgraphs that satisfy the query conditions, which has attracted much attention in recent years. Therefore, a subgraph query method based on adjacent node features on large-scale label graphs with fewer label categories was proposed in this paper. The method consists of two phases, which are offline index creation and online query. Firstly, we introduce a data structure to describe the information of nodes by scalar features. Secondly, we propose a three-level star structure features index include adjacent nodes’ label category, the degree of star-centered and the number of each label, which is named adjacent node scalar features index (ANSF index). After that, according to the structure of query graph is star structure or not, we proposed two different processing strategies on the phase of online query. Experimental results show the efficiency and the effectiveness of the proposed method in index creation time, space usage and subgraph query.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
