pith. sign in

Title resolution pending

Burton H · 1970 · DOI 10.1145/362686

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DB 1 cs.DS 1

years

2025 2

verdicts

ACCEPT 1 CONDITIONAL 1

representative citing papers

Learned Static Function Data Structures

cs.DS · 2025-10-31 · accept · novelty 7.0

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.

Dynamic read & write optimization with TurtleKV

cs.DB · 2025-09-12 · conditional · novelty 7.0

TurtleKV uses a balanced TurtleTree on-disk structure and flexible memory tuning knobs to deliver strong performance across inserts, mixed workloads, point queries, and scans in YCSB tests, matching or beating SplinterDB, RocksDB, and WiredTiger.

citing papers explorer

Showing 2 of 2 citing papers.

  • Learned Static Function Data Structures cs.DS · 2025-10-31 · accept · none · ref 12

    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.

  • Dynamic read & write optimization with TurtleKV cs.DB · 2025-09-12 · conditional · none · ref 9

    TurtleKV uses a balanced TurtleTree on-disk structure and flexible memory tuning knobs to deliver strong performance across inserts, mixed workloads, point queries, and scans in YCSB tests, matching or beating SplinterDB, RocksDB, and WiredTiger.