Search

Leonard Mosescu Phones & Addresses

  • Bothell, WA
  • Leavenworth, WA
  • 2145 Dexter Ave, Seattle, WA 98109 (206) 282-4598
  • 2145 Dexter Ave N #405, Seattle, WA 98109
  • Redmond, WA
  • Boulder Creek, CA
  • Mercer Island, WA
  • Snohomish, WA
  • Issaquah, WA
  • 22216 32Nd Ave SE, Bothell, WA 98021

Work

Position: Professional/Technical

Education

Degree: High school graduate or higher

Publications

Us Patents

B-Tree Compression Using Normalized Index Keys

View page
US Patent:
7647291, Jan 12, 2010
Filed:
Dec 30, 2003
Appl. No.:
10/748569
Inventors:
Leonard Ciprian Mosescu - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707 1, 707 2, 707 3
Abstract:
A b-tree may contain multiple keys stored in a normalized form. This normalized form allows keys to be quickly compared and may be used in compressing the underlying b-tree. Each normalized key is compressed relative to the previous key by replacing the common prefix bytes with a common prefix length byte containing the number of bytes in common between the key and the previous key. The compressed keys are stored sequentially in memory with no gaps in between.

Managing Updates Using Compiler And Linker Information

View page
US Patent:
8312447, Nov 13, 2012
Filed:
Sep 25, 2008
Appl. No.:
12/237778
Inventors:
David M. Callaghan - Kirkland WA, US
Russell B. Keldorph - Seattle WA, US
Leonard Ciprian Mosescu - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/445
G06F 9/45
US Classification:
717175, 717168, 717140
Abstract:
Generating a next build version of a software application using information generated during a previous build version at the compiler and linker levels. The information describes the structure and build decisions applied during creation of the previous build version. Generation of the current build version is modified based on the information to minimize the binary differences between the builds. In some embodiments, a linker arranges the contents during the previous build in anticipation of the current build. Further, the linker pads the previous build with unused address space to minimize relocation of the contents of the build.

Efficient String Searches Using Numeric Keypad

View page
US Patent:
20050114312, May 26, 2005
Filed:
Nov 26, 2003
Appl. No.:
10/722987
Inventors:
Leonard Mosescu - Seattle WA, US
International Classification:
G05D001/00
US Classification:
707003000
Abstract:
Contacts are stored in memory on a mobile device with a limited input device containing input points. Each input point corresponds to a subset of the alphabet. For each contact, a string comprising characters representing the input points that correspond to the letters of the alphabet contained in the name of the contact is generated and saved with the contact in the memory. When a user desires to retrieve a contact, the user presses the input point that corresponds to the subset of the alphabet containing the first letter in the name of that contact. A prefix search for the character representing that input point is performed on the saved generated strings. Any contacts containing a matching string are then presented to the user.

Index Key Normalization

View page
US Patent:
20050165794, Jul 28, 2005
Filed:
Dec 30, 2003
Appl. No.:
10/748570
Inventors:
Leonard Mosescu - Seattle WA, US
International Classification:
G06F007/00
US Classification:
707100000
Abstract:
A b-tree may contain multiple keys. Each key may contain multiple column values of different types. In order to allow quick byte by byte comparison of the keys, a normalized form of the keys may be determined by transforming each column value, through a type specific transformative function, into a normalized form. This normalized form allows keys to be quickly compared and may be used in compressing the underlying b-tree. Each normalized key is compressed relative to the previous key by replacing the common prefix bytes with a common prefix length byte containing the number of bytes in common between the key and the previous key. The compressed keys are stored sequentially in memory with no gaps in between.
Leonard C Mosescu from Bothell, WA, age ~47 Get Report