NoSQL Schema Design for Time-Dependent Workloads

Makoto Onizuka; Michael Mior; Teruyoshi Zenmyo; Yusuke Wakuta; Yuya Sasaki

REVIEW

NoSQL Schema Design for Time-Dependent Workloads

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2303.16577 v1 pith:LRQFWO6P submitted 2023-03-29 cs.DB

Yusuke Wakuta , Michael Mior , Teruyoshi Zenmyo , Yuya Sasaki , Makoto Onizuka This is my paper · ORCID

classification cs.DB

keywords methodschemaworkloadsnosqloptimizationproposetime-dependentabstraction

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

In this paper, we propose a schema optimization method for time-dependent workloads for NoSQL databases. In our proposed method, we migrate schema according to changing workloads, and the estimated cost of execution and migration are formulated and minimized as a single integer linear programming problem. Furthermore, we propose a method to reduce the number of optimization candidates by iterating over the time dimension abstraction and optimizing the workload while updating constraints.

Discussion (0). Continue with ORCID to comment.

Pith tools