Re: B+ versus hash maps

Поиск
Список
Период
Сортировка
Искать
От
Jim Nasby
Тема
Re: B+ versus hash maps
Дата
Msg-id
3A3631F2-86C9-43D5-BBC1-9D2E797B8CA6@pervasive.com
Ответ на
B+ versus hash maps (surabhi.ahuja)
Список
Дерево обсуждения
Re: B+ versus hash maps "surabhi.ahuja" <surabhi.ahuja@iiitb.ac.in>
Re: B+ versus hash maps Ragnar <gnari@hive.is>
Re: B+ versus hash maps Jim Nasby <jnasby@pervasive.com>
On Jun 15, 2006, at 8:07 AM, surabhi.ahuja wrote:

> is there any way of specifying wht type of index i want, say hash  
> maps instead of the B+ trees.
> someone told me that in the case where duplicates occur(on the  
> indexed field), hash map are better than B+ trees.

http://www.postgresql.org/docs/8.1/interactive/sql-createindex.html

> and also please tell if i can assume that it will use index only  
> and not go for sequential scan,
> again i was told for that i ll have to set the random page cost  
> parameter to 1.

The database will use whatever it thinks is optimal. Use explain  
analyze to see what it's doing.

Unless your database fits (and stays) entirely in memory, you'll  
probably be pretty unhappy with random_page_cost=1.
--
Jim C. Nasby, Sr. Engineering Consultant      jnasby@pervasive.com
Pervasive Software      http://pervasive.com    work: 512-231-6117
vcard: http://jim.nasby.net/pervasive.vcf       cell: 512-569-9461


В списке pgsql-general по дате отправления
От: Shoaib Mir
Дата:
Сообщение: Re: query optimizer
От: Jim Nasby
Дата:
FAQ