Tim Howes <tim@terminator.rs.itd.umich.edu> Mon, 29 March 1993 03:16 UTC

Message-Id: <9303290230.AA14485@terminator.rs.itd.umich.edu>
To: "Thomas J. Hacker" <hacker@citi.umich.edu>
Cc: osi-ds@cs.ucl.ac.uk
In-Reply-To: Your message of "Sat, 27 Mar 93 20:45:39 EST." <9303280202.AA24061@terminator.rs.itd.umich.edu>
Date: Sun, 28 Mar 93 21:30:45 -0500
Sender: ietf-archive-request@IETF.CNRI.Reston.VA.US
From: Tim Howes <tim@terminator.rs.itd.umich.edu>

> From:    Thomas "J." Hacker <hacker@citi.umich.edu>
> To:      osi-ds@cs.ucl.ac.uk

>   When a search goes down a tree, are all it's children tried concurrently, 
> or are they attempted one at a time? (i.e. does the parent query a child, wait
> until response, then query the next)?

There are two questions here.  One is how is the local database
searched, and two is how any remote parts are searched.  I can
tell you how quipu works.

In searching the local database, it depends on whether indexing
is used or not.  If indexing is used, the index is searched, for
any local results, then any nonlocal parts are chained off in
parallel.  If indexing is not used, the entries are searched
"linearly", with nonlocal searches chained off as they are encountered.

In either case, nonlocal parts of the database are searched in
parallel.  If you'd like to see this in action, you might try using
the "power searching" option of DE, the PARADISE DUA.     -- Tim

Tim Howes