aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAge
...
* 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.
* Minor performance improvement: avoid unnecessary creation/unioning ofTom Lane2005-04-20
| | | | | bitmaps for multiple indexscans. Instead just let each indexscan add TIDs directly into the BitmapOr node's result bitmap.
* Add:Bruce Momjian2005-04-20
| | | | | > * Add tool to query pg_stat_* tables and report indexes that aren't needed > or tables that might need indexes
* Add:Bruce Momjian2005-04-20
| | | | | > * Log queries where the optimizer row estimates were dramatically > different from the number of rows actually found (?)
* Add:Bruce Momjian2005-04-20
| | | | > * All ability to monitor the use of temporary sort files
* Create executor and planner-backend support for decoupled heap and indexTom Lane2005-04-19
| | | | | | | | | scans, using in-memory tuple ID bitmaps as the intermediary. The planner frontend (path creation and cost estimation) is not there yet, so none of this code can be executed. I have tested it using some hacked planner code that is far too ugly to see the light of day, however. Committing now so that the bulk of the infrastructure changes go in before the tree drifts under me.
* Add comment about permissions on pg_ts* tablesTeodor Sigaev2005-04-19
|
* >>>>Luckily, PG 8 is available for this. Do you have a short example?Bruce Momjian2005-04-19
| | | | | | | | | | | | | | | >>> >>>No, and I think it should be in the manual as an example. >>> >>>You will need to enter a loop that uses exception handling to detect >>>unique_violation. >> >>Pursuant to an IRC discussion to which Dennis Bjorklund and >>Christopher Kings-Lynne made most of the contributions, please find >>enclosed an example patch demonstrating an UPSERT-like capability. >> David Fetter
* > >Luckily, PG 8 is available for this. Do you have a short example?Bruce Momjian2005-04-19
| | | | | | | | | | | | | | > > No, and I think it should be in the manual as an example. > > You will need to enter a loop that uses exception handling to detect > unique_violation. Pursuant to an IRC discussion to which Dennis Bjorklund and Christopher Kings-Lynne made most of the contributions, please find enclosed an example patch demonstrating an UPSERT-like capability. David Fetter
* The following patch should allow UPDATE_INTERVAL to be specified on theBruce Momjian2005-04-19
| | | | | | | | | | | | | | | command line. We find this useful because we frequently deal with thousands of tables in an environment where neither the databases nor the tables are updated frequently. This helps allow us to cut down on the overhead of updating the list for every other primary loop of pg_autovacuum. I chose -i as the command-line argument and documented it briefly in the README. The patch was applied to the 7.4.7 version of pg_autovacuum in contrib. Thomas F.O'Connell
* Attached patch gets rid of the global timezone in the following steps:Bruce Momjian2005-04-19
| | | | | | | | | | | | | | | | | | | | | | | | | | | | * Changes the APIs to the timezone functions to take a pg_tz pointer as an argument, representing the timezone to use for the selected operation. * Adds a global_timezone variable that represents the current timezone in the backend as set by SET TIMEZONE (or guc, or env, etc). * Implements a hash-table cache of loaded tables, so we don't have to read and parse the TZ file everytime we change a timezone. While not necesasry now (we don't change timezones very often), I beleive this will be necessary (or at least good) when "multiple timezones in the same query" is eventually implemented. And code-wise, this was the time to do it. There are no user-visible changes at this time. Implementing the "multiple zones in one query" is a later step... This also gets rid of some of the cruft needed to "back out a timezone change", since we previously couldn't check a timezone unless it was activated first. Passes regression tests on win32, linux (slackware 10) and solaris x86. Magnus Hagander
* Update PITR wording, per Simon.Bruce Momjian2005-04-19
|
* pg_dumpall should enforce the server version check for itself, ratherTom Lane2005-04-18
| | | | | than simply passing it down to pg_dump. Else, version-related failures in pg_dumpall itself generate unhelpful error messages.
* Add WAL entry about compression.Bruce Momjian2005-04-18
|
* Added to TODO:Bruce Momjian2005-04-18
| | | | > * Compress WAL entries [wal]
* Update PITR setence to mention WAL and file system dump.Bruce Momjian2005-04-18
|
generated by cgit v1.2.3 (git 2.25.1) at 2025-08-06 05:33:31 +0000