On Wed, 19 May 1999, Allan Greenier wrote: > The engine will search a list that looks like this: > ("Data<TAB>Data<TAB>Data<TAB>Data","Data<TAB>Data<TAB>Data<TAB>Data"). > This list will be 500 items long. Sometimes it needs to search in the > first item, sometimes the others. Usually only one item. With search my first question always is, is the list (the data) dynamic or static? A reasonably static list gives you the opportunity to build an index. If not, hashes, I think, are the way to go. If there is no obvious key then make one. Can you post a typical row? Arved ===== Want to unsubscribe from this list? ===== Send mail with body "unsubscribe" to macperl-request@macperl.org