tries-T9-Prediction
asami
tries-T9-Prediction | asami | |
---|---|---|
1 | 6 | |
1 | 626 | |
- | 0.0% | |
10.0 | 0.0 | |
over 7 years ago | about 2 years ago | |
C++ | Clojure | |
- | Eclipse Public License 1.0 |
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.
tries-T9-Prediction
-
Ask HN: What are some 'cool' but obscure data structures you know about?
Even though a trie is pretty standard and expected (to be known) these days it was my first deep dive into more exotic data structures after an interview question about implementing T9 that stumped me many years ago.
https://github.com/Azeem112/tries-T9-Prediction
asami
- Ask HN: What are some 'cool' but obscure data structures you know about?
-
Ask HN: Why are relational DBs are the standard instead of graph-based DBs?
Unlike some other commenters, I agree that graph models are usually a better fit for most data than relational models. There's been some interesting work in recent years developing this idea: in the Clojure world there's Datomic, XTDB, and a host of competitors, all of which build on work from Semantic Web/SPARQL/triplestores and logic programming. Some are even intended to be used as primary datastores: they support some amount of schema and constraints, have well-defined consistency and ACID guarantees, etc. This makes them unlike graph databases like Neo4J and others, which fill an architectural role more like Elasticsearch as a read-optimization tool. Here's an interesting talk making a case for triple-based databases.
- Introduction to the Asami Graph Database
-
How to query Datomic, Datascript, Asami, or other graph databases
Despite the documentation that exists, I've heard many people who have been confused about how to query Datomic, Datascript, Asami, or other graph databases. So I've made an attempt at explaining it https://github.com/threatgrid/asami/wiki/Introduction
- Introduction (To Graph Databases)
-
Asami
The first Graph implementation for Asami was a simple in-memory data structure, described in my ClojureD talk. The code for this appears in asami.index. This file started much smaller (as referenced above), but has since expanded with the needs extended functionality, such as transactions, and transitive closure operations.
What are some alternatives?
minisketch - Minisketch: an optimized library for BCH-based set reconciliation
datascript - Immutable database and Datalog query engine for Clojure, ClojureScript and JS
RVS_Generic_Swift_Tool
crux - General purpose bitemporal database for SQL, Datalog & graph queries. Backed by @juxt [Moved to: https://github.com/xtdb/xtdb]
RoaringBitmap - A better compressed bitset in Java: used by Apache Spark, Netflix Atlas, Apache Pinot, Tablesaw, and many others
datahike - A durable Datalog implementation adaptable for distribution.
RVS_Generic_Swift_Toolbox - A Collection Of Various Swift Tools, Like Extensions and Utilities
datalevin - A simple, fast and versatile Datalog database
clojure - The Clojure programming language
Apache AGE - Graph database optimized for fast analysis and real-time data processing. It is provided as an extension to PostgreSQL. [Moved to: https://github.com/apache/age]
TablaM - The practical relational programing language for data-oriented applications
naga - Datalog based rules engine