quassnoi

12 ms·

1.
Finding the best starting word for Wordle using SQL(explainextended.com)
3 points by quassnoi 5y ago|0 comments
2.
by quassnoi 7y ago
Lack of access to central sewage system does not necessarily imply a lack of a "normal WC". This figure includes households which use individual sewage systems ending up in septic tanks or cesspools, and is not significantly large
3.
by quassnoi 13y ago
There is no advantage: the modern GPU can build thousands of full page resolution fractals per second while SQL takes seconds to produce a hundred by hundred characters ASCII art. It's just a New Year SQL picture post, something I do
4.
by quassnoi 15y ago
Sure, especially if you nest the sets using a datatype indexable with an R-Tree index: http://explainextended.com/2009/09/29/adjacency-list-vs-nest... However, nested sets is still very expensive to update which may be a deciding factor i
5.
by quassnoi 16y ago
Thank you all guys and happy New Year!
6.
by quassnoi 16y ago
OK, OK. Most of your workloads are HDD bound.
7.
by quassnoi 16y ago
"HDD bound" here means that not all data fits into the cache. Given the average RAM size on even an entry-level server (some 16 or maybe even 8 GB) and the average size of a database (same 8GB on http://musicbrainz.org/ , the largest onlin
8.
by quassnoi 16y ago
What do you actually get from using MySQL? Convenience of the complex queries. If you need anything more than a simple key-value access, you'll in fact need to implement the query engine yourself if you decide to use NoSQL. Note that the
9.
by quassnoi 16y ago
So, if you're bypassing most of the bits of an RDBMS, what do you actually gain? Speed. Is the InnoDB storage engine that much superior compared to other products? InnoDB is faster than MySQL over InnoDB.
10.
by quassnoi 16y ago
This is a single-value KVS within a field, not a replacement for SQL. You still need to write an SQL statement to access it.
11.
by quassnoi 16y ago
InnoDB was initially designed as a KVS. MySQL only added the SQL frontend to it. Initially, MySQL also supported BerkeleyDB, another KVS, but as for now they dropped the support. From InnoDB's point of view, MySQL is just a client, as is Ha
12.
by quassnoi 16y ago
All major engines have collations and collation-specific behavior (which can be confusing). However, this one I saved for the next post (with another set of completely unrelated pictures).
13.
by quassnoi 16y ago
All "wrong" queries are wrong in PostgreSQL as well (and #3 won't even parse). The workarounds for #4, #3 and #2 are different for PostgreSQL, the others will work.
14.
by quassnoi 16y ago
This is very often "expected to work". Just search StackOverflow for FIND_IN_SET. Here are just three random hits: http://stackoverflow.com/questions/4037145/mysql-how-to-sele... http://stackoverflow.com/questions/3946831/mysql-where-pro
15.
by quassnoi 16y ago
> He's cheating a bit. He created two tables each with 1 million rows, offset by 999,000. (i.e. 1 - 1,000,000 and 999,000 - 1,999,000) Of course this is cheating, but only to demonstrate the point :) > But this is very unlikely in t
16.
by quassnoi 16y ago
Unfortunately, with a B+Tree index, you cannot jump in powers of 2 (well, you can but only within one page). To find a record with a given offset you'd need to traverse the whole linked list of the leaf-level pages, and that's what MERGE JO
17.
by quassnoi 17y ago
I'm currently #26 on the rep list and I am employed (which means there is a workplace I have to go to every day and be there during the business hours). I cannot tell much about my current job's details (I'm bound by an NDA), but mostly it
18.
by quassnoi 17y ago
Thanks!
19.
by quassnoi 17y ago
Hi, I'm the author of the blog. Actually, most askers (both on Stack Overflow and on the site) are either the ORM developers or the people who need to deal with huge volumes of data (financial reports etc). As with every other abstracting t