Answering pattern match queries in large graph databases via graph embedding

Authors:
Lei Zou;Lei Chen;M. Tamer Özsu;Dongyan Zhao
Affiliations:
Peking University, Beijing, China;Hong Kong University of Science and Technology, Hong Kong, People's Republic of China;University of Waterloo, Waterloo, Canada;Peking University, Beijing, China
Venue:
The VLDB Journal — The International Journal on Very Large Data Bases
Year:
2012

Citing 28
Cited 2

Efficient processing of spatial joins using R-trees

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Data mining: concepts and techniques

Data mining: concepts and techniques
Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Finding shortest paths in large network systems

Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Algorithmics and applications of tree and graph searching

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation

IEEE Transactions on Knowledge and Data Engineering
Selectivity Estimation for Joins Using Systematic Sampling

DEXA '97 Proceedings of the 8th International Workshop on Database and Expert Systems Applications
A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases

Geoinformatica
Reachability and Distance Queries via 2-Hop Labels

SIAM Journal on 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
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search

ACM Transactions on Database Systems (TODS)
Closure-Tree: An Index Structure for Graph Queries

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Dual Labeling: Answering Graph Reachability Queries in Constant Time

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
SAGA: a subgraph matching tool for biological graphs

Bioinformatics
BLINKS: ranked keyword searches on graphs

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Fast and practical indexing and querying of very large graphs

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Fg-index: towards verification-free query processing on graph databases

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Fast best-effort pattern matching in large attributed graphs

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph indexing: tree + delta

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient algorithms for exact ranked twig-pattern matching over graphs

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
On-line exact shortest distance query processing

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficiently indexing shortest paths by exploiting symmetry in graphs

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
An Efficient Algorithm for Answering Graph Reachability Queries

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Fast Graph Pattern Matching

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
TEDI: efficient shortest path query answering on graphs

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Efficient and simple generation of random simple connected graphs with prescribed degree sequence

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

G-SPARQL: a hybrid engine for querying large attributed graphs

Proceedings of the 21st ACM international conference on Information and knowledge management
Hybrid query execution engine for large attributed graphs

Information Systems

Quantified Score

Hi-index	0.02

Visualization

Abstract

The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern matching. Among these, a pattern match query is more flexible compared with a subgraph search and more informative compared with a shortest path or a reachability query. In this paper, we address distance-based pattern match queries over a large data graph G. Due to the huge search space, we adopt a filter-and-refine framework to answer a pattern match query over a large graph. We first find a set of candidate matches by a graph embedding technique and then evaluate these to find the exact matches. Extensive experiments confirm the superiority of our method.