A faster closure algorithm for pattern matching in partial-order event data

When working with large sets of partial-order event data, typically collected by monitoring a distributed application, it is often desirable to search for specific patterns of events within this data. When performing such a search, we must be able to identify temporal relationships between complex s...

Full description

Saved in:
Bibliographic Details
Published in2007 International Conference on Parallel and Distributed Systems pp. 1 - 9
Main Authors Nichols, M., Taylor, D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2007
Subjects
Algorithm design and analysis
Application software
Computer networks
Computer science
Computerized monitoring
Debugging
Distributed computing
Interleaved codes
Pattern matching
Runtime
Online AccessGet full text
ISBN9781424418893
1424418895
ISSN1521-9097
DOI10.1109/ICPADS.2007.4447755

Cover

More Information
Summary:When working with large sets of partial-order event data, typically collected by monitoring a distributed application, it is often desirable to search for specific patterns of events within this data. When performing such a search, we must be able to identify temporal relationships between complex sets of events. Searching for hierarchically-specified event patterns requires that a convex-closure algorithm be applied to the partial matches at each stage in the computation and the performance of such a closure algorithm can strongly influence the overall speed of pattern matching. In this paper, we propose improvements to an existing closure algorithm that significantly improve its efficiency, and also briefly discuss other possible approaches for improving performance.
ISBN:9781424418893
1424418895
ISSN:1521-9097
DOI:10.1109/ICPADS.2007.4447755