aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAge
...
* Add line break.Bruce Momjian2005-04-24
|
* Update book items.Bruce Momjian2005-04-24
|
* Update VACUUM VERBOSE FSM message, per Tom.Bruce Momjian2005-04-24
|
* Repair two TIME WITH TIME ZONE bugs found by Dennis Vshivkov. ComparisonTom Lane2005-04-23
| | | | | | | of timetz values misbehaved in --enable-integer-datetime cases, and EXTRACT(EPOCH) subtracted the zone instead of adding it in all cases. Backpatch to all supported releases (except --enable-integer-datetime code does not exist in 7.2).
* Remove useless argtype_inherit() code, and make consequent simplifications.Tom Lane2005-04-23
| | | | | | | | | As I pointed out a few days ago, this code has failed to do anything useful for some time ... and if we did want to revive the capability to select functions by nearness of inheritance ancestry, this is the wrong place and way to do it anyway. The knowledge would need to go into func_select_candidate() instead. Perhaps someday someone will be motivated to do that, but I am not today.
* Turns out our existing page size is already optimal in most cases:Bruce Momjian2005-04-23
| | | | < * Research the use of larger page sizes
* Item already added to existing 'thread' item:Bruce Momjian2005-04-23
| | | | | | | | | | < * Consider parallel processing a single query < < This would involve using multiple threads or processes to do optimization, < sorting, or execution of single query. The major advantage of such a < feature would be to allow multiple CPUs to work together to process a < single query. <
* Remove item, not sure what it refers to:Bruce Momjian2005-04-23
| | | | | | | | | < * 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. <
* New item:Bruce Momjian2005-04-23
| | | | > * Change WAL to use 32-bit CRC, for performance reasons
* Update threading item:Bruce Momjian2005-04-23
| | | | | | < 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.
* Done:Bruce Momjian2005-04-23
| | | | | < * Improve SMP performance on i386 machines > * -Improve SMP performance on i386 machines
* Remove explicit FreeExprContext calls during plan node shutdown. TheTom Lane2005-04-23
| | | | | | | | | | | | 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.
* Done:Bruce Momjian2005-04-23
| | | | < * Optimize locale to have minimal performance impact when not used
* Fix typo:Bruce Momjian2005-04-23
| | | | | < * Add ISo INTERVAL handling > * Add ISO INTERVAL handling
* Update VACUUM VERBOSE update, per Alvaro.Bruce Momjian2005-04-23
|
* Update working of VACUUM VERBOSE.Bruce Momjian2005-04-23
|
* Make VACUUM VERBOSE FSM output all output in a single INFO outputBruce Momjian2005-04-23
| | | | statement.
* Move info about lack of depencency checking in Makefiles to developer's faq.qBruce Momjian2005-04-23
|
* Update FAQ by eliminating non-frequent items like large objects andBruce Momjian2005-04-23
| | | | extending questions. Update wording of various entries.
* Done:Bruce Momjian2005-04-23
| | | | > * -Allow non-bitmap indexes to be combined by creating bitmaps in memory
* Update H4 tag to H3 to be consistent with heading levels.Bruce Momjian2005-04-23
|
* Add item about server-side debugging.Bruce Momjian2005-04-23
|
* Update FAQ items to point to existing web pages rather than duplicationBruce Momjian2005-04-23
| | | | | such information. Remove MySQL mention. Move server-side debug item to developer's FAQ. Update URLs.
* Add comment about checkpoint panic behavior during shutdown, perTom Lane2005-04-23
| | | | suggestion from Qingqing Zhou.
* Allow -2147483648 to be treated as an INT4 rather than INT8 constant.Tom Lane2005-04-23
| | | | Per discussion with Paul Edwards.
* Treat a zero-D array as empty in int_enum(), per Andrew@supernews.Tom Lane2005-04-23
|
* Recent changes got the sense of the notnull bit backwards in the 2.0Tom Lane2005-04-23
| | | | protocol output routines. Mea culpa :-(. Per report from Kris Jurka.
* Define the right-hand input of AT TIME ZONE as a full a_expr instead ofTom Lane2005-04-23
| | | | | | | | 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.
* Update FAQ release number to 8.0.2.Bruce Momjian2005-04-23
|
* Modify output of VACUUM VERBOSE to be clearer.Bruce Momjian2005-04-23
|
* int_aggregate's int_enum() doesn't work correctly with arrays thatTom Lane2005-04-23
| | | | | aren't 1-D, so give an error message instead of failing. Per report from Ron Mayer.
* Turns out that my recent elimination of the 'redundant' flatten_andors()Tom Lane2005-04-23
| | | | | | | | 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.
* Add documentation stating how to determine if FSM settings are too lowBruce Momjian2005-04-23
| | | | --- look at a database-wide VACUUM VERBOSE.
* Teach choose_bitmap_and() to actually be choosy --- that is, try toTom Lane2005-04-23
| | | | | | 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.
* Fix bogus EXPLAIN display of rowcount estimates for BitmapAnd andTom Lane2005-04-23
| | | | BitmapOr nodes.
* First cut at planner support for bitmap index scans. Lots to do yet,Tom Lane2005-04-22
| | | | | | | | 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.
* Fix typo:Bruce Momjian2005-04-22
| | | | | | | | | | | | | | | < 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.
* Typo fix. Alvaro.Bruce Momjian2005-04-22
|
* Update URL for TODO list.Bruce Momjian2005-04-22
|
* Remove pre-7.3 mention that FOR UPDATE can be before LIMIT.Bruce Momjian2005-04-22
| | | | | Document that FOR UPDATE and LIMIT together can return fewer rows that LIMIT specifies, and why.
* Clarify that only crypt can't use md5 pg_shadow passwords.Bruce Momjian2005-04-22
|
* Clarify use of MD5 authentication and pg_shadow encryption.Bruce Momjian2005-04-21
|
* Rethink original decision to use AND/OR Expr nodes to represent bitmapTom Lane2005-04-21
| | | | | | | 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.
* Updated text for bitmaps:Bruce Momjian2005-04-21
| | | | | | | | | | | | | | | | | | | < 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.
* Done:Bruce Momjian2005-04-21
| | | | | < * Add tool to query pg_stat_* tables and report indexes that aren't needed < or tables that might need indexes
* Install some slightly realistic cost estimation for bitmap index scans.Tom Lane2005-04-21
|
* Make pg_ctl status do a kill() test to verify that the PID found inTom Lane2005-04-20
| | | | postmaster.pid still represents a live postmaster.
* Add note clarifying that indexes that support ordered scans had betterTom Lane2005-04-20
| | | | allow clauseless scans.
* Don't try to run clauseless index scans on index types that don't supportTom Lane2005-04-20
| | | | it. Per report from Marinos Yannikos.
* Fix mis-display of negative fractional seconds in interval values forTom Lane2005-04-20
| | | | --enable-integer-datetimes case. Per report from Oliver Siegmar.
generated by cgit v1.2.3 (git 2.25.1) at 2025-07-31 01:38:08 +0000