Efficient algorithms for generalized subgraph query processing

Authors:
Wenqing Lin;Xiaokui Xiao;James Cheng;Sourav S. Bhowmick
Affiliations:
Nanyang Technological University, Singapore, Singapore;Nanyang Technological University, Singapore, Singapore;Nanyang Technological University, Singapore, Singapore;Nanyang Technological University, Singapore, Singapore
Venue:
Proceedings of the 21st ACM international conference on Information and knowledge management
Year:
2012

Citing 20
Cited 0

An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
Algorithmics and applications of tree and graph searching

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Graph indexing: a frequent structure-based approach

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Substructure similarity search in graph databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Closure-Tree: An Index Structure for Graph Queries

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Fg-index: towards verification-free query processing on graph databases

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Towards graph containment search and indexing

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism

Proceedings of the VLDB Endowment
A novel approach for efficient supergraph query processing on graph databases

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Comparing stars: on approximating graph edit distance

Proceedings of the VLDB Endowment
Distance-join: pattern match query in a large graph database

Proceedings of the VLDB Endowment
Managing and Mining Graph Data

Managing and Mining Graph Data
Connected substructure similarity search

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
iGraph: a framework for comparisons of disk-based graph indexing techniques

Proceedings of the VLDB Endowment
Graph homomorphism revisited for graph matching

Proceedings of the VLDB Endowment
Adding regular expressions to graph reachability and pattern queries

ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
A flexible graph pattern matching framework via indexing

SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Fast graph query processing with a low-cost index

The VLDB Journal — The International Journal on Very Large Data Bases
Efficient Graph Similarity Joins with Edit Distance Constraints

ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a new type of graph queries, which injectively maps its edges to paths of the graphs in a given database, where the length of each path is constrained by a given threshold specified by the weight of the corresponding matching edge. We give important applications of the new graph query and identify new challenges of processing such a query. Then, we devise the cost model of the branch-and-bound algorithm framework for processing the graph query, and propose an efficient algorithm to minimize the cost overhead. We also develop three indexing techniques to efficiently answer the queries online. Finally, we verify the efficiency of our proposed indexes with extensive experiments on large real and synthetic datasets.