Graph pattern matching revised for social network analysis
Open accessThe DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Abstract
Graph pattern matching is fundamental to social network analysis. Traditional techniques are subgraph isomorphism and graph simulation. However, these notions often impose too strong a topological constraint on graphs to find meaningful matches. Worse still, graphs in the real world are typically large, with millions of nodes and billions of edges. It is often prohibitively expensive to compute matches in such graphs. With these comes the need for revising the notions of graph pattern matching and for developing techniques of querying large graphs, to effectively and efficiently identify social communities or groups.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Birds of a Feather: Homophily in Social Networks
McPherson, M., Smith-Lovin, L., & Cook, J. M. (2001) · Annual Review of Sociology · doi:10.1146/annurev.soc.27.1.415 · Cited by 18,567 · cited 2×
“Edges in a social graph are typically “typed”, denoting various relationships such as friendship, work, advice, support, exchange, co-membership [40].”
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476 · cited 1×
“It has also been shown [23] that partial evaluation can also be readily implemented in the MapReduce framework [17].”
Milner, R. (1989) · Cited by 6,877
Data integration: a theoretical perspective
Lenzerini, M. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543644 · Cited by 2,494 · cited 1×
“This highlights the need for studying graph pattern query rewriting using views, a nontrivial extension to prior work on path query rewriting [10] and relational query rewriting using views [31, 36].”
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277 · cited 1×
“• subgraph isomorphism [60]: M(Q, G) consists of all”
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
CONTE, D., FOGGIA, P., SANSONE, C., & VENTO, M. (2004) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001404003228 · Cited by 1,370 · cited 2×
“Graph pattern matching has been extensively studied for pattern recognition, knowledge discovery, biology, cheminformatics, dynamic network traffic and intelligence analysis, based on subgraph isomorphism (see [2, 16, 28, 57] for surveys).”
Managing and Mining Graph Data
(2010) · Advances in Database Systems · doi:10.1007/978-1-4419-6045-0 · Cited by 594 · cited 3×
“Graph pattern matching has been extensively studied for pattern recognition, knowledge discovery, biology, cheminformatics, dynamic network traffic and intelligence analysis, based on subgraph isomorphism (see [2, 16, 28, 57] for surveys).”
Boldi, P., Rosa, M., Santini, M., & Vigna, S. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963488 · Cited by 592 · cited 3×
“However, to answer those queries, the compact structures of [39] have to be (partially) decompressed [5], and query evaluation algorithms on original graphs cannot be directly applied to the compact structures.”
Computing simulations on finite and infinite graphs
Henzinger, M. R., Henzinger, T. A., & Kopke, P. W. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492576 · Cited by 536 · cited 3×
“It is known that if QEsimG, then there exists a unique maximum match So [32], i.”
Reachability and Distance Queries via 2-Hop Labels
Cohen, E., Halperin, E., Kaplan, H., & Zwick, U. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403098 · Cited by 518 · cited 1×
“In a variety of applications one wants to inspect the connectivity of a pair of nodes via a path of an arbitrary length [14, 33, 62] or with a bound on the number of hops (e.”
Querying Distributed RDF Data Sources with SPARQL
Quilitz, B., & Leser, U. (2008) · Springer eBooks · doi:10.1007/978-3-540-68234-9_39 · Cited by 497 · cited 1×
“, social networks [55], Web services networks [43] and RDF graphs [50].”
What's new on the web?: the evolution of the web from a search engine perspective
Ntoulas, A., Cho, J., & Olston, C. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988674 · Cited by 452 · cited 2×
“For example, only 5% to 10% of nodes are updated weekly [47].”
Finding Regular Simple Paths in Graph Databases
Mendelzon, A. O., & Wood, P. T. (1995) · SIAM Journal on Computing · doi:10.1137/s009753979122370x · Cited by 399 · cited 1×
“, [41]), and how one can extract top-k matches from the result returned in searches, when matching is defined in terms of, e.”
Algorithmics and applications of tree and graph searching
Shasha, D., Wang, J. T. L., & Giugno, R. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543620 · Cited by 387 · cited 1×
“Graph pattern matching has been extensively studied for pattern recognition, knowledge discovery, biology, cheminformatics, dynamic network traffic and intelligence analysis, based on subgraph isomorphism (see [2, 16, 28, 57] for surveys).”
On compressing social networks
Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., & Raghavan, P. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557049 · Cited by 349 · cited 2×
“, [5, 12, 25, 52, 54]) require to restore original graphs from compressed graphs even to answer simple queries, as observed in [5].”
An introduction to partial evaluation
Jones, N. D. (1996) · ACM Computing Surveys · doi:10.1145/243439.243447 · Cited by 320 · cited 2×
“It is natural to conduct distributed graph pattern matching by using partial evaluation (see [34] for a survey).”
Social matching: A framework and research agenda
Terveen, L., & McDonald, D. W. (2005) · ACM Transactions on Computer-Human Interaction · doi:10.1145/1096737.1096740 · Cited by 315 · cited 1×
“Example 5: Consider a real-life example taken from [59].”
Graph pattern matching: from intractable to polynomial time
Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., & Wu, Y. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920878 · Cited by 285
Self-citationOn the computational complexity of dynamic graph problems
Ramalingam, G., & Reps, T. (1996) · Theoretical Computer Science · doi:10.1016/0304-3975(95)00079-8 · Cited by 262
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Wang, H., He, H., Yang, J., Yu, P. S., & Yu, J. X. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.53 · Cited by 242 · cited 1×
“In a variety of applications one wants to inspect the connectivity of a pair of nodes via a path of an arbitrary length [14, 33, 62] or with a bound on the number of hops (e.”
Query preserving graph compression
Fan, W., Li, J., Wang, X., & Wu, Y. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213855 · Cited by 204 · cited 4×
“It is shown [24] that for matching with bounded simulation, the compression function R ( · ) given above reduces the size of G by 57% in average, for a variety of real-life social graphs.”
InfluentialSelf-citationDistance-join: pattern match query in a large graph database
Zou, L., Chen, L., & Özsu, M. T. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687727 · Cited by 200 · cited 1×
“(7) A revision of subgraph isomorphism was studied in [64], which allows edges in a pattern to be mapped to paths in a data graph with the same bound.”
Raghavan, S., & García-Molina, H. (2004) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2003.1260809 · Cited by 180 · cited 1×
“, [5, 12, 25, 52, 54]) require to restore original graphs from compressed graphs even to answer simple queries, as observed in [5].”
The boundaries of trust: own and others’ actions in the US and China
Buchan, N., & Croson, R. (2004) · Journal of Economic Behavior & Organization · doi:10.1016/j.jebo.2003.11.005 · Cited by 168 · cited 1×
“Indeed, as observed in [8], when social distance increases, the closeness of relationships decreases and the relationships may become irrelevant.”
Adding regular expressions to graph reachability and pattern queries
Fan, W., Li, J., Ma, S., Tang, N., & Wu, Y. (2011) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2011.5767858 · Cited by 147
Self-citationIncremental graph pattern matching
Fan, W., Li, J., Luo, J., Tan, Z., Wang, X., & Wu, Y. (2011) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1989323.1989420 · Cited by 145
Self-citationFinding replicated Web collections
Cho, J. J., Shivakumar, N., & García-Molina, H. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335429 · Cited by 142
Friends and foes: ideological social networking
Brzozowski, M. J., Hogg, T., & Szabo, G. (2008) · CHI Conference on Human Factors in Computing Systems · doi:10.1145/1357054.1357183 · Cited by 136 · cited 1×
“Example 4: Consider an Essembly network service [7], where users post and vote on controversial issues and topics.”
Graph homomorphism revisited for graph matching
Fan, W., Li, J., Ma, S., Wang, H., & Wu, Y. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920986 · Cited by 122 · cited 3×
“Unfortunately, this revision makes graph pattern matching intractable [21].”
Self-citationCapturing topology in graph pattern matching
Ma, S., Cao, Y., Fan, W., Huai, J., & Wo, T. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/2095686.2095690 · Cited by 117
Self-citationThe Link Database: fast access to graphs of the Web
Randall, K. H., Stata, R., Wickremesinghe, R. G., & Wiener, J. L. (2003) · Proceedings DCC 2002. Data Compression Conference · doi:10.1109/dcc.2002.999950 · Cited by 113 · cited 1×
“, [5, 12, 25, 52, 54]) require to restore original graphs from compressed graphs even to answer simple queries, as observed in [5].”
Neighbor query friendly compression of social networks
Maserrat, H., & Pei, J. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835873 · Cited by 103 · cited 2×
“However, to answer those queries, the compact structures of [39] have to be (partially) decompressed [5], and query evaluation algorithms on original graphs cannot be directly applied to the compact structures.”
Regular path queries on graphs with data
Libkin, L. O., & Vrgoč, D. (2012) · International Conference on Database Theory · doi:10.1145/2274576.2274585 · Cited by 98 · cited 1×
“There has been initial work in this direction, e.g., [4, 37].”
Divide and Conquer: Partitioning Online Social NetworksPreprint
Pujol, J. M., Erramilli, V., & Rodríguez, P. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0905.4918 · Cited by 68 · cited 1×
“Moreover, it is nontrivial to partition graphs such that distributed graph pattern matching can be conducted with minimum network traffic and response time, a possibly intractable problem [49].”
A Survey of Algorithms for Keyword Search on Graph Data
Wang, H., & Aggarwal, C. C. (2010) · The Kluwer international series on advances in database systems · doi:10.1007/978-1-4419-6045-0_8 · Cited by 61 · cited 1×
“To approach this, one may want to integrate graph pattern matching and keyword search [61, 63].”
Performance guarantees for distributed reachability queries
Fan, W., Wang, X., & Wu, Y. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2350229.2350248 · Cited by 54
Self-citationOptimization and evaluation of shortest path queries
Chan, E. P. F., & Lim, H. (2006) · The VLDB Journal · doi:10.1007/s00778-005-0177-1 · Cited by 50 · cited 1×
“In a variety of applications one wants to inspect the connectivity of a pair of nodes via a path of an arbitrary length [14, 33, 62] or with a bound on the number of hops ( e.g., 3, 1 in Q 0 ) [11, 14, 64].”
Adding regular expressions to graph reachability and pattern queries
Wenfei, Fan, Jianzhong, Li, Shuai, ., Ma, Tang, Yinghui, & Wu (2012) · Frontiers of Computer Science · Cited by 25
Cited by
Han, M., Kim, H., Gu, G., Park, K., & Han, W.-S. (2019) · Proceedings of the 2019 International Conference on Management of Data · doi:10.1145/3299869.3319880 · Cited by 203
“In practice, subgraph matching has a wide range of applications including RDF query processing [21], protein interaction analysis [31], chemical compound search [45], and social network analysis [12, 37].”
Background
Metadata
- Authors
- Fan, W.
- Venue
- Proceedings of the 15th International Conference on Database Theory
- Publisher
- ACM
- Published
- 2012-03-26
- Pages
- 8-21
- OpenAlex
- W2132285256
- Cited by
- 176
- References
- 39
- FWCI
- 8.21
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.