duckdb-pgq VS efg

Compare duckdb-pgq vs efg and see what are their differences.

duckdb-pgq

DuckDB is an in-process SQL OLAP Database Management System (by cwida)
InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
duckdb-pgq efg
1 2
34 15
- -
0.0 4.7
about 1 month ago 11 months ago
C++ C
MIT License Apache License 2.0
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.

duckdb-pgq

Posts with mentions or reviews of duckdb-pgq. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-07-03.
  • Vectorizing Graph Neural Networks
    4 projects | news.ycombinator.com | 3 Jul 2023
    You might be interested in duckdb-pgq[1], working on implementing graph queries support in duckdb. There are some papers online about it as well if you are interested.

    1: https://github.com/cwida/duckdb-pgq

efg

Posts with mentions or reviews of efg. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-07-03.
  • Vectorizing Graph Neural Networks
    4 projects | news.ycombinator.com | 3 Jul 2023
    > I believe you are not guaranteed for the edge data of adjacent nodes to be adjacent in memory

    The edge data of a particular node is contiguous, but yes, the edge data of a collection of nodes is not contiguous. You can reorder (permute) the graph for some metric as a preprocessing step so that you get better locality. This only works for static graphs though.

    > For float-based edge data I think quantization works well, and I believe you can further compress the ROW/COL indices

    Yes, index compression is pretty well studied and understood. The challenge here is mostly good compression ratio and high decompression performance. There are a couple of works that I'm aware of that do this for gpus. This repo by Mo Sha et al. (https://github.com/desert0616/GCGT) is pretty good, and I also did some work in this space (https://github.com/pgera/efg).

  • A Compressed Indexable Bitset
    6 projects | news.ycombinator.com | 1 Jul 2023
    Btw, core EF is quite efficient on the decoding side even on GPUs. I wanted to do PEF, but that seemed a bit more involved and didn't have the time to do it. Here's a GPU implementation for graph problems if anyone is interested: https://github.com/pgera/efg

What are some alternatives?

When comparing duckdb-pgq and efg you can also consider the following projects:

GCGT - Source code for the paper: GPU-based Compressed Graph Traversal

pisa - PISA: Performant Indexes and Search for Academia

ds2i - A library of inverted index data structures

nodevectors - Fastest network node embeddings in the west

Folly - An open-source C++ library developed and used at Facebook.

tantivy - Tantivy is a full-text search engine library inspired by Apache Lucene and written in Rust