LESS losslessly stores provenance graphs by learning graph structures with XGBoost and compressing attributes into a minimum spanning tree of edit operations, reporting gains over LEONARD on disk, storage time, query speed, and memory.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
LESS: Efficient Log Storage System Based on Learned Model and Minimum Attribute Tree
LESS losslessly stores provenance graphs by learning graph structures with XGBoost and compressing attributes into a minimum spanning tree of edit operations, reporting gains over LEONARD on disk, storage time, query speed, and memory.