WL#334: R-Trees for Multi-Key Indexes
Affects: Server-5.0 — Status: Un-Assigned — Priority: Medium
Requested by Monty. Entered by Tom. ----- Date: Mon, 26 Nov 2001 04:41:14 +0200 (EET) To: Alexander Barkov <firstname.lastname@example.org> Cc: email@example.com Subject: RTREE as a complex index Hi! >>>>> "Alexander" == Alexander Barkov <firstname.lastname@example.org> writes: Alexander> Hello! Alexander> By the way, it seems one RTREE index could be used not only Alexander> for spatial searches but also instead of several BTREE indexes. <cut> Alexander> CREATE INDEX u ON dialup (user,tm); Alexander> CREATE INDEX t ON dialup (tm,user); <cut> Alexander> Advantage: Alexander> We can build only one RTREE index instead of having many Alexander> BTREE indexes. This significantly reduces space usage. Alexander> Disadvantage: Alexander> RTREE theoretically should be slower than appropriative BTREE, Alexander> but I don't know how much :-) Alexander> What do you think? I think this is an exellent idea. We should consider implement this in the near future. Regards, Monty
Copyright (c) 2000, 2016, Oracle Corporation and/or its affiliates. All rights reserved.