The presentation will cover a new OCaml persistent-on-disk key-value store library. The library uses a B-tree library introduced at OCaml’17. The B-tree code has been extensively reworked to make it fast, and to support both copy-on-write and mutate-in-place operations. On top of this core, we include a write-ahead log, session initialization and termination, and extensive LRU-style caching. The API supports various “sync” operations, analogous to those found in filesystems.
Thu 22 AugDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
16:50 - 18:15
|Compiling Successor ML Pattern Guards
|A Key-Value store for OCaml
Tom Ridge University of Leicester, UKFile Attached
|Towards Machine Learning Induction in Poly/ML
Yutaka Nagashima Data61, AustraliaFile Attached