A categorized bibliography on incremental computation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the computational complexity of dynamic graph problems
Theoretical Computer Science
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
Incremental evaluation of computational circuits
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Finding replicated Web collections
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Communications of the ACM
Topological sorting of large networks
Communications of the ACM
Approximation algorithms
Communication and Concurrency
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Structured Views and Their Incremental Maintenance
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Incremental Maintenance for Materialized Views over Semistructured Data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
Algorithms for estimating relative importance in networks
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
What's new on the web?: the evolution of the web from a search engine perspective
Proceedings of the 13th international conference on World Wide Web
Incremental maintenance of XML structural indexes
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Social matching: A framework and research agenda
ACM Transactions on Computer-Human Interaction (TOCHI)
Dual Labeling: Answering Graph Reachability Queries in Constant Time
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Structure and evolution of online social networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph evolution: Densification and shrinking diameters
ACM Transactions on Knowledge Discovery from Data (TKDD)
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
Information preserving XML schema embedding
ACM Transactions on Database Systems (TODS)
Fast computing reachability labelings for large graphs with high compression rate
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Graphs-at-a-time: query language and access methods for graph databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
ArnetMiner: extraction and mining of academic social networks
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
The Subgraph Similarity Problem
IEEE Transactions on Knowledge and Data Engineering
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
SoQL: A Language for Querying and Creating Data in Social Networks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Continuous Subgraph Pattern Search over Graph Streams
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Monitoring path nearest neighbor in road networks
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Evolution of an online social aggregation network: an empirical study
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
An incremental bisimulation algorithm
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Detecting Social Positions Using Simulation
ASONAM '10 Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
Graph homomorphism revisited for graph matching
Proceedings of the VLDB Endowment
Incremental graph pattern matching
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Adding regular expressions to graph reachability and pattern queries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Capturing topology in graph pattern matching
Proceedings of the VLDB Endowment
Composing activity groups in social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Strong simulation: Capturing topology in graph pattern matching
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Graph pattern matching is commonly used in a variety of emerging applications such as social network analysis. These applications highlight the need for studying the following two issues. First, graph pattern matching is traditionally defined in terms of subgraph isomorphism or graph simulation. These notions, however, often impose too strong a topological constraint on graphs to identify meaningful matches. Second, in practice a graph is typically large, and is frequently updated with small changes. It is often prohibitively expensive to recompute matches starting from scratch via batch algorithms when the graph is updated. This article studies these two issues. (1) We propose to define graph pattern matching based on a notion of bounded simulation, which extends graph simulation by specifying the connectivity of nodes in a graph within a predefined number of hops. We show that bounded simulation is able to find sensible matches that the traditional matching notions fail to catch. We also show that matching via bounded simulation is in cubic time, by giving such an algorithm. (2) We provide an account of results on incremental graph pattern matching, for matching defined with graph simulation, bounded simulation, and subgraph isomorphism. We show that the incremental matching problem is unbounded, that is, its cost is not determined alone by the size of the changes in the input and output, for all these matching notions. Nonetheless, when matching is defined in terms of simulation or bounded simulation, incremental matching is semibounded, that is, its worst-time complexity is bounded by a polynomial in the size of the changes in the input, output, and auxiliary information that is necessarily maintained to reuse previous computation, and the size of graph patterns. We also develop incremental matching algorithms for graph simulation and bounded simulation, by minimizing unnecessary recomputation. In contrast, matching based on subgraph isomorphism is neither bounded nor semibounded. (3) We experimentally verify the effectiveness and efficiency of these algorithms, and show that: (a) the revised notion of graph pattern matching allows us to identify communities commonly found in real-life networks, and (b) the incremental algorithms substantially outperform their batch counterparts in response to small changes. These suggest a promising framework for real-life graph pattern matching.