- 24 4月, 2005 8 次提交
-
-
由 Bruce Momjian 提交于
< * 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. <
-
由 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
-
由 Bruce Momjian 提交于
< * Optimize locale to have minimal performance impact when not used
-
由 Bruce Momjian 提交于
< * Add ISo INTERVAL handling > * Add ISO INTERVAL handling
-
由 Bruce Momjian 提交于
> * -Allow non-bitmap indexes to be combined by creating bitmaps in memory
-
- 22 4月, 2005 2 次提交
-
-
由 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 提交于
-
- 21 4月, 2005 2 次提交
-
-
由 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
-
- 20 4月, 2005 3 次提交
-
-
由 Bruce Momjian 提交于
> * Add tool to query pg_stat_* tables and report indexes that aren't needed > or tables that might need indexes
-
由 Bruce Momjian 提交于
> * Log queries where the optimizer row estimates were dramatically > different from the number of rows actually found (?)
-
由 Bruce Momjian 提交于
> * All ability to monitor the use of temporary sort files
-
- 19 4月, 2005 2 次提交
-
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
- 18 4月, 2005 2 次提交
-
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-