Barry Steven Perlman

US Patent:

20110246503, Oct 6, 2011

Filed:

Apr 6, 2010

Appl. No.:

12/755391

Inventors:

Michael A. Bender - Syosset NY, US
Martin Farach-Colton - New York NY, US
Yonatan R. Fogel - Port Jefferson NY, US
Zardosht Kasheff - New York NY, US
Bradley C. Kuszmaul - Lexington MA, US
Vincenzo Liberatore - University Heights OH, US
Barry Perlman - Cambridge MA, US
Rich Prohaska - Westford MA, US
David S. Wells - Waterville VT, US

International Classification:

G06F 17/30

US Classification:

707769, 707797, 707E17012

Abstract:

A method, apparatus and computer program product for storing data in a disk storage system is presented. A high-performance dictionary data structure is defined. The dictionary data structure is stored on a disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure. Updates run faster than one insertion per disk-head movement. The structure can also be stored on any system with two or more levels of memory. The dictionary is high performance and supports with full transactional semantics, concurrent access from multiple transactions, and logging and recovery. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk.

US Patent:

20150370860, Dec 24, 2015

Filed:

Feb 24, 2015

Appl. No.:

14/630579

Inventors:

- Durham NC, US
Martin Farach-Colton - New York NY, US
Yonatan R. Fogel - Port Jefferson NY, US
Zardosht Kasheff - New York NY, US
Bradley C. Kuszmaul - Lexington MA, US
Vincenzo Liberatore - University Heights OH, US
Barry Perlman - Cambridge MA, US
Rich Prohaska - Westford MA, US
David S. Wells - Waterville VT, US

Assignee:

Percona, LLC - Durham NC

International Classification:

G06F 17/30
G06F 9/54

Abstract:

A method, apparatus and computer program product for storing data in a disk storage system is presented. A high-performance dictionary data structure is defined. The dictionary data structure is stored on a disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure. Updates run faster than one insertion per disk-head movement. The structure can also be stored on any system with two or more levels of memory. The dictionary is high performance and supports with full transactional semantics, concurrent access from multiple transactions, and logging and recovery. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk.