ARCHIE

Section: User Commands (1)
Updated: 20 August 1991
Index Return to Main Contents

NAME

archie - query archie anonymous ftp databases using Prospero

SYNOPSIS

archie [ -cers ] [ -l ] [ -t ] [ -m # ] [ -N # ] [ -h host ] string

DESCRIPTION

archie queries an archie anonymous ftp database looking for the specified string using the Prospero protocol. This client is based on Prospero version Beta.4.2.

The general method of use is

: % archie string

For example,

: % archie emacs

will find all anonymous FTP sites in the archie database that have the word emacs included in filenames in their system's FTP area. Regular expressions, such as

: % archie -r '[xX][lL]isp'

may also be used for searches. (See the manual of a reasonably good editor, like GNU Emacs or vi, for more information on using regular expressions.)

OPTIONS

The options currently available to this archie client are:

-c: Search substrings paying attention to upper & lower case.
-e: Exact string match. (This is the default.)
-r: Search using a regular expression.
-s: Search substrings ignoring the case of the letters.
-l: Output results in a form suitable for parsing by programs.
-t: Sort the results inverted by date.
-m number: Specifies the maximum number of hits (matches) to return. By default, this value is 95.
-N#: Sets the "niceness" of a query; by default, it's set to 0. Without an argument, -N defaults to 35765. If you use -N with an argument between 0 and 35765, it'll adjust itself accordingly.
-h host: Tells the client to query the Archie server named host.

QUERY PRIORITY

Please use the -N option whenever you don't demand immediacy, or when you're requesting things that could generate large responses. Even when using the nice option, you should still try to avoid big jobs during busy periods. Here is a list of what we consider to be nice values that accurately reflect the priority of a job to the server.

Normal: 0
Nice: 500
Nicer: 1000
Very Nice: 5000
Extremely Nice: 10000
Nicest: 32765

The last priority, Nicest, would be used when a job should wait until the queue is essentially empty before running. You should pick one of these values to use, possibly modifying it slightly depending on where you think your priority should land. For example, 32760 would mean wait until the queue is empty, but jump ahead of other jobs that have selected Nicest.

There are certain types of things that we suggest using Nicest for, irregardless. In particular, any searches for which you would have a hard time justifying the use of anything but extra resources. (We all know what those searches would be for.)

NOTES

The three search-modifying arguments (-c, -r, and -s) are all mutually exclusive; only the last one counts. If you specify -e with any of -c, -r, or -s, the server will first check for an exact match, then fall back to the case-sensitive, case-insensitive, or regular expression search. This is so if there are matches that are particularly obvious, it will take a minimal amount of time to satisfy your request.

If you list a single `-' by itself, any further arguments will be taken as part of the search string. This is intended to enable searching for strings that begin with a `-'; for example:

: % archie -s - -old

will search for all filenames that contain the string `-old' in them.

RESPONSE

Archie servers are set up to respond to a number of requests in a queued fashion. That is, smaller requests get served much more quickly than do large requests. As a result, the more often you query the Archie server, or the larger your requests, the longer the queue will become, resulting in a longer waiting period for everyone's requests. Please be frugal when possible, for your benefit as well as for the other users.

AUTHORS

The archie service was conceived and implemented by Alan Emtage (bajan@cs.mcgill.ca) and Peter Deutsch (peterd@cs.mcgill.ca). The entire Internet is in their debt.

The Prospero system was created by Clifford Neuman (bcn@isi.edu); write to info-prospero@isi.edu for more information on the protocol and its use.

This stripped client was put together by Brendan Kehoe (brendan@cs.widener.edu), with modifications by Clifford Neuman and George Ferguson (ferguson@cs.rochester.edu).

The man page was originally written by Jeff Kellem (composer@chem.bu.edu), and later modified by Brendan Kehoe.

BUGS

Fewer than last time.

This document was created by man2html, using the manual pages.
Time: 21:53:07 GMT, February 02, 2023