1
Alan Silverstein, William G Golson, Munir Mallal: Apparatus for parallel client/server communication having data structures which stored values indicative of connection state and advancing the connection state of established connections. Hewlett Packard Company, May 26, 1998: US05758084 (73 worldwide citation)

A method and apparatus establishes and manages a connection between a computer client system and each of a plurality of server computer systems in parallel. The method includes the steps of (a) providing a plurality of server system data structures, each of the plurality of server system data struct ...


2
Douglas L Baskins, Alan Silverstein: System for and method of cache-efficient digital tree with rich pointers. Hewlett Packard Development Company, December 30, 2003: US06671694 (39 worldwide citation)

An adaptive digital tree data structure incorporates a rich pointer object, the rich pointer including both conventional address redirection information used to traverse the structure and supplementary information used to optimize tree traversal, skip levels, detect errors, and store state informati ...


3
Douglas L Baskins, Alan Silverstein: System for and method of data compression in a valueless digital tree representing a bitset. Hewlett Packard Development Company, November 9, 2004: US06816856 (29 worldwide citation)

An adaptive digital tree data structure incorporates various codes within the parent pointers to indicate the state of the underlying subexpanses. The use of these codes reduces the amount of memory used in storage for the subexpanses and improves the overall efficiency of the system. The structure ...


4
Douglas L Baskins, Alan Silverstein: System and method of providing a cache-efficient, hybrid, compressed digital tree with wide dynamic ranges and simple interface requiring no configuration or tuning. Hewlett Packard Development Company, November 25, 2003: US06654760 (28 worldwide citation)

An adaptive digital tree data structure incorporates a rich pointer object, the rich pointer including both conventional address redirection information used to traverse the structure and supplementary information used to optimize tree traversal, skip levels, detect errors, and store state informati ...


5
Douglas L Baskins, Alan Silverstein: System for and method of efficient, expandable storage and retrieval of small datasets. Hewlett Packard Development Company, August 31, 2004: US06785687 (7 worldwide citation)

An adaptive digital tree data structure supports scalability by encoding type bits within unused data bits of the root pointer word or, as the population increases to support it, into an additional word. In both instances the type bits included in the word or additional word contain dataset-global d ...


6
Alan Silverstein, Esko Riikonen, Mikhail Pavlovich Yuryev, Vitaliy Grigoryevich Saenko, Yuriy Dmitrievch Gorodyskiy: Tower press filtering system. The Bethlehem Corporation, Rosenberg Klein & Lee, August 8, 2000: US06099725 (4 worldwide citation)

A tower press filtering system (1) is provided. System (1) includes a frame assembly (10) having at least one support engagement portion (14); a collapsible filter tower assembly (20) having a plurality of displaceable filter plate members (20); a press assembly (30) having a support plate member (3 ...


7
Douglas L Baskins, Alan Silverstein: System and method of providing a cache-efficient, hybrid, compressed digital tree with wide dynamic ranges and simple interface requiring no configuration or tuning. Hewlett Packard Company, March 27, 2003: US20030061227-A1

An adaptive digital tree data structure incorporates a rich pointer object, the rich pointer including both conventional address redirection information used to traverse the structure and supplementary information used to optimize tree traversal, skip levels, detect errors, and store state informati ...


8
Douglas L Baskins, Alan Silverstein: System for and method of data compression in a valueless digital tree representing a bitset. Hewlett Packard Company, March 27, 2003: US20030061189-A1

An adaptive digital tree data structure incorporates various codes within the parent pointers to indicate the state of the underlying subexpanses. The use of these codes reduces the amount of memory used in storage for the subexpanses and improves the overall efficiency of the system. The structure ...


9
Douglas L Baskins, Alan Silverstein: System for and method of efficient, expandable storage and retrieval of small datasets. Hewlett Packard Company, December 19, 2002: US20020194184-A1

An adaptive digital tree data structure supports scalability by encoding type bits within unused data bits of the root pointer word or, as the population increases to support it, into an additional word. In both instances the type bits included in the word or additional word contain dataset-global d ...


10
Douglas L Baskins, Alan Silverstein: System for and method of cache-efficient digital tree with rich pointers. Hewlett Packard Company, December 5, 2002: US20020184231-A1

An adaptive digital tree data structure incorporates a rich pointer object, the rich pointer including both conventional address redirection information used to traverse the structure and supplementary information used to optimize tree traversal, skip levels, detect errors, and store state informati ...