On Fri, 11 Jan 2002, Martin Stricker wrote: > Just curious: Is there any method which is faster than a binary tree for > searching?
B-trees have a big-O of O(log n) which is pretty good, but hashes are better: big-0 of O(1). Theoretically you can't get faster than a hash for unordered searches. The issue comes in when you want ordered data, which is common in an SQL server. That's when you want a structure like a tree. - D <[EMAIL PROTECTED]>
