HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
andrewhodel
sdb
JavaScript2017–2017
andrewhodel / sdb

sdb

A memory cache database that provides indexes, range searches, regex searches and fulltext searches.

2Distinct people
2Mentions
0Explicit recommenders
1GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A memory cache database that provides indexes, range searches, regex searches and fulltext searches.

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by hour2 dated mentions

Observed mentions: 2017-12-08 17:29:32 UTC to 2017-12-08 18:10:36 UTC.

012017-12-08 17:00:00 UTC to 2017-12-08 18:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsDec 8, 17:002017-12-08 18:00:00 UTC to 2017-12-08 19:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsDec 8, 18:00

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Dec 8, 17:002017-12-08 17:00:00 UTC2017-12-08 18:00:00 UTC110
Dec 8, 18:002017-12-08 18:00:00 UTC2017-12-08 19:00:00 UTC101

What Hacker News says

2 sources

SQL vs. noSQL – the right solution

SQL bitches because of this situation; imagine that 2 users were accessing the database and while one was reading a list of id's in one table and joining them to a list of names with corresponding id's in another table another user was modifying the list of corresponding names to id's in the other table. so nosql tries to solve this by basically using only the locks of update and read per "table" or "collection" call (meaning they have no JOINS and they have plenty of hard drive space) they do this by storing the "oh I need to look up the _id to get that name" directly in the first table or collection. nosql basically says let's fragment everything up into tiny databases and handle the locks at a higher level, like at the API between 2 or more parties so that 50 people aren't accessing something at once anyway. you have to admit that
Read the rest
does seem prone to error the issue is that then if you have a table with a million rows storing the same data there's no point in using the relational part of a database what I do not understand, is why can't they just pass along a function allowing the user to lock and unlock their own database? Then the user just needs find, update and delete and if they wan't to join in any crazy way they can dream up, they just do it in the data loops (they can store it locally in a big loop while locking) that is why db.lock() and db.unlock() exist in sdb, you only need to use them if this type of situation were to arise https://github.com/andrewhodel/sdb
8 points · Open discussion

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.