Today another two new additions to PostgreSQL – as You can see may commit-fest seems to work pretty good 🙂
Continue reading Waiting for 8.4 – RETURN QUERY EXECUTE and cursor_tuple_fraction
Waiting for 8.4 – \o and \d+ in psql
Today, we have 2 new changes in psql. One of them is not actually new feature, but I decided to write about it anyway, because of its implications.
What does “success” mean to You?
Friend from my previous job asked this question: “What does success mean to You"?
One of the answers that I remember he got was:
“Get “brand recognition" of my name, and get a job with monthly salary of 40,000 PLN."
(I'm not sure if “brand recognition" is correct phrase – I mean that he wanted his name/person to be well known among people working in the same area as he is.
40,000 PLN – to give some perspective, is a bit over 10% of value of new Jaguar XK convertible (not XKR).
I would like to ask You, to tell me what does “success" mean to You. What would You have to achieve to feel successful.
Waiting for 8.4 – generate_subscripts
Yesterday, Alvaro Herrera committed patch written by Pavel Stehule which adds generate_subscripts(…) function.
Polish TSearch in 8.3 (polski tsearch w postgresie 8.3)
English disclaimer: this post will be in Polish only, as it's use for other nationalities is somehow limited 🙂
Continue reading Polish TSearch in 8.3 (polski tsearch w postgresie 8.3)
Waiting for 8.4 – “EXPLAIN VERBOSE”
Tom Lane committed his patch which modifies output of “EXPLAIN VERBOSE" command.
do you know crontab?
simple brainteaser. take no more than 30 seconds to think about it:
using standard cron installed on your unix system, how often would this command be run:
*/57 * * * * command
? if you choose to answer in comments, please supply version of cron that your system is using.
My take on trees in SQL
Quick note in polish: jeśli znasz moje poprzednie posty nt. drzew, to ten możesz sobie pewnie odpuścić. będzie zawierał jedynie opis implementacji zbliżony do tego co już jest dostępne.
OK, back to English (or at least my version of English).
Finding a good way to store trees in SQL was/is my long-term hobby. I tried ltree, basic adjacency list, Celko's nested sets way, and nothing really was able to make me feel satisfied.
Ltree is great, but PostgreSQL only (not that it's a big problem). Adjacency list is very simple in insert, update and delete operations, but forces me to use recursive queries in case of some not-so-standard queries. Nested sets are quite the contrary – great for selects, but I simply hate writing insert/update/delete to these trees.
Is there anything better? I think so.
postgresql @ highscalability.com
as you perhaps know there is this site/blog called high scalability. it contains articles about various things related to performance, scalability, availability and so on.
usually, when there is something about databases, it is about mysql. luckily for us, today they showed something about postgresql:
waiting for 8.4 – current_query()
unfrotunatelly i can't point you to message in archives, as there is some problem with them, and i dont see posts newer than “Fri Apr 04 12:00:08 2008".
this patch was written by tomas doran, and commited by bruce momjian: