hi, i'm new to PostgreSQL and have just been briefly reading the feature
list. i think i remember seeing somewhere that PostgreSQL can index
using the B-Tree. does this literally mean the original B-Tree? or is
it a variation such as B+Tree or B*Tree? the reason i ask is that i
need sequential access to the data as provided by the B+Tree. (that has
all the data in the leaves and has links between the leaves.) thank you.
--
Xiaolei Li | xli10@uiuc.edu | www.xiaolei.org
