In my experience with various ORMs and object persistence
infrastructure, the challenge is always how to decompose a non-trivial
data structure either into a flat representation suitable for key-value
datastores, or into inter-related tables suitable for relational
datastores. Although tools such as SQLAlchemy provide convenience
functions for simple structures, inevitably there is substantial design
effort involved in representing hierarchical data types, e.g. record of
records or lists. So I feel that the problem of hierarchical data
decomposition is much more fundamental than abstracting the operational
details of the storage backend.

Ivan

On 8/28/20 8:00 PM, John Cowan wrote:
> https://www-sop.inria.fr/mimosa/fp/Bigloo/doc/bigloo-19.html
>
> Here's all it has:
>
> 1) Open a database.
> 2) Close a database.
> 3) Format a string to escape it properly (would need some changes)
> 4) Execute a SQL command, auto-formatting the command string
> with arguments, returns one value
> 5) Evaluate a SQL statement (not clear how these are different)
> 6) Evaluate a SQL statement, map a Scheme proc over the values and
> return a list.
>
> You think this would make sense as a SRFI, just to get some easy and
> cheap persistence into Scheme?
>
>
>
> John Cowan http://vrici.lojban.org/~cowan xxxxxx@ccil.org
> <mailto:xxxxxx@ccil.org>
> I Hope, Sir, that we are not mutually Un-friended by this Difference
> which hath happened betwixt us.
>       --Thomas Fuller, Appeal of Injured Innocence (1659)
>
>
>