Skip to content

P
Postgres FD Implementation
Commit 146aab49 authored by Teodor Sigaev's avatar Teodor Sigaev
Browse files
Options

Docs fix from Kris Jurka <books@ejurka.com>

parent ee2f149d
Show whitespace changes
Inline Side-by-side
Showing with 3 additions and 3 deletions
contrib/ltree/README.ltree
View file @ 146aab49
...@@ -146,9 +146,9 @@ INDICES ...@@ -146,9 +146,9 @@ INDICES
Various indices could be created to speed up execution of operations: Various indices could be created to speed up execution of operations:
* B-tree index over ltree: * B-tree index over ltree:
<, <=, =, =>, > <, <=, =, >=, >
* GiST index over ltree: * GiST index over ltree:
<, <=, =, =>, >, @>, <@, @, ~, ? <, <=, =, >=, >, @>, <@, @, ~, ?
Example: Example:
create index path_gist_idx on test using gist (path); create index path_gist_idx on test using gist (path);
* GiST index over ltree[]: * GiST index over ltree[]:
...@@ -500,7 +500,7 @@ GiST, which provides indexed access. ...@@ -500,7 +500,7 @@ GiST, which provides indexed access.
ltree: ltree:
For ltree we store LPS in a B-tree, implemented using GiST. Each node entry is 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 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. a tree using signature.
------------------------------------------------------------------------------- -------------------------------------------------------------------------------
We ask people who find the module useful to send us a postcards to: We ask people who find the module useful to send us a postcards to:
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment