Skip to content
Snippets Groups Projects
Commit e78e92e4 authored by Konstantin Osipov's avatar Konstantin Osipov
Browse files

Document that HASH indexes can be multi-part now.

parent a07b6e21
No related branches found
No related tags found
No related merge requests found
......@@ -55,7 +55,7 @@
</simpara>
<simpara>
Semantics of the match depends on the index.
A HASH and TREE index only supports exact match: all parts
A HASH index only supports exact match: all parts
of a key participating in the index must be provided.
In case of TREE index, only few parts of a key or a
key prefix are accepted for search.
......@@ -64,12 +64,10 @@
criteria.
</simpara>
<simpara>
A non-unique HASH index returns tuples in unspecified
order.
When a TREE index is not unique, or only part of a key
is given as a search criteria, matching tuples are
returned in ascending order.
BITSET indexes are always unique.
BITSET and HASH indexes are always unique.
</simpara>
</entry>
</row>
......
......@@ -94,8 +94,7 @@ please be aware of these restrictions:
dynamically, currently you need to restart the server even to
disable or enable a space,
</simpara></listitem>
<listitem><simpara>HASH indexes may cover only one field and can
not be non-unique.
<listitem><simpara>HASH indexes can not be non-unique.
</simpara></listitem>
</itemizedlist>
</para>
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment