1
0
mirror of https://github.com/postgres/postgres.git synced 2025-06-30 21:42:05 +03:00
Commit Graph

4427 Commits

Author SHA1 Message Date
238fb0342e Update description:
< * Allow ORDER BY ... LIMIT 1 to select high/low value without sort or
> * Allow ORDER BY ... LIMIT # to select high/low value without sort or
868c868
<   Right now, if no index exists, ORDER BY ... LIMIT 1 requires we sort
>   Right now, if no index exists, ORDER BY ... LIMIT # requires we sort
870a871
>   MIN/MAX already does this, but not for LIMIT > 1.
2005-04-25 15:35:32 +00:00
61cf53516e Re-add item with better description:
> * Allow ORDER BY ... LIMIT 1 to select high/low value without sort or
>   index using a sequential scan for highest/lowest values
>
>   Right now, if no index exists, ORDER BY ... LIMIT 1 requires we sort
>   all values to return the high/low value.  Instead The idea is to do a
>   sequential scan to find the high/low value, thus avoiding the sort.
>
2005-04-25 13:03:37 +00:00
7a4c34c97c Add description for concurrent sequential scans:
>   One possible implementation is to start sequential scans from the lowest
>   numbered buffer in the shared cache, and when reaching the end wrap
>   around to the beginning, rather than always starting sequential scans
>   at the start of the table.
2005-04-25 01:42:41 +00:00
cdf39c7b61 Update wording:
<   This allows vacuum to reclaim free space without requiring
<   a sequential scan
>   This allows vacuum to target specific pages for possible free space
>   without requiring a sequential scan.
2005-04-24 12:39:07 +00:00
5131b5bc7a Update wording. 2005-04-24 12:01:32 +00:00
c1cc62f614 Clean up HTML. 2005-04-24 11:57:19 +00:00
7a35c637bc Add replication FAQ item. 2005-04-24 11:48:52 +00:00
a7f2a788ee Add line break. 2005-04-24 11:27:51 +00:00
6f8f0a9d7a Update book items. 2005-04-24 11:22:44 +00:00
ac8998f2e6 Turns out our existing page size is already optimal in most cases:
< * Research the use of larger page sizes
2005-04-23 21:45:28 +00:00
f4dcb52efe Item already added to existing 'thread' item:
< * 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.
<
2005-04-23 21:44:52 +00:00
6869683147 Remove item, not sure what it refers to:
< * 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.
<
2005-04-23 21:43:24 +00:00
1207d5b64e New item:
> * Change WAL to use 32-bit CRC, for performance reasons
2005-04-23 21:41:01 +00:00
e847558031 Update threading item:
<   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.
2005-04-23 21:39:27 +00:00
bb62899db5 Done:
< * Improve SMP performance on i386 machines
> * -Improve SMP performance on i386 machines
2005-04-23 21:38:42 +00:00
95c7bff47c Done:
< * Optimize locale to have minimal performance impact when not used
2005-04-23 21:25:49 +00:00
9ff49665ce Fix typo:
< * Add ISo INTERVAL handling
> * Add ISO INTERVAL handling
2005-04-23 21:22:55 +00:00
e8ad6d9666 Move info about lack of depencency checking in Makefiles to developer's faq.q 2005-04-23 20:52:32 +00:00
f7e514d010 Update FAQ by eliminating non-frequent items like large objects and
extending questions.  Update wording of various entries.
2005-04-23 20:51:44 +00:00
48e7a196ea Done:
> * -Allow non-bitmap indexes to be combined by creating bitmaps in memory
2005-04-23 19:13:40 +00:00
97a4dad35f Update H4 tag to H3 to be consistent with heading levels. 2005-04-23 18:59:17 +00:00
9f1e864d02 Add item about server-side debugging. 2005-04-23 18:57:46 +00:00
c34ea747a6 Update FAQ items to point to existing web pages rather than duplication
such information.  Remove MySQL mention.  Move server-side debug item to
developer's FAQ.  Update URLs.
2005-04-23 18:57:25 +00:00
0975b95bc3 Update FAQ release number to 8.0.2. 2005-04-23 15:22:56 +00:00
25434e32cb Add documentation stating how to determine if FSM settings are too low
--- look at a database-wide VACUUM VERBOSE.
2005-04-23 03:27:40 +00:00
ccbb07d922 Fix typo:
<   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.
2005-04-22 15:40:16 +00:00
6f61ddd40d Typo fix. Alvaro. 2005-04-22 15:32:58 +00:00
8f4a1b3e84 Update URL for TODO list. 2005-04-22 13:38:19 +00:00
d76f279a55 Remove pre-7.3 mention that FOR UPDATE can be before LIMIT.
Document that FOR UPDATE and LIMIT together can return fewer rows that
LIMIT specifies, and why.
2005-04-22 04:20:44 +00:00
26bb65df1e Clarify that only crypt can't use md5 pg_shadow passwords. 2005-04-22 04:18:58 +00:00
c82b895284 Clarify use of MD5 authentication and pg_shadow encryption. 2005-04-21 22:19:19 +00:00
14c7fba3f7 Rethink original decision to use AND/OR Expr nodes to represent bitmap
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.
2005-04-21 19:18:13 +00:00
c6221db3c0 Updated text for bitmaps:
<   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.
2005-04-21 15:20:39 +00:00
631e03145f Done:
< * Add tool to query pg_stat_* tables and report indexes that aren't needed
<   or tables that might need indexes
2005-04-21 04:09:34 +00:00
1c155c8dfb Add note clarifying that indexes that support ordered scans had better
allow clauseless scans.
2005-04-20 22:19:58 +00:00
de4fbfadc5 Add:
> * Add tool to query pg_stat_* tables and report indexes that aren't needed
>   or tables that might need indexes
2005-04-20 02:48:11 +00:00
e5c7c05168 Add:
> * Log queries where the optimizer row estimates were dramatically
>   different from the number of rows actually found (?)
2005-04-20 02:43:49 +00:00
047b8a71d1 Add:
> * All ability to monitor the use of temporary sort files
2005-04-20 01:17:34 +00:00
fa66de98a9 >>>>Luckily, PG 8 is available for this. Do you have a short example?
>>>
>>>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
2005-04-19 03:55:43 +00:00
bd32a25598 > >Luckily, PG 8 is available for this. Do you have a short example?
>
> 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
2005-04-19 03:37:20 +00:00
dd39dd232f Update PITR wording, per Simon. 2005-04-19 01:39:50 +00:00
8023b7fa5a Add WAL entry about compression. 2005-04-18 18:30:56 +00:00
01979d1bd5 Update PITR setence to mention WAL and file system dump. 2005-04-18 17:40:40 +00:00
54fe332776 Update TODO script sample. 2005-04-18 14:44:04 +00:00
68d2f9283d Add description that WAL files used during backup have to be archived
before you are done.
2005-04-18 13:11:04 +00:00
c68f6d7963 Add HTML version of TODO to CVS, for web site use. 2005-04-18 12:58:45 +00:00
d755688f24 Update PITR mention of which WAL files are needed. 2005-04-18 01:29:00 +00:00
18b985055d Clarify name of file to be checked for PITR expiring. 2005-04-17 03:05:19 +00:00
85eee28cec Minor improvements to locale documentation. 2005-04-16 16:50:01 +00:00
7c13781ee7 First phase of project to use fixed OIDs for all system catalogs and
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.
2005-04-14 01:38:22 +00:00