- 24 4月, 2005 21 次提交
-
-
由 Bruce Momjian 提交于
< * Allow ORDER BY ... LIMIT 1 to select high/low value without sort or < index using a sequential scan for highest/lowest values < < If only one value is needed, there is no need to sort the entire < table. Instead a sequential scan could get the matching value. <
-
由 Bruce Momjian 提交于
> * Change WAL to use 32-bit CRC, for performance reasons
-
由 Bruce Momjian 提交于
< Solaris) might benefit from threading. > Solaris) might benefit from threading. Also explore the idea of > a single session using multiple threads to execute a query faster.
-
由 Bruce Momjian 提交于
< * Improve SMP performance on i386 machines > * -Improve SMP performance on i386 machines
-
由 Tom Lane 提交于
ExprContexts will be freed anyway when FreeExecutorState() is reached, and letting that routine do the work is more efficient because it will automatically free the ExprContexts in reverse creation order. The existing coding was effectively freeing them in exactly the worst possible order, resulting in O(N^2) behavior inside list_delete_ptr, which becomes highly visible in cases with a few thousand plan nodes. ExecFreeExprContext is now effectively a no-op and could be removed, but I left it in place in case we ever want to put it back to use.
-
由 Bruce Momjian 提交于
< * Optimize locale to have minimal performance impact when not used
-
由 Bruce Momjian 提交于
< * Add ISo INTERVAL handling > * Add ISO INTERVAL handling
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
statement.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
extending questions. Update wording of various entries.
-
由 Bruce Momjian 提交于
> * -Allow non-bitmap indexes to be combined by creating bitmaps in memory
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
such information. Remove MySQL mention. Move server-side debug item to developer's FAQ. Update URLs.
-
由 Tom Lane 提交于
suggestion from Qingqing Zhou.
-
由 Tom Lane 提交于
Per discussion with Paul Edwards.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
protocol output routines. Mea culpa :-(. Per report from Kris Jurka.
-
由 Tom Lane 提交于
c_expr. Perhaps the restriction was once needed to avoid bison errors, but it seems to work just fine now --- and even generates a slightly smaller state machine. This change allows examples like SELECT '13:45'::timetz AT TIME ZONE '-07:00'::interval; to work without parentheses around the right-hand input.
-
- 23 4月, 2005 8 次提交
-
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Tom Lane 提交于
aren't 1-D, so give an error message instead of failing. Per report from Ron Mayer.
-
由 Tom Lane 提交于
code in prepqual.c had a small drawback: the flatten_andors code was able to cope with deeply nested AND/OR structures (like 10000 ORs in a row), whereas eval_const_expressions tends to recurse until it overruns the stack. Revise eval_const_expressions so that it doesn't choke on deeply nested ANDs or ORs.
-
由 Bruce Momjian 提交于
--- look at a database-wide VACUUM VERBOSE.
-
由 Tom Lane 提交于
make some estimate of which available indexes to AND together, rather than blindly taking 'em all. This could probably stand further improvement, but it seems to do OK in simple tests.
-
由 Tom Lane 提交于
BitmapOr nodes.
-
由 Tom Lane 提交于
but the code is basically working. Along the way, rewrite the entire approach to processing OR index conditions, and make it work in join cases for the first time ever. orindxpath.c is now basically obsolete, but I left it in for the time being to allow easy comparison testing against the old implementation.
-
- 22 4月, 2005 7 次提交
-
-
由 Bruce Momjian 提交于
< Currently indexes do not have enough tuple tuple visibility < information to allow data to be pulled from the index without < also accessing the heap. One way to allow this is to set a bit < to index tuples to indicate if a tuple is currently visible to < all transactions when the first valid heap lookup happens. This < bit would have to be cleared when a heap tuple is expired. > Currently indexes do not have enough tuple visibility information > to allow data to be pulled from the index without also accessing > the heap. One way to allow this is to set a bit to index tuples > to indicate if a tuple is currently visible to all transactions > when the first valid heap lookup happens. This bit would have to > be cleared when a heap tuple is expired.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
Document that FOR UPDATE and LIMIT together can return fewer rows that LIMIT specifies, and why.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Tom Lane 提交于
logic operations during planning. Seems cleaner to create two new Path node types, instead --- this avoids duplication of cost-estimation code. Also, create an enable_bitmapscan GUC parameter to control use of bitmap plans.
-
- 21 4月, 2005 4 次提交
-
-
由 Bruce Momjian 提交于
< Bitmap indexes index single columns that can be combined with other bitmap < indexes to dynamically create a composite index to match a specific query. < Each index is a bitmap, and the bitmaps are bitwise AND'ed or OR'ed to be < combined. They can index by tid or can be lossy requiring a scan of the < heap page to find matching rows, or perhaps use a mixed solution where < tids are recorded for pages with only a few matches and per-page bitmaps < are used for more dense pages. Another idea is to use a 32-bit bitmap < for every page and set a bit based on the item number mod(32). > This feature allows separate indexes to be ANDed or ORed together. This > is particularly useful for data warehousing applications that need to > query the database in an many permutations. This feature scans an index > and creates an in-memory bitmap, and allows that bitmap to be combined > with other bitmap created in a similar way. The bitmap can either index > all TIDs, or be lossy, meaning it records just page numbers and each > page tuple has to be checked for validity in a separate pass.
-
由 Bruce Momjian 提交于
< * Add tool to query pg_stat_* tables and report indexes that aren't needed < or tables that might need indexes
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
postmaster.pid still represents a live postmaster.
-