cSketch: a novel framework for capturing cliques from big graph

In analysis of ubiquitous networks, one critical work is to understand the internal structure of the networks. Many approaches are proposed to address the structure mining in the graph. Unfortunately, these approaches cannot cope with the big graph generated by large-scale streaming data. Aiming to mine the structure from the big graph, this paper presents an efficient mining framework, namely cSketch, which is used for capturing the cliques from big graph quickly. Two illustrative examples are conducted for demonstrating the feasibility and effectiveness of the proposed framework.