Efficient Queries For Quasi-Ordered Databases
Victor Jon Griswold · Open Scholarship Institutional Repository (Washington University in St. Louis) · 1991
The problem of selecting database tuples is central to the task of resolving many forms of queries. The report defines a class of selection queries and presents a set of algorithms for their efficient resolution. The class of queries investigated is those queries which impose a quasi order on the tuples in a database.