TCache: A Transactional cache with user-defined persistence

[ bsd3, data, database, library ] [ Propose Tags ]
Versions [RSS] 0.5, 0.5.1, 0.5.2, 0.5.3, 0.5.4, 0.5.5, 0.6.4, 0.6.5, 0.8.0,,, 0.9,,,,,,,,,,,,,,,,,,,,,,,, 0.12.0, 0.12.1, 0.13.3
Change log
Dependencies base (>=4.7 && <5), bytestring, containers (>=, directory (>=1.0), hashtables, mtl, old-time (>=1.0), RefSerialize, stm, text [details]
License BSD-3-Clause
Copyright 2019 Alberto Gómez Corona
Author Alberto Gómez Corona
Category Data, Database
Home page
Bug tracker
Source repo head: git clone
Uploaded by AlbertoCorona at 2023-02-12T19:41:50Z
Distributions LTSHaskell:0.13.3, NixOS:0.13.3
Reverse Dependencies 6 direct, 3 indirect [details]
Downloads 36365 total (79 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2023-02-12 [all 1 reports]

Readme for TCache-0.13.3

[back to package description]


TCache is a transactional cache written in Haskell with configurable persistence. It allows conventional STM transactions for objects that synchronize with a user-defined storage. State is kept synchronized between memory and permanent storage via transactions. Default persistence is via files, and is provided for testing purposes. : Solves a bug in the management of weak pointers that evaporated registers from the cache : Solves a lost registers bug. : Solves a bug when object keys generate invalid filenames, and includes changes in defaultPersistence to further separate serialization from input-output.

0.9: Introduces full text search. Also adjusts serialization so it is achieved through byteStrings.

This version supports backward compatibility and also permits transparent retrieval of and transactions between objects without directly using STM references. It now provides explicit STM persistent references (DBRefs) that leverage clean, traditional haskell reference syntax for performing database transactions.

DBRefs are essentially persistent TVars indexed in the cache using a traditional readDBRef/writeDBRef Haskell interface like that of the STM Monad. Additionally, because DBRefs are serializable, they can be embedded in serializable registers. As they are references this means they point to other serializable registers. This enables persistent, mutable and efficient inter-object relations.

Triggers are also included in this release. These are user defined hooks that get called on register updates. They can be used for making the actualization of inter-object relations easier, and also permit higher-level customizable accesses. The query language internally uses triggers for its indexing.

This version also implements a straight-forward, non-intrusive, type-safe pure Haskell query language that is based on register field relations. This module can be imported separately. See Data.TCache.IndexQuery for further information.

The file persistence implementation is more reliable as IO reads are now in STM transactions.

To ease the implementation of other user-defined persistence, Data.TCache.DefaultPersistence needs to be imported explicitly for deriving file persistence instances.

The 0.9 version adds full-text indexing and search, which is incorporated into the experimental query language.

It also changes the default Persistence mechanism. Now ByteStrings are used for serialization and deserialization. A Serializable class and a Persist structure decouples serialization from ByteString and read/write to files. Both can be redefined separately, so the default persistence could be changed with setPersist to write to blobs in a databases, for example. Default persistence now no longer has to be in files.