this post was submitted on 22 Jun 2024
810 points (98.7% liked)

Programmer Humor

32721 readers
331 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

founded 5 years ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[–] victorz@lemmy.world 0 points 6 months ago (2 children)

as long as it's organized in some way

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.

[–] iarigby@lemmy.world 2 points 6 months ago (1 children)

What do you mean by “no structure”? Afaik mongodb does not enforce a schema in a collection by default

[–] victorz@lemmy.world 3 points 6 months ago

Ah yes, mongo and document databases, forgot about those. Yeah those could be a pain to get data from if there's no structure. 😅

[–] NicolaHaskell@lemmy.world 2 points 6 months ago

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!