Abstract: In some implementations, a storage device may receive a set of access requests, the set of access request comprising a subset of the set of access requests that are associated with a data stream, the subset being associated with an amount of permissible delay for processing. The storage device may delay processing the subset of access requests based at least in part on the permissible delay and association with a data stream. The storage device may process the subset of access requests sequentially based at least in part on the delay.

Abstract: A combined hash table/bucket trie technique facilitates fast, deterministic, memory-efficient exact match look-ups on extremely large tables. A limited number of hash keys which collide on the same location can be stored in the hash table. If further keys collide on the same location, a bucket trie is formed, the colliding keys are stored in the trie, and trie traversal information is stored in the hash table. Regardless of the number of buckets in the trie, an input key need only be compared with the keys in one bucket to detect a stored key identical to the input key or conclude that no stored key is identical to the input key.