Metric trees for efficient similarity search in large process model repositories

47Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Due to the increasing adoption of business process management and the key role of process models, companies are setting up and maintaining large process model repositories. Repositories containing hundreds or thousands of process models are not uncommon, whereas only simplistic search functionality, such as text based search or folder navigation, is provided, today. On the other hand, advanced methods have recently been proposed in the literature to ascertain the similarity of process models. However, due to performance reasons, an exhaustive similarity search by pairwise comparison is not feasible in large process model repositories. This paper presents an indexing approach based on metric trees, a hierarchical search structure that saves comparison operations during search with nothing but a distance function at hand. A detailed investigation of this approach is provided along with a quantitative evaluation thereof, showing its suitability and scalability in large process model repositories. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Kunze, M., & Weske, M. (2011). Metric trees for efficient similarity search in large process model repositories. In Lecture Notes in Business Information Processing (Vol. 66 LNBIP, pp. 535–546). Springer Verlag. https://doi.org/10.1007/978-3-642-20511-8_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free