Next Article in Journal
Cloud Based Virtual Reality Exposure Therapy Service for Public Speaking Anxiety
Previous Article in Journal
A Mobile Solution for Augmenting a Manufacturing Environment with User-Generated Annotations
Article Menu

Export Article

Open AccessArticle
Information 2019, 10(2), 61; https://doi.org/10.3390/info10020061

Dynamic Top-K Interesting Subgraph Query on Large-Scale Labeled Graphs

School of Information, Liaoning University, Shenyang, 110036, China
*
Author to whom correspondence should be addressed.
Received: 21 November 2018 / Revised: 24 January 2019 / Accepted: 7 February 2019 / Published: 14 February 2019
Full-Text   |   PDF [3377 KB, uploaded 16 February 2019]   |  

Abstract

A labeled graph is a special structure with node identification capability, which is often used in information networks, biological networks, and other fields. The subgraph query is widely used as an important means of graph data analysis. As the size of the labeled graph increases and changes dynamically, users tend to focus on the high-match results that are of interest to them, and they want to take advantage of the relationship and number of results to get the results of the query quickly. For this reason, we consider the individual needs of users and propose a dynamic Top-K interesting subgraph query. This method establishes a novel graph topology feature index (GTSF index) including a node topology feature index (NTF index) and an edge feature index (EF index), which can effectively prune and filter the invalid nodes and edges that do not meet the restricted condition. The multi-factor candidate set filtering strategy is proposed based on the GTSF index, which can be further pruned to obtain fewer candidate sets. Then, we propose a dynamic Top-K interesting subgraph query method based on the idea of the sliding window to realize the dynamic modification of the matching results of the subgraph in the dynamic evolution of the label graph, to ensure real-time and accurate results of the query. In addition, considering the factors, such as frequent Input/Output (I/O) and network communication overheads, the optimization mechanism of the graph changes and an incremental maintenance strategy for the index are proposed to reduce the huge cost of redundant operation and global updates. The experimental results show that the proposed method can effectively deal with a dynamic Top-K interesting subgraph query on a large-scale labeled graph, at the same time the optimization mechanism of graph changes and the incremental maintenance strategy of the index can effectively reduce the maintenance overheads. View Full-Text
Keywords: labeled graph; dynamic Top-K query; interesting subgraph; sliding window labeled graph; dynamic Top-K query; interesting subgraph; sliding window
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Shan, X.; Jia, C.; Ding, L.; Ding, X.; Song, B. Dynamic Top-K Interesting Subgraph Query on Large-Scale Labeled Graphs. Information 2019, 10, 61.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Information EISSN 2078-2489 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top