asami
Apache AGE
Our great sponsors
asami | Apache AGE | |
---|---|---|
6 | 31 | |
626 | 709 | |
0.6% | - | |
0.0 | 8.5 | |
about 2 years ago | over 1 year ago | |
Clojure | C | |
Eclipse Public License 1.0 | Apache License 2.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.
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.
Apache AGE
-
Alternatives to Neo4j Enterprise
What about the AGE extension for Postgres? https://age.apache.org/
-
Anyone Using Graph Databases in F#?
Waiting for Postgres to release theirs.
-
In MongoDB you can have duplicate items even if you have unique index
I think they are talking about the AGE extension https://age.apache.org
-
Age 1.0 – PostgreSQL extension for graph database
It's my understanding of the "incubation" period of Apache Software Foundation projects is to determine if they're able to actually execute the ASF process, and a bunch of other "project maturity metrics" (https://community.apache.org/apache-way/apache-project-matur...) of which AGE currently has some self-certification: https://age.apache.org/?l=maturity#
I recognize that's not exactly an answer to the question you asked, but I would be surprised if someone other than a project member knows a more forward-looking one
-
Looking for opinions: 95% of my Data fits extremely well in a Relational Database and 5% fits extremely well into a graph database. Should I consider splitting it between the two, or is that a silly idea?
Postgres has a graph extension: https://age.apache.org. This means you can keep all your data in PG and use both models.
-
Getting Started with Redis and RedisGraph
PostgreSQL with graph extension, developed by a team at Apache Software Foundation as Apache AGE. Apache AGE uses Gremlin.
-
Ask HN: Why are relational DBs are the standard instead of graph-based DBs?
The big thing that graph dbs provide is transitive traversals of join relationships.
The problem with graph dbs is trying to return something that is not a graph. Like a count. Or derived information. And which graph model do you use? There’s more than one. Lots of information is very poorly modeled in graph dbs. Temporal organization, for example.
Ultimately, graphs are a way to use relations. But relations allow you much more flexibility to associate information (subject to the issue of transitive relationship traversal).
Mixed graph-relational is perfectly reasonable. Reasonable start here: [https://age.apache.org/]
their actual landing page is actually better than the Github one. It's a translation layer(s) to allow querying Postgres using openCypher
-
Truth Behind Neo4j’s “Trillion” Relationship Graph
Depending on how one views "postgres", there are at least two extensions that allegedly do it: https://age.apache.org/ and the AgensGraph from which AGE derives
-
One table vs two table design
There's an extension to postgresql (I haven't used it, but I am familiar with node/edge tables in MSSQL) that allows you to do this: https://age.apache.org/
What are some alternatives?
datascript - Immutable database and Datalog query engine for Clojure, ClojureScript and JS
Neo4j - Graphs for Everyone
crux - General purpose bitemporal database for SQL, Datalog & graph queries. Backed by @juxt [Moved to: https://github.com/xtdb/xtdb]
janusgraph - JanusGraph: an open-source, distributed graph database
datahike - A durable Datalog implementation adaptable for distribution.
RedisGraph - A graph database as a Redis module
datalevin - A simple, fast and versatile Datalog database
yugabyte-db - YugabyteDB - the cloud native distributed SQL database for mission-critical applications.
naga - Datalog based rules engine
grakn - TypeDB: the polymorphic database powered by types