From 146aab497e8b048f859ce0bd29e2d3c4fe876342 Mon Sep 17 00:00:00 2001 From: Teodor Sigaev Date: Mon, 26 Jan 2004 15:08:52 +0000 Subject: [PATCH] Docs fix from Kris Jurka --- contrib/ltree/README.ltree | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/contrib/ltree/README.ltree b/contrib/ltree/README.ltree index 249678147a..55b15d0f82 100644 --- a/contrib/ltree/README.ltree +++ b/contrib/ltree/README.ltree @@ -146,9 +146,9 @@ INDICES Various indices could be created to speed up execution of operations: * B-tree index over ltree: - <, <=, =, =>, > + <, <=, =, >=, > * GiST index over ltree: - <, <=, =, =>, >, @>, <@, @, ~, ? + <, <=, =, >=, >, @>, <@, @, ~, ? Example: create index path_gist_idx on test using gist (path); * GiST index over ltree[]: @@ -500,7 +500,7 @@ GiST, which provides indexed access. ltree: For ltree we store LPS in a B-tree, implemented using GiST. Each node entry is represented by (left_bound, signature, right_bound), so that we could speedup -operations <, <=, =, =>, > using left_bound, right_bound and prune branches of +operations <, <=, =, >=, > using left_bound, right_bound and prune branches of a tree using signature. ------------------------------------------------------------------------------- We ask people who find the module useful to send us a postcards to: -- 2.11.0