aboutsummaryrefslogtreecommitdiff
path: root/doc
Commit message (Collapse)AuthorAge
...
* 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
* 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
* 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.
* Update FAQ release number to 8.0.2.Bruce Momjian2005-04-23
|
* Add documentation stating how to determine if FSM settings are too lowBruce Momjian2005-04-23
| | | | --- look at a database-wide VACUUM VERBOSE.
* 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
* Add note clarifying that indexes that support ordered scans had betterTom Lane2005-04-20
| | | | allow clauseless scans.
* 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
* >>>>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
* Update PITR wording, per Simon.Bruce Momjian2005-04-19
|
* 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
|
* Update PITR TODO items:Bruce Momjian2005-04-18
| | | | | | | | | < failure. > failure. This could be triggered by a user command or a timer. < * Force archiving of partially-full WAL files when pg_stop_backup() is < called or the server is stopped > * Automatically force archiving of partially-filled WAL files when > pg_stop_backup() is called or the server is stopped
* Update TODO script sample.Bruce Momjian2005-04-18
|
* Update for HTML markup.Bruce Momjian2005-04-18
|
* Add description that WAL files used during backup have to be archivedBruce Momjian2005-04-18
| | | | before you are done.
* Add HTML version of TODO to CVS, for web site use.Bruce Momjian2005-04-18
|
* Add HTML TODO version to CVS.Bruce Momjian2005-04-18
|
* Add description about partial WAL archiving for PITR:Bruce Momjian2005-04-18
| | | | | | > > Doing this will allow administrators to know more easily when the > archive contins all the files needed for point-in-time recovery.
* Fix html.Bruce Momjian2005-04-18
|
* Test new html tag.Bruce Momjian2005-04-18
|
* Add:Bruce Momjian2005-04-18
| | | | | > * Force archiving of partially-full WAL files when pg_stop_backup() is > called or the server is stopped
* Update PITR mention of which WAL files are needed.Bruce Momjian2005-04-18
|
* Clarify name of file to be checked for PITR expiring.Bruce Momjian2005-04-17
|
* Minor improvements to locale documentation.Tom Lane2005-04-16
|
* DoneBruce Momjian2005-04-14
| | | | > * -Use indexes for MIN() and MAX()
* First phase of project to use fixed OIDs for all system catalogs andTom Lane2005-04-14
| | | | | | | | | | | | | | | | indexes. Extend the macros in include/catalog/*.h to carry the info about hand-assigned OIDs, and adjust the genbki script and bootstrap code to make the relations actually get those OIDs. Remove the small number of RelOid_pg_foo macros that we had in favor of a complete set named like the catname.h and indexing.h macros. Next phase will get rid of internal use of names for looking up catalogs and indexes; but this completes the changes forcing an initdb, so it looks like a good place to commit. Along the way, I made the shared relations (pg_database etc) not be 'bootstrap' relations any more, so as to reduce the number of hardwired entries and simplify changing those relations in future. I'm not sure whether they ever really needed to be handled as bootstrap relations, but it seems to work fine to not do so now.
* Simplify initdb-time assignment of OIDs as I proposed yesterday, andTom Lane2005-04-13
| | | | | | | | avoid encroaching on the 'user' range of OIDs by allowing automatic OID assignment to use values below 16k until we reach normal operation. initdb not forced since this doesn't make any incompatible change; however a lot of stuff will have different OIDs after your next initdb.
* Minor consistency improvement to the documentation on array functions.Neil Conway2005-04-13
|
* Add aggsortop column to pg_aggregate, so that MIN/MAX optimization canTom Lane2005-04-12
| | | | | | | | be supported for all datatypes. Add CREATE AGGREGATE and pg_dump support too. Add specialized min/max aggregates for bpchar, instead of depending on text's min/max, because otherwise the possible use of bpchar indexes cannot be recognized. initdb forced because of catalog changes.
generated by cgit v1.2.3 (git 2.25.1) at 2025-08-02 21:13:44 +0000