A survey of community search over big graphs

Y Fang, X Huang, L Qin, Y Zhang, W Zhang, R Cheng… - The VLDB Journal, 2020 - Springer
With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …

Graph summarization methods and applications: A survey

Y Liu, T Safavi, A Dighe, D Koutra - ACM computing surveys (CSUR), 2018 - dl.acm.org
While advances in computing resources have made processing enormous amounts of data
possible, human ability to identify patterns in such data has not scaled accordingly. Efficient …

Poirot: Aligning attack behavior with kernel audit records for cyber threat hunting

SM Milajerdi, B Eshete, R Gjomemo… - Proceedings of the …, 2019 - dl.acm.org
Cyber threat intelligence (CTI) is being used to search for indicators of attacks that might
have compromised an enterprise network for a long time without being discovered. To have …

[PDF][PDF] Effective community search for large attributed graphs

Y Fang, CK Cheng, S Luo, J Hu - Proceedings of the VLDB Endowment, 2016 - hub.hku.hk
Given a graph G and a vertex q∈ G, the community search query returns a subgraph of G
that contains vertices related to q. Communities, which are prevalent in attributed graphs …

Web-application development using the model/view/controller design pattern

A Leff, JT Rayfield - Proceedings fifth ieee international …, 2001 - ieeexplore.ieee.org
The Model/View/Controller design pattern is very useful for architecting interactive software
systems. This design pattern is partition-independent, because it is expressed in terms of an …

Graph query processing using plurality of engines

S Elnikety, Y He, S Sakr - US Patent 9,053,210, 2015 - Google Patents
Zou, LL Chen, MT Özsu, D. Zhao, Answering pattern match queries in large graph
databases via graph embedding. The VLDB Journal, Feb. 2012, pp. 97-120, vol. 21, No. 1 …

Graph pattern matching: From intractable to polynomial time

W Fan, J Li, S Ma, N Tang, Y Wu… - Proceedings of the VLDB …, 2010 - research.ed.ac.uk
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 …

Incremental graph pattern matching

W Fan, X Wang, Y Wu - ACM Transactions on Database Systems (TODS …, 2013 - dl.acm.org
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 …

Neural-answering logical queries on knowledge graphs

L Liu, B Du, H Ji, CX Zhai, H Tong - … of the 27th ACM SIGKDD conference …, 2021 - dl.acm.org
Logical queries constitute an important subset of questions posed in knowledge graph
question answering systems. Yet, effectively answering logical queries on large knowledge …

When engagement meets similarity: efficient (k, r)-core computation on social networks

F Zhang, Y Zhang, L Qin, W Zhang, X Lin - arXiv preprint arXiv:1611.03254, 2016 - arxiv.org
In this paper, we investigate the problem of (k, r)-core which intends to find cohesive
subgraphs on social networks considering both user engagement and similarity …