Routines.................................................................1984 52.2.1. FDW Routines For Scanning Foreign Tables ...............................................1985 52.2.2. FDW Routines For Updating ...............................................................................2000 54.3. Index Scanning ............................................................................................... specification either by scanning an available index that matches the specification, or by scanning the table in physical order and doing an explicit sort. For a query that requires scanning a large fraction of

Routines..........................................................1867 52.2.1. FDW Routines For Scanning Foreign Tables ........................................1867 52.2.2. FDW Routines For Updating Foreign Functions.........................................................................1882 54.3. Index Scanning ............................................................................................... specification either by scanning an available index that matches the specification, or by scanning the table in physical order and doing an explicit sort. For a query that requires scanning a large fraction of

...............................................................................1322 49.3. Index Scanning ............................................................................................... November 2009 are insecure when using SSL renegotiation, due to a vulnerability in the SSL protocol. As a stop-gap fix for this vulnerability, some vendors also shipped SSL libraries incapable of doing renegotiation bgwriter_lru_maxpages (integer) In each round, no more than this many buffers will be written as a result of scanning soon-to-be-recycled buffers. The default value is five buffers. This parameter can only be set in

.......................................................................1928 xxxii 52.3. Index Scanning ............................................................................................... specification either by scanning an available index that matches the specification, or by scanning the table in physical order and doing an explicit sort. For a query that requires scanning a large fraction of if there is an index matching the ORDER BY, the first n rows can be retrieved directly, without scanning the remainder at all. By default, B-tree indexes store their entries in ascending order with nulls

Functions.........................................................................1807 52.3. Index Scanning ............................................................................................... specification either by scanning an available index that matches the specification, or by scanning the table in physical order and doing an explicit sort. For a query that requires scanning a large fraction of if there is an index matching the ORDER BY, the first n rows can be retrieved directly, without scanning the remainder at all. By default, B-tree indexes store their entries in ascending order with nulls

...............................................................................1470 50.3. Index Scanning ............................................................................................... specification either by scanning any available index that matches the specification, or by scanning the table in physical order and doing an explicit sort. For a query that requires scanning a large fraction there is an index matching the ORDER BY then the first n rows can be retrieved directly, without scanning the remainder at all. By default, B-tree indexes store their entries in ascending order with nulls

...............................................................................1856 52.3. Index Scanning ............................................................................................... specification either by scanning an available index that matches the specification, or by scanning the table in physical order and doing an explicit sort. For a query that requires scanning a large fraction of if there is an index matching the ORDER BY, the first n rows can be retrieved directly, without scanning the remainder at all. By default, B-tree indexes store their entries in ascending order with nulls

Functions.........................................................................1384 50.3. Index Scanning ............................................................................................... specification either by scanning any available index that matches the specification, or by scanning the table in physical order and doing an explicit sort. For a query that requires scanning a large fraction there is an index matching the ORDER BY then the first n rows can be retrieved directly, without scanning the remainder at all. By default, B-tree indexes store their entries in ascending order with nulls

Functions.........................................................................1743 52.3. Index Scanning ............................................................................................... either by scanning an available index that matches the specification, or by scanning the table in physical order and doing an explicit sort. 285 Chapter 11. Indexes For a query that requires scanning a large if there is an index matching the ORDER BY, the first n rows can be retrieved directly, without scanning the remainder at all. By default, B-tree indexes store their entries in ascending order with nulls

...............................................................................1686 51.3. Index Scanning ............................................................................................... specification either by scanning an available index that matches the specification, or by scanning the table in physical order and doing an explicit sort. For a query that requires scanning a large fraction of if there is an index matching the ORDER BY, the first n rows can be retrieved directly, without scanning the remainder at all. By default, B-tree indexes store their entries in ascending order with nulls