"Thomas J. Hacker" <hacker@citi.umich.edu> Sun, 28 March 1993 02:37 UTC
Received: from ietf.nri.reston.va.us by IETF.CNRI.Reston.VA.US id aa06786; 27 Mar 93 21:37 EST
Received: from CNRI.RESTON.VA.US by IETF.CNRI.Reston.VA.US id aa06782; 27 Mar 93 21:37 EST
Received: from haig.cs.ucl.ac.uk by CNRI.Reston.VA.US id aa20725; 27 Mar 93 21:37 EST
Received: from bells.cs.ucl.ac.uk by haig.cs.ucl.ac.uk with local SMTP id <g.00260-0@haig.cs.ucl.ac.uk>; Sun, 28 Mar 1993 02:52:46 +0100
Received: from citi.umich.edu by bells.cs.ucl.ac.uk with Internet SMTP id <g.18672-0@bells.cs.ucl.ac.uk>; Sun, 28 Mar 1993 02:46:03 +0100
Sender: ietf-archive-request@IETF.CNRI.Reston.VA.US
From: "Thomas J. Hacker" <hacker@citi.umich.edu>
To: osi-ds@cs.ucl.ac.uk
Date: Sat, 27 Mar 1993 20:45:39 -0500
Message-ID: <9303272137.aa20725@CNRI.Reston.VA.US>
Hello! 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)? (Sorry...this is with respect to QUIPU X.500 searches for a query) -Thanks! -Tom