4 ms·
First, this is a fun implementation and I love it. Second, you could as easily embed an infinite size dataset into an infinitely long binary string and say tha
by idiotsecant 5y ago
First, this is a fun implementation and I love it.
Second, you could as easily embed an infinite size dataset into an infinitely long binary string and say that you've reproduced your dataset with a 'single' parameter! That's sort of what this is doing, with some extra steps.
- laumars 5y agoYour second point is what I first assumed this paper was doing before I read it.
- cobookman 5y agoUp until ARG_MAX is reached, or you run out of RAM that is... https://serverfault.com/a/844666 https://serverfault.com/a/844666
- hnlmorg 5y agoThis reminds me of the fun thought experiment of using /dev/random as storage. Given an infinite amount of time you'll find every file you need.
- kirubakaran 5y agoInfinite storage, horrendous seek time.
- amelius 5y agoThe index might need more bits than the file.
- hnlmorg 5y agoConsiderably more in all probability :)
- alisonkisk 5y agoπfs https://github.com/philipl/pifs https://github.com/philipl/pifs