From 2a0f262beff32ba86bcb58f3273214e5d0517c09 Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Tue, 14 May 2024 21:16:24 +0200 Subject: Merging upstream version 16.3. Signed-off-by: Daniel Baumann --- doc/src/sgml/html/gin-implementation.html | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'doc/src/sgml/html/gin-implementation.html') diff --git a/doc/src/sgml/html/gin-implementation.html b/doc/src/sgml/html/gin-implementation.html index b74ad9b..32b1d07 100644 --- a/doc/src/sgml/html/gin-implementation.html +++ b/doc/src/sgml/html/gin-implementation.html @@ -1,5 +1,5 @@ -70.4. Implementation
70.4. Implementation
Prev UpChapter 70. GIN IndexesHome Next

70.4. Implementation #

70.4.1. GIN Fast Update Technique
70.4.2. Partial Match Algorithm

+70.4. Implementation

70.4. Implementation
Prev UpChapter 70. GIN IndexesHome Next

70.4. Implementation #

70.4.1. GIN Fast Update Technique
70.4.2. Partial Match Algorithm

Internally, a GIN index contains a B-tree index constructed over keys, where each key is an element of one or more indexed items (a member of an array, for example) and where each tuple in a leaf @@ -61,4 +61,4 @@ index key, less than zero for a non-match that is still within the range to be searched, or greater than zero if the index key is past the range that could match. -

Prev Up Next
70.3. Extensibility Home 70.5. GIN Tips and Tricks
\ No newline at end of file +

Prev Up Next
70.3. Extensibility Home 70.5. GIN Tips and Tricks
\ No newline at end of file -- cgit v1.2.3