Gleaner: A Semantically-Rich and Efficient Online Sampler for Microservice Diagnostics

• URL: http://arxiv.org/abs/2604.16810v1
• Date: Sat, 18 Apr 2026 03:43:17 GMT
• Title: Gleaner: A Semantically-Rich and Efficient Online Sampler for Microservice Diagnostics
• Abstract summary: State-of-the-art tail-based samplers analyze complete (or even log-enriched) traces by modeling them as graphs.<n>We propose Gleaner, an online tail-sampling framework that breaks this trade-off.<n>Gleaner represents each trace as a "bag-of-edges" augmented with log semantics.
• Score: 14.792065799390897
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Distributed tracing in microservices is critical for diagnostics but generates overwhelming data volumes, necessitating intelligent sampling. To maximize fidelity, state-of-the-art (SOTA) tail-based samplers analyze complete (or even log-enriched) traces by modeling them as graphs. However, this reliance on computationally expensive graph analysis creates a performance bottleneck that prohibits their use in online settings. To this end, we propose Gleaner, an online tail-sampling framework that breaks this trade-off. It is founded on the key insight that explicit graph structures are unnecessary for high-fidelity trace grouping. Instead, Gleaner represents each trace as a "bag-of-edges" augmented with log semantics, replacing slow graph algorithms with highly efficient set-based operations. It also employs an alarm-driven quota and a diversity-preserving strategy to prioritize anomalous and rare traces for downstream Root Cause Analysis (RCA). Experimentally, Gleaner processes traces at 0.74ms each, improving Trace Pattern Coverage by up to 128.7% and Shannon Entropy by up to 32.9% over baselines. At just a 1% sampling rate, Gleaner improves RCA accuracy by 42%-107% over the next-best sampler. Moreover, RCA on Gleaner's sampled data is more accurate than with the entire, unsampled dataset. This result reframes intelligent sampling from a data reduction technique to a powerful signal enhancement paradigm for automated operations.

Related papers

• Selecting Samples on Graphs: A Unified Dataset Pruning Framework for Lossless Training Acceleration [71.77541419885925]
  We present a unified graph-based DP framework.<n>By modeling the dataset as a weighted graph, DP can be cast as a Maximum Weight Clique Problem (MWCP)<n>Our method outperforms existing DP methods while substantially reducing training cost, reducing training time by over 40% without sacrificing accuracy on ImageNet-1k with ResNet-50.
  arXiv  Detail & Related papers  (2026-06-11T05:13:32Z)
• Unsupervised Skill Discovery for Agentic Data Analysis [55.42853694128929]
  DataCOPE is an unsupervised verifier-guided skill discovery framework for data-analytic agents.<n>It iteratively coordinates a Data-Analytic Agent for trajectory generation, an Unsupervised Verifier for signal extraction, and a Skill Manager for contrastive skill distillation.<n>We evaluate DataCOPE on report-style analysis from Deep Data Research and reasoning-style analysis from DABStep.
  arXiv  Detail & Related papers  (2026-06-04T17:20:47Z)
• Adaptive Graph Refinement and Label Propagation with LLMs for Cost-Effective Entity Resolution [16.32872612569802]
  Dirty entity resolution (ER) identifies records referring to the same real-world entity from a single, messy dataset.<n>We propose Alper, a unified framework that integrates matching and clustering steps into an iterative probabilistic label propagation process.<n>Our experiments over eight benchmark datasets demonstrate that Alper is consistently superior to state-of-the-art cascaded pipelines.
  arXiv  Detail & Related papers  (2026-05-25T13:11:33Z)
• Can Graph-Based Microservice Performance Detection Be Used for Microservice Intrusion Detection? [0.0]
  This paper asks whether graph-based microservice performance detection can also serve as a foundation for microservice intrusion detection.<n>We deploy a Docker Compose based synthetic e-commerce microservice benchmark, run 50 controlled trials across five attack types under normal workloads, and collect metrics, logs, and distributed traces.<n>We train a two-layer graph convolutional network for 6-way classification over 21,438 request graphs. The model 96.2% test accuracy with a macro F1 of 0.955 under a graph-level random split.
  arXiv  Detail & Related papers  (2026-05-22T23:30:38Z)
• UniSage: A Unified and Post-Analysis-Aware Sampling for Microservices [17.78777718374266]
  We introduce UniSage, the first unified framework to sample both traces and logs using a post-analysis-aware paradigm.<n>At a 2.5% sampling rate, it captures 56.5% of critical traces and 96.25% of relevant logs, while improving the accuracy (AC@1) of downstream root cause analysis by 42.45%.
  arXiv  Detail & Related papers  (2025-09-30T14:44:56Z)
• Trace Sampling 2.0: Code Knowledge Enhanced Span-level Sampling for Distributed Tracing [41.23073783376032]
  We introduce Sampling 2.0, which operates at the span level while maintaining trace structure consistency.<n>We show that it reduces trace size by 81.2% while maintaining 98.1% faulty span coverage.<n>We demonstrate its effectiveness in root cause analysis, achieving an average improvement of 8.3%.
  arXiv  Detail & Related papers  (2025-09-17T09:37:35Z)
• Hierarchical Graph Neural Network for Compressed Speech Steganalysis [1.0310729286080484]
  This paper presents the first application of a Graph Neural Network (GNN) for steganalysis of compressed voice over IP (VoIP) speech streams.<n>The method involves straightforward graph construction from VoIP streams and employs GraphSAGE to capture hierarchical steganalysis information.<n>It achieves detection accuracy exceeding 98 percent even for short 0.5 second samples, and 95.17 percent accuracy under challenging conditions with low embedding rates.
  arXiv  Detail & Related papers  (2025-07-29T08:46:54Z)
• Subsampling Graphs with GNN Performance Guarantees [34.32848091746629]
  We introduce new subsampling methods for graph datasets.<n>We prove that training a GNN on the subsampled data results in a bounded increase in loss compared to training on the full dataset.
  arXiv  Detail & Related papers  (2025-02-23T20:21:16Z)
• TraceMesh: Scalable and Streaming Sampling for Distributed Traces [51.08892669409318]
  TraceMesh is a scalable and streaming sampler for distributed traces. It accommodates previously unseen trace features in a unified and streamlined way. TraceMesh outperforms state-of-the-art methods by a significant margin in both sampling accuracy and efficiency.
  arXiv  Detail & Related papers  (2024-06-11T06:13:58Z)
• Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
  We present a code that successfully replicates results from six popular and recent graph recommendation models. We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations. By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
  arXiv  Detail & Related papers  (2023-08-01T09:31:44Z)
• Boosting Differentiable Causal Discovery via Adaptive Sample Reweighting [62.23057729112182]
  Differentiable score-based causal discovery methods learn a directed acyclic graph from observational data. We propose a model-agnostic framework to boost causal discovery performance by dynamically learning the adaptive weights for the Reweighted Score function, ReScore.
  arXiv  Detail & Related papers  (2023-03-06T14:49:59Z)
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution [112.3443939502313]
  We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain.
  arXiv  Detail & Related papers  (2023-02-08T08:17:43Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.