Enabling efficient process mining on large data sets: realizing an in-database process mining operator

• Published in: Distributed and parallel databases : an international journal 2020-03, Vol.38 (1), p.227-253
• Main Authors: Dijkman, Remco, Gao, Juntao, Syamsiyah, Alifah, van Dongen, Boudewijn, Grefen, Paul, ter Hofstede, Arthur
• Format: Article
• Language: English
• Subjects: Computer Science; Data base management systems; Data processing; Data Structures; Database Management; Information Systems Applications (incl.Internet); Memory Structures; Operating Systems; Optimization; Relational algebra
• ISSN: 0926-8782; 1573-7578
• DOI: 10.1007/s10619-019-07270-1

Process mining can be used to analyze business processes based on logs of their execution. These execution logs are often obtained by querying a database and storing the results in a file. The mining itself is then done on the file, such that the data processing power of the database cannot be used after the log is extracted. Enabling process mining directly on a database therefore provides additional flexibility and efficiency. To help facilitate this, this paper formally defines a database operator that extracts the ‘directly follows’ relation—one of the relations that is at the heart of process mining—from an operational database. It defines the operator using the well-known relational algebra and formally proves equivalence properties of the operator that are useful for query optimization. Subsequently, it presents time-complexity properties of the operator. Finally, it presents an implementation of the operator as part of the H2 DBMS and demonstrates that this implementation extracts the ‘directly follows’ relation from a database with an arbitrary database structure within a fraction of a second; several orders of magnitude faster than is currently possible.