BR-index: an indexing structure for subgraph matching in very large dynamic graphs

  • Authors:

  • Jiong Yang;Wei Jin

  • Affiliations:

  • Department of Electrical Engineering and Computer Sciecne, Case Western Reserve University;Department of Electrical Engineering and Computer Sciecne, Case Western Reserve University

  • Venue:
  • SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Subgraph indexing, i.e., finding all occurrences of a query graph Q in a very large connected database graph G, becomes an important research problem with great practical implications. To the best of our knowledge, most of subgraph indexing methods focus on the static database graphs. However, in many real applications, database graphs change over time. In this paper, we propose an indexing structure, BR-index, for large dynamic graphs. The large database graph is partitioned into a set of overlapping index regions. Features (small subgraphs) are extracted fromthese regions and used to index them. The updates toGcan be localized to a small number of these regions. To further improve the efficiency in updates and query processing, several novel techniques and data structures are invented, which include feature lattice, maximal features, and overlapping regions. Experiments show that the BR-index outperforms alternatives in queries and updates.