Tom Lane d26559dbf3 Teach tuplesort.c about "top N" sorting, in which only the first N tuples ...

need be returned.  We keep a heap of the current best N tuples and sift-up
new tuples into it as we scan the input.  For M input tuples this means
only about M*log(N) comparisons instead of M*log(M), not to mention a lot
less workspace when N is small --- avoiding spill-to-disk for large M
is actually the most attractive thing about it.  Patch includes planner
and executor support for invoking this facility in ORDER BY ... LIMIT
queries.  Greg Stark, with some editorialization by moi.

2007-05-04 01:13:45 +00:00

..

allpaths.c

Some further performance tweaks for planning large inheritance trees that

2007-04-21 21:01:45 +00:00

clausesel.c

Some further performance tweaks for planning large inheritance trees that

2007-04-21 21:01:45 +00:00

costsize.c

Teach tuplesort.c about "top N" sorting, in which only the first N tuples

2007-05-04 01:13:45 +00:00

equivclass.c

Put back planner's ability to cache the results of mergejoinscansel(),

2007-01-22 20:00:40 +00:00

indxpath.c

Rewrite choose_bitmap_and() to make it more robust in the presence of

2007-04-17 20:03:03 +00:00

joinpath.c

Refactor planner's pathkeys data structure to create a separate, explicit

2007-01-20 20:45:41 +00:00

joinrels.c

Restructure code that is responsible for ensuring that clauseless joins are

2007-02-16 00:14:01 +00:00

Makefile

Refactor planner's pathkeys data structure to create a separate, explicit

2007-01-20 20:45:41 +00:00

orindxpath.c

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00

pathkeys.c

Avoid running build_index_pathkeys() in situations where there cannot

2007-04-15 20:09:28 +00:00

tidpath.c

Update CVS HEAD for 2007 copyright. Back branches are typically not

2007-01-05 22:20:05 +00:00