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)
Finding replicated Web collections
SIGMOD '00 Proceedings of the 2000 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
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
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
Incremental maintenance of XML structural indexes
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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
A framework for analysis of dynamic social networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
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
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
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
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
Graph homomorphism revisited for graph matching
Proceedings of the VLDB Endowment
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Neighborhood based fast graph search in large networks
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Incremental graph pattern matching
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
CP-index: on the efficient indexing of large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Capturing topology in graph pattern matching
Proceedings of the VLDB Endowment
Relational approach for shortest path discovery over large graphs
Proceedings of the VLDB Endowment
Large-scale continuous subgraph queries on streams
Proceedings of the first annual workshop on High performance computing meets databases
Distributed graph pattern matching
Proceedings of the 21st international conference on World Wide Web
Adding logical operators to tree pattern queries on graph-structured data
Proceedings of the VLDB Endowment
Efficient approximations of conjunctive queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Managing large dynamic graphs efficiently
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Query preserving graph compression
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
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
Access control in social networks: a reachability-based approach
Proceedings of the 2012 Joint EDBT/ICDT Workshops
The exact distance to destination in undirected world
The VLDB Journal — The International Journal on Very Large Data Bases
Querying graph databases with XPath
Proceedings of the 16th International Conference on Database Theory
NeMa: fast graph search with label similarity
Proceedings of the VLDB Endowment
A similarity measure for approximate querying over RDF data
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Semantic acyclicity on graph databases
Proceedings of the 32nd symposium on Principles of database systems
Trial for RDF: adapting graph query languages for RDF data
Proceedings of the 32nd symposium on Principles of database systems
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
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Strong simulation: Capturing topology in graph pattern matching
ACM Transactions on Database Systems (TODS)
Diversified top-k graph pattern matching
Proceedings of the VLDB Endowment
Querying Regular Graph Patterns
Journal of the ACM (JACM)
Hi-index | 0.00 |
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often too restrictive to characterize patterns in emerging applications. We propose a class of graph patterns, in which an edge denotes the connectivity in a data graph within a predefined number of hops. In addition, we define matching based on a notion of bounded simulation, an extension of graph simulation. We show that with this revision, graph pattern matching can be performed in cubic-time, by providing such an algorithm. We also develop algorithms for incrementally finding matches when data graphs are updated, with performance guarantees for dag patterns. We experimentally verify that these algorithms scale well, and that the revised notion of graph pattern matching allows us to identify communities commonly found in real-world networks.