Dependence-Preserving Data Compaction for Scalable Forensic Analysis
summary
Introduces two graph reductions, full dependence preservation and source dependence preservation, that drop 4.6–19× fewer events while provably preserving backtracking and impact analysis; converts timestamped audit streams into a versioned dependence graph and applies redundant-edge/node and cycle-collapsing optimizations to cut versions to 1.26 per node on average. Implements compact on-disk encoding that is ~35× smaller (41× with source technique), uses ~5 bytes per original event in memory, and analyzes nearly 1 million events/sec per core.
AI-written summary · about
chapters (26)
- 0:00Intro
- 0:43Motivation
- 1:29Goals
- 2:16Contributions
- 3:12Background: Dependence Graphs
- 4:46Reduction Techniques
- 5:17Log-based reduction: Run-Merging
- 6:32Log-based reduction: Limitations
- 7:15Our Approach: Full Dependence (FD) Preservation
- 8:02Source Dependence (SD) Preservation
- 9:17Efficient Implementation
- 10:41Redundant Edge Optimization (RED)
- 11:19Redundant node optimization (RNO)
- 11:52Cycle-Collapsing Optimization (CCD)
- 12:08Optimized Versioned Graph
- 12:24Evaluation Dataset
- 13:16Data Size (Millions of events)
- 13:30Reduction Factor
- 14:01Average No. of Versions per node
- 14:38Total Size on Disk (GB)
- 15:13Dependence Graph Size (MB)
- 15:40(Preliminary) Results on DARPA 3 Engagement
- 16:58Do reductions interfere with forensic analysis?
- 17:47Example Graph Constructed after Analysis
- 18:38Related Work
- 19:23Summary
related talks
09mLogCrisp: Fast Aggregated Analysis on Large-scale Compressed Logs by Enabling...
19mScalable Language Agnostic Taint Tracking using Explicit Data Dependencies
17mShieldReduce: Fine-Grained Shielded Data Reduction
29mWide Event Analytics
32mLarge-Scale Graph Processing on Emerging Storage Devices
29mSliding Look-Back Window Assisted Data Chunk Rewriting for Improving Deduplication...
01h 24mStreaming, Sketching and Sufficient Statistics I
50mBig Data on Smallish Machines
