qs - Interactively search a qddb Database for entries that contain all keys given on each line of input and print them to stdout.
qs RelationDirectory [-p|-n]
qs(1) searches for entries containing all keys given on a line of input. The -p option prints all tuples with matching keys to stdout. The -n option suppresses printing but instead prints the time required to perform the query in microseconds. The -n option is only supported on the Sequent Symmetry. The default is -p when neither option is specified. When finished, the user types control-D to exit the program. This program is roughly equivalent to the hunt(1) program in the Refer database suite.
qs exits with a 0 status on success, 1 otherwise.
Tuples are listed in raw internal qddb format. For most purposes, people should use qedit(1) l instead, because it provides the data in readable qddb format.
A Guide to QDDB
Eric H. Herrin II and Raphael A. Finkel
Qddb User's Guide
An ASCII Database for Fast Queries of Relatively Stable Data Eric H. Herrin II and Raphael A. Finkel Computing Systems, Volume 4 Number 2
University of California Press, Berkeley CA
Schema and Tuple Trees: An Intuitive Structure for Representing Relational Data
Eric H. Herrin, II and Raphael A. Finkel Computing Systems, Volume 9, Number 2
MIT Press, Cambridge MA
Table of Contents