Graph mining for discovering infrastructure patterns in configuration management databases

Pranay Anchuri, Mohammed J. Zaki, Omer Barkol, Ruth Bergman, Yifat Felder, Shahar Golan, Arik Sityon

Research output: Contribution to journalArticle

9 Citations (Scopus)


A configuration management database (CMDB) can be considered to be a large graph representing the IT infrastructure entities and their interrelationships. Mining such graphs is challenging because they are large, complex, and multi-attributed and have many repeated labels. These characteristics pose challenges for graph mining algorithms, due to the increased cost of subgraph isomorphism (for support counting) and graph isomorphism (for eliminating duplicate patterns). The notion of pattern frequency or support is also more challenging in a single graph, since it has to be defined in terms of the number of its (potentially, exponentially many) embeddings. We present CMDB-Miner, a novel two-step method for mining infrastructure patterns from CMDB graphs. It first samples the set of maximal frequent patterns and then clusters them to extract the representative infrastructure patterns. We demonstrate the effectiveness of CMDB-Miner on real-world CMDB graphs, as well as synthetic graphs.

Original languageEnglish
Pages (from-to)491-522
Number of pages32
JournalKnowledge and Information Systems
Issue number3
Publication statusPublished - 9 Aug 2012



  • Configuration management databases
  • Frequent subgraphs
  • Single graph mining
  • Sparse graph mining

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Human-Computer Interaction
  • Hardware and Architecture
  • Artificial Intelligence

Cite this

Anchuri, P., Zaki, M. J., Barkol, O., Bergman, R., Felder, Y., Golan, S., & Sityon, A. (2012). Graph mining for discovering infrastructure patterns in configuration management databases. Knowledge and Information Systems, 33(3), 491-522.