Jim C. Nasby wrote:
On Sun, Jun 25, 2006 at 08:04:18PM -0400, Luke Lonergan wrote:
Other DBMS have index organized tables that can use either hash or btree
organizations, both of which have their uses. We are planning to
implement btree organized tables sometime - anyone else interested in
this idea?
I'm curious how you'll do it, as I was once told that actually trying to
store heap data in a btree structure would be a non-starter (don't
remember why).
Ingres is now open source - they have clustering on btree/isam/hash
(it's called "modify table xx to btree on col1,col2")
Regards,
Kim
---------------------------(end of broadcast)---------------------------
TIP 9: In versions below 8.0, the planner will ignore your desire to
choose an index scan if your joining column's datatypes do not
match
