| From: | Ants Aasma <ants(at)cybertec(dot)at> |
|---|---|
| To: | Adriano Lange <alange0001(at)gmail(dot)com> |
| Cc: | pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: SDP query optimizer |
| Date: | 2013-03-23 00:46:20 |
| Message-ID: | CA+CSw_vFE1_+Y0d2Pij10XcQg30kw3vyddyJayw4G8hYNhs3=g@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Sat, Mar 23, 2013 at 1:35 AM, Adriano Lange <alange0001(at)gmail(dot)com> wrote:
> I have developed a new query optimizer for PostgreSQL and I would like to
> share it with the community. The optimizer's name is Sampling and Dynamic
> Programming (SDP). I put it into a plugin developed some years ago, named
> LJQO:
>
> https://github.com/alange0001/ljqo.git
Looks great. Do you happen to have any papers or insight into why SDP
works as well as it does? It isn't immediately clear to me why the
cheapest left-deep tree is a good heuristic start point for the
dynamic programming phase.
Regards,
Ants Aasma
--
Cybertec Schönig & Schönig GmbH
Gröhrmühlgasse 26
A-2700 Wiener Neustadt
Web: http://www.postgresql-support.de
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Amit Kapila | 2013-03-23 01:50:52 | Re: Proposal for Allow postgresql.conf values to be changed via SQL [review] |
| Previous Message | Ants Aasma | 2013-03-23 00:27:38 | Re: Page replacement algorithm in buffer cache |