Skip to content
Snippets Groups Projects
  1. Apr 23, 2005
  2. Apr 22, 2005
    • Bruce Momjian's avatar
      Fix typo: · ccbb07d9
      Bruce Momjian authored
      <   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.
      ccbb07d9
    • Bruce Momjian's avatar
      Update URL for TODO list. · 8f4a1b3e
      Bruce Momjian authored
      8f4a1b3e
  3. Apr 21, 2005
    • Bruce Momjian's avatar
      Updated text for bitmaps: · c6221db3
      Bruce Momjian authored
      <   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.
      c6221db3
    • Bruce Momjian's avatar
      Done: · 631e0314
      Bruce Momjian authored
      < * Add tool to query pg_stat_* tables and report indexes that aren't needed
      <   or tables that might need indexes
      631e0314
  4. Apr 20, 2005
    • Bruce Momjian's avatar
      Add: · de4fbfad
      Bruce Momjian authored
      > * Add tool to query pg_stat_* tables and report indexes that aren't needed
      >   or tables that might need indexes
      de4fbfad
    • Bruce Momjian's avatar
      Add: · e5c7c051
      Bruce Momjian authored
      > * Log queries where the optimizer row estimates were dramatically
      >   different from the number of rows actually found (?)
      e5c7c051
    • Bruce Momjian's avatar
      Add: · 047b8a71
      Bruce Momjian authored
      > * All ability to monitor the use of temporary sort files
      047b8a71
  5. Apr 18, 2005
  6. Mar 15, 2005
  7. Mar 14, 2005
  8. Mar 13, 2005
  9. Mar 11, 2005
  10. Mar 08, 2005
  11. Feb 25, 2005
  12. Feb 21, 2005
  13. Feb 15, 2005
  14. Feb 11, 2005
  15. Feb 02, 2005
  16. Feb 01, 2005
Loading