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
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Approximation algorithms
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
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
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
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)
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
ArnetMiner: extraction and mining of academic social networks
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
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
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
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 pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
StreamWorks: a system for dynamic graph search
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
The predictive value of young and old links in a social network
Proceedings of the ACM SIGMOD Workshop on Databases and Social Networks
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
Summarizing answer graphs induced by keyword queries
Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Graph pattern matching has become a routine process in emerging applications such as social networks. In practice a data graph is typically large, and is frequently updated with small changes. It is often prohibitively expensive to recompute matches from scratch via batch algorithms when the graph is updated. With this comes the need for incremental algorithms that compute changes to the matches in response to updates, to minimize unnecessary recomputation. This paper investigates incremental algorithms for graph pattern matching defined in terms of graph simulation, bounded simulation and subgraph isomorphism. (1) For simulation, we provide incremental algorithms for unit updates and certain graph patterns. These algorithms are optimal: in linear time in the size of the changes in the input and output, which characterizes the cost that is inherent to the problem itself. For general patterns we show that the incremental matching problem is unbounded, i.e., its cost is not determined by the size of the changes alone. (2) For bounded simulation, we show that the problem is unbounded even for unit updates and path patterns. (3) For subgraph isomorphism, we show that the problem is intractable and unbounded for unit updates and path patterns. (4) For multiple updates, we develop an incremental algorithm for each of simulation, bounded simulation and subgraph isomorphism. We experimentally verify that these incremental algorithms significantly outperform their batch counterparts in response to small changes, using real-life data and synthetic data.