Hi!
Any ideas on how you can create an index for something like this?:
....
abs(to_number(a.date) - (to_number(b.date)) < 2

Any ideas on how you could use berkeley-db to seach in this manner that
is not of Order(N x N)?

Thanks
E

Hi,

I'm not entirely sure that I understand your question, but how about
creating a btree secondary using the date as a key. Either encode the
date so that it is in sorted order or supply a key comparator.

Then for a given item (with known date), you can look up the date index
and scan up and down until you reach the distance limits.

Would that do what you want?

Michael.

I will probably do something similar. I am going to have two index
databases, one for table/database A and B. I then want to find all
possible records where this condition is true:
abs(to_number(a.data) - (to_number(b.data)) < 2
I will put all records where this condition is true into a new
table/database. Table A and B could potentially have millions of
records. I was just curious to see if anyone had any good ideas for
solving this problem using berkeley. (i.e. Ideas to speed up
performance/comparisons/IO)
Thanks