OpenEuphoria

Re: database theory

• Posted by Alan Tu <ATU5713 at COMPUSERVE.COM> Nov 22, 1998
• 774 views

>>>>>
Load and sort the index file. Then you can do a binary lookup
in the index file which will take only a maximimum of
8 tries to find anyone, regardless of how long the list
is. Many commercial databases use such a method (multiple
index files)
<<<<<

I hope I'm not causing too much trouble, but I don't get it.  Presumably
I've have something like this:

{
{"name1",location1}
{"name2",location2}
{"name3",location3}
}

What to you mean by sorting and binary lookup?

Alan
 =