Mining dependency in distributed systems through unstructured logs analysis
The DOI matches its Crossref record.
Abstract
Dependencies among system components are crucial to locating root errors in a distributed system. In this paper, we propose an approach to mine intercomponent dependencies from unstructured logs. The technique requires neither additional system instrumentation nor any application specific knowledge. In the approach, we first parse each log message into its log key and parameters. Then, we find dependent log key pairs belong to different components by leveraging co-occurrence analysis and parameter correspondence. After that, we use Bayesian decision theory to estimate the dependency direction of each dependent log key pair. We further apply time delay consistency to remove false positive detections. Case studies on Hadoop show that the technique successfully identifies the dependencies among the distributed system components.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Leveraging existing instrumentation to automatically infer invariant-constrained models
Beschastnikh, I., Brun, Y., Schneider, S., Sloan, M., & Ernst, M. D. (2011) · Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering · doi:10.1145/2025113.2025151 · Cited by 216
“Other prior work on mining systems logs focused on detecting dependencies [31], anomalies [22, 32, 46, 49], and performance debugging [40, 41].”
BackgroundAnomaly Detection Using Program Control Flow Graph Mining From Execution Logs
Nandi, A., Mandal, A., Atreja, S., Dasgupta, G. B., & Bhattacharya, S. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939712 · Cited by 154
Towards intelligent incident management: why we need it and how we make it
Chen, Z., Kang, Y., Li, L., Zhang, X., Zhang, H., Xu, H., Zhou, Y., Yang, L., Sun, J., Xu, Z., et al. (2020) · Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering · doi:10.1145/3368089.3417055 · Cited by 99
An Approach for Anomaly Diagnosis Based on Hybrid Graph Model with Logs for Distributed Services
Jia, T., Chen, P., Yang, L., Li, Y., Meng, F., & Xu, J. (2017) · 2017 IEEE International Conference on Web Services (ICWS) · doi:10.1109/icws.2017.12 · Cited by 78
Mining causality of network events in log data
Kobayashi, S., Otomo, K., Fukuda, K., & Esaki, H. (2018) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2017.2778096 · Cited by 63
Metadata
- Authors
- Lou, J.-G., Fu, Q., Wang, Y., & Li, J.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 2010-03-12
- Volume
- 44
- Issue
- 1
- Pages
- 91-96
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2032467893
- Cited by
- 98
- References
- 0
- FWCI
- 8.90
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Mining dependency in distributed systems through unstructured logs analysis. https://app.cochat.ai/papers/10.1145/1740390.1740411
- The paper
- Lou, J.-G., Fu, Q., Wang, Y., & Li, J. (2010). Mining dependency in distributed systems through unstructured logs analysis. ACM SIGOPS Operating Systems Review. https://doi.org/10.1145/1740390.1740411
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.