Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
An introduction to distributed algorithms
An introduction to distributed algorithms
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Introduction to algorithms
Database System Implementation
Database System Implementation
Web Dynamics
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
IEEE Transactions on Software Engineering
Graphs-at-a-time: query language and access methods for graph databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
GADDI: distance index based subgraph matching in biological networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
NAGA: Searching and Ranking Knowledge
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
The RDF-3X engine for scalable management of RDF data
The VLDB Journal — The International Journal on Very Large Data Bases
Managing and Mining Graph Data
Managing and Mining Graph Data
Incremental Maintenance of 2-Hop Labeling of Large Graphs
IEEE Transactions on Knowledge and Data Engineering
Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data
Proceedings of the 19th international conference on World wide web
Pregel: a system for large-scale graph processing
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
On graph query optimization in large networks
Proceedings of the VLDB Endowment
SAPPER: subgraph indexing and approximate matching in large graphs
Proceedings of the VLDB Endowment
HyperGraphDB: a generalized graph database
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Probase: a probabilistic taxonomy for text understanding
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Managing and mining large graphs: systems and implementations
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficient subgraph similarity search on large probabilistic graph databases
Proceedings of the VLDB Endowment
Managing and mining large graphs: systems and implementations
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficient subgraph similarity search on large probabilistic graph databases
Proceedings of the VLDB Endowment
A distributed index for efficient parallel top-k keyword search on massive graphs
Proceedings of the twelfth international workshop on Web information and data management
NeMa: fast graph search with label similarity
Proceedings of the VLDB Endowment
StreamWorks: a system for dynamic graph search
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Trinity: a distributed graph engine on a memory cloud
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
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
Technical Section: PLATO: A visual analytics system for gameplay data
Computers and Graphics
Hi-index | 0.00 |
The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph matching, reachability, regular expression matching, etc. In many cases, graph indices are employed to speed up query processing. Typically, most indices require either super-linear indexing time or super-linear indexing space. Unfortunately, for very large graphs, super-linear approaches are almost always infeasible. In this paper, we study the problem of subgraph matching on billion-node graphs. We present a novel algorithm that supports efficient subgraph matching for graphs deployed on a distributed memory store. Instead of relying on super-linear indices, we use efficient graph exploration and massive parallel computing for query processing. Our experimental results demonstrate the feasibility of performing subgraph matching on web-scale graph data.