Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
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
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
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
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
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
Optimization and evaluation of shortest path queries
The VLDB Journal — The International Journal on Very Large Data Bases
Fast best-effort pattern matching in large attributed graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
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
An Efficient Algorithm for Answering Graph Reachability Queries
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
TALE: A Tool for Approximate Large Graph Matching
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
On-line preferential nearest neighbor browsing in large attributed graphs
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
On graph query optimization in large networks
Proceedings of the VLDB Endowment
Graph homomorphism revisited for graph matching
Proceedings of the VLDB Endowment
Neighborhood-privacy protected shortest distance computing in cloud
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A flexible graph pattern matching framework via indexing
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Subgraph search over massive disk resident graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
DELTA: indexing and querying multi-labeled graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Capturing topology in graph pattern matching
Proceedings of the VLDB Endowment
Adding logical operators to tree pattern queries on graph-structured data
Proceedings of the VLDB Endowment
Adaptive optimizations of recursive queries in teradata
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Graph pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
Efficient subgraph matching on billion node graphs
Proceedings of the VLDB Endowment
Regular path queries on large graphs
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Efficient algorithms for generalized subgraph query processing
Proceedings of the 21st ACM international conference on Information and knowledge management
STUN: Spatio-Temporal Uncertain (Social) Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
A similarity measure for approximate querying over RDF data
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Scalable motif detection and aggregation
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
Using substructure mining to identify misbehavior in network provenance graphs
First International Workshop on Graph Data Management Experiences and Systems
A distributed graph engine for web scale RDF data
Proceedings of the VLDB Endowment
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
Outsourcing shortest distance computing with privacy protection
The VLDB Journal — The International Journal on Very Large Data Bases
Strong simulation: Capturing topology in graph pattern matching
ACM Transactions on Database Systems (TODS)
Efficient simrank-based similarity join over large graphs
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest-path query, reachability verification, and pattern match. Among these, a pattern match query is more flexible compared to a subgraph search and more informative compared to a shortest-path or reachability query. In this paper, we address pattern match problems over a large data graph G. Specifically, given a pattern graph (i.e., query Q), we want to find all matches (in G) that have the similar connections as those in Q. In order to reduce the search space significantly, we first transform the vertices into points in a vector space via graph embedding techniques, coverting a pattern match query into a distance-based multi-way join problem over the converted vector space. We also propose several pruning strategies and a join order selection method to process join processing efficiently. Extensive experiments on both real and synthetic datasets show that our method outperforms existing ones by orders of magnitude.