RDBMS as an Efficient Tool to Mine Cliques on Complex Networks

摘要: Complex networks are intrinsically present in a wide range of applications. Real world have several unique properties, such as, sparsity, node degree distribution, which follow power law and large amount triangles that further form larger cliques. Triangles cluster coefficient, usually used to find groups, not always enough distinguish different neighborhood topology. By using cliques sizes 4 5, it is possible study how become involved To retrieve these called k4 k5 novel technique ``FCR - Fast Clique Retrieval'' has been developed, taking advantage the data management optimization techniques relational database system SQL query 5. This paper demonstrates (3, 5) interesting laws allow identifying nodes with suspicious behaviors. It also presents an extension coefficient formula, may valuable equation identify most influence network first eigenvalue.