Skip to content

Latest commit

 

History

History
20 lines (12 loc) · 2.44 KB

README.md

File metadata and controls

20 lines (12 loc) · 2.44 KB

cachelog

GoDoc

Cachelog provides a log structured cache. Put()s are not fsynced to disk actively. The advantage is that they're way faster, the downside is that you might lose cache data. If you want to ensure to never have stale data, you can first call Delete() to clear out a piece of the cache. Delete()s are fsynced to disk in separate log files with a tiny write.

The intended use case is for storing a partial (but correct) cache of file data. Get/Put/Delete all take a filename and an offset to operate on. The filename isn't treated specially so can be any []byte you want. The filename is stored with each block in the logs, so using 1MB filenames will use a lot of space.

Guarantees:

  • If Put() succeeds and your machine/disk doesn't crash, Get() will return the latest data. If your machine/disk does crash, some Put() calls might be lost and old data will be served once it starts up again.
  • If Delete() succeeds, that data will never be served again regardless of crashes.
  • Get() never returns incorrect (except stale) data, assuming no CPU/memory corruption. Bit flips on disk and partial syncs are detected and will cause data to be discarded and possibly stale data to be served (through the same mechanism we detect partial log entries: they're all md5 hashed).

Put() writes to disk sequentially.

Get() does random 8 byte disk writes to indicate that the blocks have been recently accessed. These writes are skipped if the timestamp was updated recently (less than 1% of config.Expiry has passed). If you don't need expiry, set Config.Expiry to the maximum to effectively disable it.

You can configure garbage collection through Config.MaxGarbageRatio. The default of 0.75 allows 75% of the data in the logs to be stale before garbage collection is started. Garbage collection involves copying the still relevant blocks to the latest log file (sorting and merging them while at it) and then dropping the old file. Don't set this too low, as you'll be spending lots of IOPS on copying still active data.

The is no block size, no padding. If you Put() 31 bytes, there will be a 31 byte (+header) block in the log. You'll get the best performance if your Get()s request data that was written in a single Put(), to avoid disk seeks. If you do Get() across block boundaries, the data will be requested in parallel so the kernel/disk can optimize to reduce seeks.