Research note
On performing robust order statistics in tree-structured dictionary machines

https://doi.org/10.1016/0743-7315(90)90113-4Get rights and content
Under a Creative Commons license
open access

Abstract

We show how to extend any tree-structured dictionary machine so that it can perform order statistics robustly. In particular, we consider how to allow for redundant insertions, deletions, and updates, as well as operations based on the ranks of data items, such as Extract (j), which simultaneously selects and deletes the jth smallest data item. All these operations can be performed without ever interrupting the pipelining of responses coming from the machine, and the resulting machine has the same interval time and latency time performance as the original design, to within constant factors.

Cited by (0)

This author's research was supported by a grant from the Sperry Corp., by a David Ross Grant from the Purdue Research Foundation, and by the National Science Foundation under Grant CCR-8810568.

This author's research was supported by the Office of Naval Research under Grants N00014-84-K-0502 and N00014-86-K-0689, and by the National Science Foundation under Grant DCR-8451393, with matching funds from AT&T.