Database is organized collection of data, so a disk full of porn in different formats from json to mp4 can be a database, as long as it’s organized in some way
At a certain level all data is a pair (some name, blob of bytes). You can concatenate sequences of those pairs into a tar archive and call that a database. To access “the last object” you’d have to seek over the “first” objects. So you can build another set of (some name, blob of bytes) that serves as an index into the first set. You’ll first have to do at least one full pass over that first set, and you’ll need to make space on the books to account for twice as many sets, AND you’ll still have to do some seeking over the “first objects” in the indexing collection, but it all keeps recall times very short!
You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: !programmerhumor@lemmy.ml
Post funny things about programming here! (Or just rant about your favourite programming language.)
Rules:
Posts must be relevant to programming, programmers, or computer science.
No NSFW content.
Jokes must be in good taste. No hate speech, bigotry, etc.
Database is organized collection of data, so a disk full of porn in different formats from json to mp4 can be a database, as long as it’s organized in some way
I am interested in your json porn.
Not sure what you expected
Edit: also found this https://json-porn.com/
Oh God, don’t watch the etc porn! You’ll never be able to unsee it…
It’s so straight. I prefer yaml porn
For real. Numbers are strings? Yeah, okay.
YAML is better. UCL porn though. 🥵 Things are getting niche when UCL shows up.
Right? Organized, structured, same thing, or? A database can’t have no structure, right? I don’t even know how one would create such a database.
At a certain level all data is a pair (some name, blob of bytes). You can concatenate sequences of those pairs into a tar archive and call that a database. To access “the last object” you’d have to seek over the “first” objects. So you can build another set of (some name, blob of bytes) that serves as an index into the first set. You’ll first have to do at least one full pass over that first set, and you’ll need to make space on the books to account for twice as many sets, AND you’ll still have to do some seeking over the “first objects” in the indexing collection, but it all keeps recall times very short!
What do you mean by “no structure”? Afaik mongodb does not enforce a schema in a collection by default
Ah yes, mongo and document databases, forgot about those. Yeah those could be a pain to get data from if there’s no structure. 😅