A new data structure in computer programming. I got the idea from cell chemistry, and figured computers today can handle slow and inefficient, instead of fast and clever. Turns out it’s also great for networking.
Basically the data is moved around by things very slowly. It’s easy to integrate them into different systems. It’s like a very slow communication layer on top of everything else.
I’ve been working on this for some now; I’ll be talking about this more when I finish all the api.
the open-api inbound calls and db have been done for months. But it’s not a complete implementation in the code. However the spec was done a couple years ago and it has not changed, which means I’m probably going to keep that one.
I’m working on a testing platform where people can log in and try the library. I’m using that to test and finish.
Once I have actually finished, it will be public under the apache2 license. I’ll save this comment and let you know in a new community I will make in .ml for it
I actually do think I’ve invented a data structure for interleaving multiple streams in a single file in a really efficient way. I can’t find something that looks like it, and it seems obviously faster and more logical than anything else I’ve seen. It’s the level below B-trees so not optimised for least amount of lookups within a record table, nor would it be efficient for adding records in a middle of the stream, but for treating data streams like files (append, shrink) I do think it’s significantly more efficient than what else I can find. One of these days I really should submit a paper and see what reviewers say.
A new data structure in computer programming. I got the idea from cell chemistry, and figured computers today can handle slow and inefficient, instead of fast and clever. Turns out it’s also great for networking.
👀 explain more!
It’s a personal project I’ve been working on.
Basically the data is moved around by things very slowly. It’s easy to integrate them into different systems. It’s like a very slow communication layer on top of everything else.
Any chance there is a repo for it? 🤩
Thanks 😊. Several, but still in development.
I’ve been working on this for some now; I’ll be talking about this more when I finish all the api.
the open-api inbound calls and db have been done for months. But it’s not a complete implementation in the code. However the spec was done a couple years ago and it has not changed, which means I’m probably going to keep that one.
I’m working on a testing platform where people can log in and try the library. I’m using that to test and finish.
Once I have actually finished, it will be public under the apache2 license. I’ll save this comment and let you know in a new community I will make in .ml for it
I actually do think I’ve invented a data structure for interleaving multiple streams in a single file in a really efficient way. I can’t find something that looks like it, and it seems obviously faster and more logical than anything else I’ve seen. It’s the level below B-trees so not optimised for least amount of lookups within a record table, nor would it be efficient for adding records in a middle of the stream, but for treating data streams like files (append, shrink) I do think it’s significantly more efficient than what else I can find. One of these days I really should submit a paper and see what reviewers say.