15 Commits (bb62899db57cde576a1250a793e4e00a1121bbde)

Author	SHA1	Message	Date
Bruce Momjian	bb62899db5	Done: ... < * Improve SMP performance on i386 machines > * -Improve SMP performance on i386 machines	21 years ago
Bruce Momjian	95c7bff47c	Done: ... < * Optimize locale to have minimal performance impact when not used	21 years ago
Bruce Momjian	9ff49665ce	Fix typo: ... < * Add ISo INTERVAL handling > * Add ISO INTERVAL handling	21 years ago
Bruce Momjian	48e7a196ea	Done: ... > * -Allow non-bitmap indexes to be combined by creating bitmaps in memory	21 years ago
Bruce Momjian	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.	21 years ago
Bruce Momjian	8f4a1b3e84	Update URL for TODO list.	21 years ago
Bruce Momjian	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.	21 years ago
Bruce Momjian	631e03145f	Done: ... < * Add tool to query pg_stat_* tables and report indexes that aren't needed < or tables that might need indexes	21 years ago
Bruce Momjian	de4fbfadc5	Add: ... > * Add tool to query pg_stat_* tables and report indexes that aren't needed > or tables that might need indexes	21 years ago
Bruce Momjian	e5c7c05168	Add: ... > * Log queries where the optimizer row estimates were dramatically > different from the number of rows actually found (?)	21 years ago
Bruce Momjian	047b8a71d1	Add: ... > * All ability to monitor the use of temporary sort files	21 years ago
Bruce Momjian	8023b7fa5a	Add WAL entry about compression.	21 years ago
Bruce Momjian	01979d1bd5	Update PITR setence to mention WAL and file system dump.	21 years ago
Bruce Momjian	54fe332776	Update TODO script sample.	21 years ago
Bruce Momjian	c68f6d7963	Add HTML version of TODO to CVS, for web site use.	21 years ago