bitcart VS sirix

Compare bitcart vs sirix and see what are their differences.

sirix

SirixDB is an an embeddable, bitemporal, append-only database system and event store, storing immutable lightweight snapshots. It keeps the full history of each resource. Every commit stores a space-efficient snapshot through structural sharing. It is log-structured and never overwrites data. SirixDB uses a novel page-level versioning approach. (by sirixdb)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
bitcart sirix
11 44
459 1,070
5.4% 1.3%
8.2 9.1
3 days ago 5 days ago
Python Java
MIT License BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

bitcart

Posts with mentions or reviews of bitcart. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-11-26.

sirix

Posts with mentions or reviews of sirix. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2024-01-24.
  • Show HN: Integer Map Data Structure
    3 projects | news.ycombinator.com | 24 Jan 2024
    We're using a similar trie structure as the main document (node) index in SirixDB[1]. Lately, I got some inspiration for different page-sizes based on the ART and HAMT basically for the rightmost inner pages (as the node-IDs are generated by a simple sequence generator and thus also all inner pages (we call them IndirectPage) except for the rightmost are fully occupied (the tree height is adapted dynamically depending on the size of the stored data. Currently, always 1024 references are stored to indirect child pages, but I'll experiment with smaller sized, as the inner nodes are simply copied for each new revision, whereas the leaf pages storing the actual data are versioned themselfes with a novel sliding snapshot algorithm.

    You can simply compute from a unique nodeId each data is assigned (64bit) the page and reference to traverse on each level in the trie through some bit shifting.

    [1] https://github.com/sirixdb/sirix

  • Endatabas: A SQLite-inspired, SQL document database with full history
    3 projects | news.ycombinator.com | 1 Dec 2023
    I'm working on something similar for the JVM, however with no document semantics, but on a much more fine granular level.

    JSON is shredded during an initial import into a tree structure with fine granular nodes. Thus, an import can be done with very low memory consumption (permitted that auto-commit issues a sync to disk before RAM space is exceeded). Furthermore, it doesn't require a WAL for consistency. Instead the indexes are stored in a log-structure using a persistent tree (as in every commit creates a new tree root). A sliding snapshot algorithm makes sure, that only a fragment of a page has to be copied on a write.

    As thus, it's also a perfect candidate for an event store, storing both the (lightweight) snapshots and tracking the changes optionally.

    https://github.com/sirixdb/sirix

    The architecture is described over here:

    https://sirix.io/docs/concepts.html

    Furthermore I'm working on a tutorial for a local client usage (work in progress):

    https://sirix.io/docs/jsoniq-tutorial.html

    Kind regards

  • Show HN: Bitemporal, Binary JSON Based DBS and Event Store
    6 projects | news.ycombinator.com | 13 Nov 2023
    Can someone (an admin) maybe add the direct link to https://github.com/sirixdb/sirix in the URL field. Totally forgot, that it's possible to add both a text and a URL ;)
    6 projects | news.ycombinator.com | 13 Nov 2023
    Cool seeing this posted here. I remember making a logo for a Hacktoberfest[0]. It was stylized 'S' to look like a space-time light cone.

    [0] https://github.com/sirixdb/sirix/pull/105

    6 projects | news.ycombinator.com | 13 Nov 2023
    If anyone is up to building a new frontend, that would be awesome (of course, work could also be split between interested people) :-)

    https://github.com/sirixdb/sirix/issues/627

    6 projects | news.ycombinator.com | 13 Nov 2023
  • Show HN: Light implementation of Event Sourcing using PostgreSQL as event store
    9 projects | news.ycombinator.com | 31 Oct 2023
    I'm working on an append-only (immutable) (bi)temporal DBS[1] in my spare time, which transforms CRUD operations into an event store, automatically providing an audit log for each stored node, while the nodes are stored with immutable node-IDs, which never change. As the contents stored are based on a custom binary JSON format also a rolling hash can optionally be built, to check if a whole subtree has changed or not.

    The system uses persistent index data structures to share unchanged pages between revisions.

    The intermittant snapshots are omitted. Rather the snapshot is spread over several revisions, applying a sliding snapshot algorithm on the data pages (thus, avoiding write peaks, while at max a predefined number of page fragments has to be read in parallel to reconstruct a page in-memory).

    [1] https://sirix.io | https://sirix.io/docs/concepts.html

  • Show HN: Evolutionary (binary) JSON data store (full immutable revision history)
    3 projects | news.ycombinator.com | 21 Oct 2023
    I've already posted the project a couple of years ago and it gained some interest, but a lot of stuff has been done since then, especially regarding performance, a complete new JSON store, a REST API, various internals refactored, an improved JSONiq based query engine allowing updates, a now already dated web UI, a new Kotlin based CLI, a Python and TypeScript client to ease the use of Sirix...

    First prototypes from a precursor stem already from 2005.

    So, what is it all about?

    I'm working on an evolutionary data store in my spare time[1]. It is based on the idea to get rid of the need for a second trx log (the WAL) by using a persistent tree of tries (preserving the previous revision through copy on write and path copying to the root) index as the log itself with only a single permitted read/write txn concurrently and in parallel to N read-only txns, which are bound to specific revisions during the start. The single writer is permitted on a resource (comparable to a table/relation in a relational DB) basis within a database, reads do not involve any locks at all.

    The idea is, that the system atomically swaps the tree root to the new version (replicated). If something fails the log can simply be truncated to the former tree root.

    Thus, the system has many similarities with Git (structural sharing of unchanged nodes/pages) and ZFS snapshots (regarding the latter the keyed trie has been inspired by ZFS, as well as that checksums for child pages are stored in parent pages in the references to the child pages)[2].

    You can of course simply execute time travel queries on the whole revision history, add commit comments and the author to answer questions such as who committed what at which point in time and why...

    The system not only copies full data pages, but it applies a sliding snapshot versioning algorithm to keep storage space to a minimum.

    Thus, it's best suited for fast flash drives with fast random reads and sequential writes. Data is never overwritten, thus audit trails are given for free.

    The system stores find granular JSON nodes, thus the structure and size of an object has almost no limits. A path summary is built, which is an unordered set of all paths to leaf nodes in the tree and enables various optimizations. Furthermore a rolling hash is optionally built, whereas during inserts all ancestor node hashes are adapted.

    Furthermore it optionally keeps track of update operations and the ctx nodes involved during txn commits. Thus, you can easily get the changes between revisions, you can check the full history of nodes, as well as navigate in time to the first revision, the last revision, the next and previous revision of a node...

    You can also open a revision at a specific system time revert to a revision and commit a new version while preserving all revisions in-between.

    As said one feature is, that the objects can be arbitrarily nested, thus almost no limits in the number and updates are cheap.

    A dated Jupyter notebook with some examples can be found in [3] and overall documentation in [4].

    The query engine[5] Brackit is retargetable (a couple of interfaces and rewrite rules have to be implemented for DB systems) and especially finds implicit joins and applies known algorithms from the relational DB systems world to optimize joins and aggregate functions due to set-oriented processing of the operators.[6]

    I've given an interview in [7], but I'm usually very nervous, so don't judge too harshly.

    Give it a try and happy coding!

    Kind regards

    Johannes

    [1] https://sirix.io | https://github.com/sirixdb/sirix

    [2] https://sirix.io/docs/concepts.html

    [3] https://colab.research.google.com/drive/1NNn1nwSbK6hAekzo1YbED52RI3NMqqbG#scrollTo=CBWQIvc0Ov3P

    [4] https://sirix.io/docs/

    [5] http://brackit.io

    [6] https://colab.research.google.com/drive/19eC-UfJVm_gCjY--koOWN50sgiFa5hSC

    [7] https://youtu.be/Ee-5ruydgqo?si=Ift73d49w84RJWb2

  • Evolutionary, JSON data store (keeping the full revision history)
    3 projects | news.ycombinator.com | 20 Oct 2023
  • Immutable Data
    2 projects | news.ycombinator.com | 26 Jun 2023
    You can use Datomic for instance (mentioned already in your article IIRC!?) or SirixDB[1] on sich I'm working in my spare time.

    The idea is an indexed append-only log-structure and to use a functional tree structure (sharing unchanged nodes between revisions) plus a novel algorithm to balance incremental and full dumps of database pages using a sliding window instead.

    [1] https://sirix.io | https://github.com/sirixdb/sirix

What are some alternatives?

When comparing bitcart and sirix you can also consider the following projects:

starsessions - Advanced sessions for Starlette and FastAPI frameworks

CXXGraph - Header-Only C++ Library for Graph Representation and Algorithms

zed - A novel data lake based on super-structured data

keycloak-kafka - Keycloak module to produce events to kafka

hash4j - Dynatrace hash library for Java

sqlglot - Python SQL Parser and Transpiler

Sinatra - Classy web-development dressed in a DSL (official / canonical repo)

scim-for-keycloak - a third party module that extends keycloak by SCIM functionality

keycloak-theme-sample - Sample Keycloak Theme

starlette-context - Middleware for Starlette that allows you to store and access the context data of a request. Can be used with logging so logs automatically use request headers such as x-request-id or x-correlation-id.

resuminator - Build beautiful single-page resumes; without the hassle! The easiest resume-builder out there with intuitive drag-n-drop & WYSIWYG editor

brackit - Query processor with proven optimizations, ready to use for your JSON store to query semi-structured data with JSONiq. Can also be used as an ad-hoc in-memory query processor.