Pith. sign in

REVIEW 1 cited by

MetaHive: A Cache-Optimized Metadata Management for Heterogeneous Key-Value Stores

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.19090 v1 pith:JDIFWIZ5 submitted 2024-07-26 cs.DB cs.IR

classification cs.DBcs.IR
keywords metadatametahivedatastoresheterogeneouscache-optimizedclusterskey-value
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Cloud key-value (KV) stores provide businesses with a cost-effective and adaptive alternative to traditional on-premise data management solutions. KV stores frequently consist of heterogeneous clusters, characterized by varying hardware specifications of the deployment nodes, with each node potentially running a distinct version of the KV store software. This heterogeneity is accompanied by the diverse metadata that they need to manage. In this study, we introduce MetaHive, a cache-optimized approach to managing metadata in heterogeneous KV store clusters. MetaHive disaggregates the original data from its associated metadata to promote independence between them, while maintaining their interconnection during usage. This makes the metadata opaque from the downstream processes and the other KV stores in the cluster. MetaHive also ensures that the KV and metadata entries are stored in the vicinity of each other in memory and storage. This allows MetaHive to optimally utilize the caching mechanism without extra storage read overhead for metadata retrieval. We deploy MetaHive to ensure data integrity in RocksDB and demonstrate its rapid data validation with minimal effect on performance.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees

    cs.DB 2025-02 conditional novelty 6.0 of 10

    A dual-objective learned index for LSM trees co-optimizes block partitioning and lookup error, with an RL agent tuning parameters, and reports 1.19-2.21x throughput gains in RocksDB.

Pith tools