Skip site navigation (1) Skip section navigation (2)

Re: RTREE Index on primary key generated by a sequence

From: Daniel Kalchev <daniel(at)digsys(dot)bg>
To: pgsql-hackers(at)postgresql(dot)org
Subject: Re: RTREE Index on primary key generated by a sequence
Date: 2002-01-25 15:58:28
Message-ID: 200201251558.RAA19302@dcave.digsys.bg (view raw or flat)
Thread:
Lists: pgsql-hackers
>>>Bruno Wolff III said:
 > The documentation gives the specific algorithms used:
 > The B-tree index is an implementation of Lehman-Yao high-concurrency
 >    B-trees. The R-tree index method implements standard R-trees using
 >    Guttman's quadratic split algorithm. The hash index is an
 >    implementation of Litwin's linear hashing. We mention the algorithms
 >    used solely to indicate that all of these access methods are fully
 >    dynamic and do not have to be optimized periodically (as is the case
 >    with, for example, static hash access methods).

I was under the impression that hash indexes were not recommended for 
concurrent updates etc?

Daniel


pgsql-hackers by date

Next:From: Hannu KrosingDate: 2002-01-25 16:03:27
Subject: Re: new module contrib/tree for 7.2 ?
Previous:From: Jean-Paul ARGUDODate: 2002-01-25 15:57:00
Subject: Fwd: Re: RTREE Index on primary key generated by a sequence

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group