From 5344945810e32ab922096ede429e2087b5ae6edd Mon Sep 17 00:00:00 2001 From: Tom Lane Date: Fri, 20 Aug 2010 13:59:45 +0000 Subject: [PATCH] Avoid saying "random" when randomness is not actually meant. Per Thom Brown. --- doc/src/sgml/ddl.sgml | 4 ++-- doc/src/sgml/textsearch.sgml | 4 ++-- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/doc/src/sgml/ddl.sgml b/doc/src/sgml/ddl.sgml index 7e4726da35..1f96cd1eeb 100644 --- a/doc/src/sgml/ddl.sgml +++ b/doc/src/sgml/ddl.sgml @@ -1,4 +1,4 @@ - + Data Definition @@ -36,7 +36,7 @@ is fixed, and each column has a name. The number of rows is variable — it reflects how much data is stored at a given moment. SQL does not make any guarantees about the order of the rows in a - table. When a table is read, the rows will appear in random order, + table. When a table is read, the rows will appear in an unspecified order, unless sorting is explicitly requested. This is covered in . Furthermore, SQL does not assign unique identifiers to rows, so it is possible to have several completely diff --git a/doc/src/sgml/textsearch.sgml b/doc/src/sgml/textsearch.sgml index 7dd4a02378..fb7f205091 100644 --- a/doc/src/sgml/textsearch.sgml +++ b/doc/src/sgml/textsearch.sgml @@ -1,4 +1,4 @@ - + Full Text Search @@ -3270,7 +3270,7 @@ CREATE INDEX name ON table (PostgreSQL does this automatically when needed.) GiST indexes are lossy because each document is represented in the index by a fixed-length signature. The signature is generated by hashing - each word into a random bit in an n-bit string, with all these bits OR-ed + each word into a single bit in an n-bit string, with all these bits OR-ed together to produce an n-bit document signature. When two words hash to the same bit position there will be a false match. If all words in the query have matches (real or false) then the table row must be -- 2.40.0