Simon Michael Meacham

Address:

3817 Mt Airy Dr, Mount Airy, MD 21771

Phone:

(650)2419582

VIN:

WAUKEAFMXBA155420

Make:

AUDI

Model:

A3

Year:

2011

US Patent:

6560599, May 6, 2003

Filed:

Jun 30, 1999

Appl. No.:

09/343625

Inventors:

Douglas S. Boa - Redmond WA
Simon M. Meacham - Redmond WA
Barry M. Nolte - Kirkland WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1730

US Classification:

707 7, 707100, 707101, 707102

Abstract:

A method, apparatus, software and data structure is disclosed for more efficient access times for linear operations in a hash table. A plurality of actual data records and a plurality of marker data records are inserted in a hash table using a hash function. The actual data records and marker data records have a logical ordering specified by a key and are threaded into the hash table to allow linear access by walking the hash table. The logical ordering of the actual data records and marker records is lost upon entry into the hash table, and the keys of the marker data records are distributed at known positions throughout the range of the keys of the actual data records. If when hashing a given key no record exists in the database for the given key, one of the keys for the marker data records are hashed to locate the associated marker data record in the hash table. Distribution of data records according to the hash function is also determined by locating a marker data record in the database and examining the position of adjacent records. The distribution of records provides a measure of performance of the hash table and for tuning of the hash table.

US Patent:

6957216, Oct 18, 2005

Filed:

Sep 16, 2002

Appl. No.:

10/244289

Inventors:

Douglas S. Boa - Redmond WA, US
Simon M. Meacham - Redmond WA, US
Barry M. Nolte - Kirkland WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F017/30

US Classification:

707 7, 707101

Abstract:

A method, apparatus, software and data structure is disclosed for more efficient access times for linear operations in a hash table, including finding the nearest logical record. A plurality of actual data records and a plurality of marker data records are inserted in a hash table using a hash function. The actual data records and marker data records have a logical ordering specified by a key and are threaded into the hash table to allow linear access by walking the hash table. The logical ordering of the actual data records and marker records is lost upon entry into the hash table, and the keys of the marker data records are distributed at known positions throughout the range of the keys of the actual data records. If when hashing a given key no record exists in the database for the given key, one of the keys for the marker data records are hashed to locate the associated marker data record in the hash table. A nearest logical record may thus be retrieved entering the hash table through the marker data record.

US Patent:

7120675, Oct 10, 2006

Filed:

Sep 26, 2000

Appl. No.:

09/670073

Inventors:

Richard M. Shupak - Bellevue WA, US
Barbara L. Kess - Redmond WA, US
Simon M. Meacham - Seattle WA, US
Pat Styles - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/16
G06F 15/173
G06F 9/44

US Classification:

709217, 709223, 709230, 717173

Abstract:

This present invention extends the mechanism for locating solution access information and then obtaining and implementing the correct solution for updating software programs. The user can communicate with one system on the network, tell it what the user is interested in, and then the system replies on a file by file basis where to locate the desired information. Thus, the user no longer has to register, e. g. in the environment variables, the individual paths for where a multitude of different applications find their additional related information on the network. According to the teachings of the present invention, a user will have to make basically zero changes to the system, and instead will automatically discover the name location of a server that is going to provide the user with the information associated with any user executable file. In particular, one embodiment of the present invention includes a computer implemented method. The method includes querying a first server for a location of a second server containing information associated with a local file.

US Patent:

6480858, Nov 12, 2002

Filed:

Jun 30, 1999

Appl. No.:

09/345176

Inventors:

Douglas S. Boa - Redmond WA
Simon M. Meacham - Redmond WA
Barry M. Nolte - Kirkland WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1700

US Classification:

707101, 707 7, 707 8

Abstract:

A method, apparatus, software and data structure is disclosed for more efficient access times for linear operations in a hash table, including finding the nearest logical record. A plurality of actual data records and a plurality of marker data records are inserted in a hash table using a hash function. The actual data records and marker data records have a logical ordering specified by a key and are threaded into the hash table to allow linear access by walking the hash table. The logical ordering of the actual data records and marker records is lost upon entry into the hash table, and the keys of the marker data records are distributed at known positions throughout the range of the keys of the actual data records. If when hashing a given key no record exists in the database for the given key, one of the keys for the marker data records are hashed to locate the associated marker data record in the hash table. A nearest logical record may thus be retrieved entering the hash table through the marker data record.