Optomized Range Searching....
From: Art Pollard <pollarda_at_lextek.com>
Date: 14 Aug 2000 23:19:14 -0500
Message-ID: <0x3m5.17562$Mt4.1322494_at_sol.newscene.com>
Date: 14 Aug 2000 23:19:14 -0500
Message-ID: <0x3m5.17562$Mt4.1322494_at_sol.newscene.com>
I am wondering if there are any papers on ways to optomize range searching. (Specifically numerical range searching.) For example, if a database user requested all books under $100, it could make for a lot of traversing in the BTree or other index when you consider all decimal places that are possible.
I'd think by organizing numerical values into buckets or something simular it would be much faster.
Is anyone aware of any papers along these lines?
-Art Received on Tue Aug 15 2000 - 06:19:14 CEST