Replies: 2 comments 1 reply
-
|
Hi @atech-hub I find your work really interesting, could you please email me, I would like to collab: |
Beta Was this translation helpful? Give feedback.
1 reply
-
|
My apologies, I did forgot to add citation to the paper that glued everyhthing into place. I have updated the docs in GitHub. |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
I'm not a developer — I'm a sysadmin who fell down a mathematical rabbit hole. I ended up with a question that I think is relevant to CozoDB's approach to relational algebra.
The idea: encode values as phases on a unit circle, then use cos(n × Δθ) to detect typed relationships. When n=2 you find pairs, n=3 finds triples, n=4 finds quadrants — all from a single parameterised function instead of explicit JOINs or traversals.
What caught my attention about CozoDB is your position that relational algebra should be composable. This approach reduces the relational query to one function where the "type" of relationship is just the harmonic number. It feels algebraically composable in a way that graph traversals and SQL JOINs aren't.
I built a proof of concept in Rust with AI assistance (~530 lines, zero dependencies, 10 tests passing). In one test, a single scan with n=3 found 75 entities across 3 groups — something that would typically need 2-3 JOINs.
Has anything like this been explored in Datalog or relational algebra literature?
MIT license: https://github.com/atech-hub/Wave-Coherence-as-a-Computational-Primitive
Beta Was this translation helpful? Give feedback.
All reactions