Apache AGE
xxHash
Apache AGE | xxHash | |
---|---|---|
31 | 28 | |
709 | 8,562 | |
- | - | |
8.5 | 8.3 | |
almost 2 years ago | 4 days ago | |
C | C | |
Apache License 2.0 | GNU General Public License v3.0 or later |
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.
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/
xxHash
-
The One Billion Row Challenge in CUDA: from 17 minutes to 17 seconds
> GPU Hash Table?
How bad would performance have suffered if you sha256'd the lines to build the map? I'm going to guess "badly"?
Maybe something like this in CUDA: https://github.com/Cyan4973/xxHash ?
- ETag and HTTP Caching
-
Day 64: Implementing a basic Bloom Filter Using Java BitSet api
Examples of fast, simple hashes that are independent enough includes murmur, xxHash, Fowler–Noll–Vo hash function and many others
- Closed-addressing hashtables implementation
-
NIST Retires SHA-1 Cryptographic Algorithm
If you're only using the hash for non-cryptographic applications, there are much faster hashes: https://github.com/Cyan4973/xxHash
-
Does the checksum algorithm crc32c-intel support AMD Ryzen series 3000 or newer?
I found the benchmark result of AMD ryzen 5950X
-
[Study Project] A memory-optimized JSON data structure
But what's the catch, you're thinking ? Well, it is a bit slower than its counterparts when it comes to deserializing (and marginally faster for serializing). To achieve smaller footprint, it uses a few tricks and notably a custom hash table to deduplicate strings. This comes at a cost of course (even when featuring xxHash to speed things up), but keeps the slowdown reasonable (I think).
-
What do you typically use for non-cryptographic hash functions?
Non cryptographic hashes has collisions, for example, assume you having content like "abcdefg" which hashed value is "123", in case of weak hash algorithm some other content like "abcdefZ" can also have a hash "123" which basically means such hash function is failed to be unique fingerprint of particular content. BLAKE3 for example can do 6-7Gb/s which make it pretty fast and secure. If your requirement accepts collision with defined error rate, I would advise you to take a look at XXH3 if you need very snappy hash algorithm, which can run at pace or RAM access (30GB/s+), but again, run tests at particular equipment you targeting, may be AES hardware accelerated MeowHash will serve you better.
- C++ gonna die😥
- rsync, article 3: How does rsync work?
What are some alternatives?
Neo4j - Graphs for Everyone
BLAKE3 - the official Rust and C implementations of the BLAKE3 cryptographic hash function
janusgraph - JanusGraph: an open-source, distributed graph database
meow_hash - Official version of the Meow hash, an extremely fast level 1 hash
RedisGraph - A graph database as a Redis module
xxh - 🚀 Bring your favorite shell wherever you go through the ssh. Xonsh shell, fish, zsh, osquery and so on.
yugabyte-db - YugabyteDB - the cloud native distributed SQL database for mission-critical applications.
blake3 - An AVX-512 accelerated implementation of the BLAKE3 cryptographic hash function
datalevin - A simple, fast and versatile Datalog database
smhasher - Hash function quality and speed tests
datahike - A durable Datalog implementation adaptable for distribution.
swift-crypto - Open-source implementation of a substantial portion of the API of Apple CryptoKit suitable for use on Linux platforms.