A two-stage Leiden+LLP ordering saves 0.3-5.4 bits per edge on poorly ordered graphs across encoders, while new BG/CS/CG encoders improve over BVGraph high-compression by 2-9%.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Learned static functions combine per-key ML-predicted prefix codes with classic static function storage to compress static key-value mappings beyond zero-order entropy limits.
RISE is a Rust library for inverted indexes that reports up to 2x faster queries than prior libraries on standard datasets while reproducing earlier inverted-index techniques.
citing papers explorer
-
Community-Aware Vertex Ordering for Reference-Based Graph Compression: A Cross-Encoder Empirical Study
A two-stage Leiden+LLP ordering saves 0.3-5.4 bits per edge on poorly ordered graphs across encoders, while new BG/CS/CG encoders improve over BVGraph high-compression by 2-9%.
-
RISE: A Rust Library for Inverted Index Search Engines
RISE is a Rust library for inverted indexes that reports up to 2x faster queries than prior libraries on standard datasets while reproducing earlier inverted-index techniques.