garph
hashtable-benchmarks
garph | hashtable-benchmarks | |
---|---|---|
27 | 8 | |
1,290 | 29 | |
1.2% | - | |
7.4 | 4.7 | |
3 months ago | 6 months ago | |
TypeScript | Java | |
MIT License | 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.
garph
-
Best backend for GQL?
https://garph.dev is pretty good. I have been using it for two months and love the experience. I had started out with nexus and briefly also evaluted pothos but switched to garph because the dev experience was superior. It takes full advantage of the structural type system of typescript rather than frameworks that lean more towards java style idioms.
-
Ask HN: Who wants to be hired? (December 2023)
Location: EU, Germany
Remote: Yes
Willing to relocate: Yes
Technologies: HTML, CSS, TailwindCSS, JavaScript, TypeScript, Node.js, React/Next.js, Vue/Nuxt, GraphQL, REST, Postgres, Git, AWS, Docker + K8s
GitHub: https://github.com/mishushakov
LinkedIn: https://linkedin.com/in/mishushakov
Email: hey at mish.co
Most recently, I worked at Step CI a Technical Founder and authored the API-Testing Framework (https://stepci.com) and Garph (https://garph.dev), a full-stack API-Framework, which brings the developer-experience of tRPC to GraphQL.
My passion is in making tools developers love using and make them more productive.
-
tRPC – Move Fast and Break Nothing. End-to-end typesafe APIs made easy
If you want something like tRPC but for GraphQL, you should definitely give Garph a try: https://garph.dev
-
I reviewed 1,000s of GraphQL vs. REST perspectives
Amazing findings! Really admire your effort here
Btw. If you're building a GraphQL API using TypeScript, you should take a look at garph (https://garph.dev) which helps you to create type-safe GraphQL APIs without code-gen
-
Next.js and GraphQL: The Perfect Combination for Full Stack Development
The next step is undoubtedly the creation of our GraphQL Schema using Garph to create a totally type-safe API without needing to do codegen.
- Garph - Fullstack Open-source GraphQL framework for TypeScript
- Garph - Fullstack Open-Source GraphQL framework for TypeScript
- Garph - Fullstack GraphQL framework for TypeScript
hashtable-benchmarks
-
Building a faster hash table for high performance SQL joins
Since the blog post mentioned a PR to replace linear probing with Robin Hood, I just wanted to mention that I found bidirectional linear probing to outperform Robin Hood across the board in my Java integer set benchmarks:
https://github.com/senderista/hashtable-benchmarks/blob/mast...
https://github.com/senderista/hashtable-benchmarks/wiki/64-b...
-
Ask HN: Who wants to be hired? (December 2023)
https://homes.cs.washington.edu/~magda/papers/wang-cidr17.pd...
I'm most interested in developing high-performance database engines in low-level languages, but open to any challenging systems programming project. I've been working in C++ for the last 3 years, but have written nontrivial projects in Rust and Java as well (e.g., https://github.com/senderista/rotated-array-set, https://github.com/senderista/hashtable-benchmarks). I would enjoy using Rust or Zig on a new project, but I consider the project itself to be much more important than the language it's written in. I am not interested in cryptocurrency, adtech, or fintech projects.
-
Factor is faster than Zig
Thanks for the details on your benchmarks. I would like sometime to extend BLP to a more generic setting; as I said I think any trick used with RH would also work with BLP. I just used an integer set because that's all I needed for my use case and it was easy to implement several different approaches for benchmarking. As you note, it favors use cases where the hash function is cheap (or invertible) and elements are cheap to move around.
About your question on load factors: no, the benchmarks are measuring exactly what they claim to be. The hash table constructor divides max data size by load factor to get the table size (https://github.com/senderista/hashtable-benchmarks/blob/mast...), and the benchmark code instantiates each hash table for exactly the measured data set size and load factor (https://github.com/senderista/hashtable-benchmarks/blob/mast...).
I can't explain the peaks around 1M in many of the plots; I didn't investigate them at the time and I don't have time now. It could be a JVM artifact, but I did try to use JMH "best practices", and there's no dynamic memory allocation or GC happening during the benchmark at all. It would be interesting to port these tables to Rust and repeat the measurements with Criterion. For more informative graphs I might try a log-linear approach: divide the intervals between the logarithmically spaced data sizes into a fixed number of subintervals (say 4).
-
Inside boost::unordered_flat_map
I think "bidirectional linear probing" is an underrated approach (and much simpler): https://github.com/senderista/hashtable-benchmarks/blob/master/src/main/java/set/int64/BLPLongHashSet.java
-
A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion
I will probably never get around to porting my bidirectional linear probing integer hash set from Java to C++, but I hope someone can try adapting BLP to general C++ hashmaps and hashsets, because it significantly outperforms Robin Hood in my benchmarks.
-
Ask HN: Who wants to be hired? (March 2022)
https://homes.cs.washington.edu/~magda/papers/wang-cidr17.pd...
I'm most interested in developing high-performance database engines in low-level languages, but open to any challenging systems programming project. I've been working in C++ for the last 2 years, but have written nontrivial projects in Rust and Java as well (e.g., https://github.com/senderista/rotated-array-set, https://github.com/senderista/hashtable-benchmarks). I would enjoy using Rust or Zig on a new project, but I consider the project itself to be much more important than the language it's written in. I am not interested in cryptocurrency, adtech, or fintech projects.
What are some alternatives?
zodios - typescript http client and server with zod validation
unordered_dense - A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion
sonner - An opinionated toast component for React.
myria - Myria is a scalable Analytics-as-a-Service platform based on relational algebra.
ts-reset - A 'CSS reset' for TypeScript, improving types for common JavaScript API's
js2scheme
nuxt-scheduler - Create scheduled jobs with human readable time settings
flat_hash_map - A very fast hashtable
llm-client - LLMClient - JS/TS Use prompt signatures, Agents, Reasoning, Function calling, RAG and more. Based on the Stanford DSP Paper
robin-hood-hashing - Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
suspense - Utilities for working with React Suspense
nafeez.xyz - ⚡ My personal website.