A couple days ago Devrim forked PostgreSQL to get a beer.
That effort is of course laudable, but a bit extreme.
PostgreSQL is very extensible, and allows to implement a beer now clock with just a few easy steps.
A couple days ago Devrim forked PostgreSQL to get a beer.
That effort is of course laudable, but a bit extreme.
PostgreSQL is very extensible, and allows to implement a beer now clock with just a few easy steps.
In a customer project I have to setup a database from a Makefile. Part of my problem: on Windows the installer may or may not install plpgsql into template1, therefore in consequence this language may or may not be activated in every new database. But that’s not predictable. This problem can appear on different Linux/Unix distributions too.
On a student platform we show, on every page, a random user in the upper right corner. Because we have over 11.000 users, the database has to select all matching users and sort them by random(). Thats very expensive and one of the longest running queries in the current version. And because we are currently redeveloping the whole platform, I decided to try something different for the random user. The user must not be really random, it should be enough to just display a different user every time the page is displayed. My idea was to implement a ringbuffer in SQL and forward the pointer to the next user in the buffer if we need to search the next random user.