Elizabeth S O'Neil

US Patent:

7155442, Dec 26, 2006

Filed:

Jun 28, 2002

Appl. No.:

10/185525

Inventors:

Peter Carlin - Seattle WA, US
Jun Fang - Sammamish WA, US
Elizabeth Jean O'Neil - Cambridge MA, US
Patrick Eugene O'Neil - Cambridge MA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 7/08

US Classification:

707101, 707 1, 707 2

Abstract:

Any string in any character set with an arbitrary-leveled weight-based comparison system is transformed into a bitstring in such a way that two transformed strings can be compared byte-by-byte. The resulting bit string has the minimum possible maximum length. The transformed bit strings can be inverted—meaning the original string can be recovered from the transformed string.

US Patent:

20030110150, Jun 12, 2003

Filed:

Nov 30, 2001

Appl. No.:

09/997531

Inventors:

Patrick O'Neil - Cambridge MA, US
Elizabeth O'Neil - Cambridge MA, US
Shankar Pal - Redmond WA, US
Gideon Schaller - Bellevue WA, US
Istvan Cseri - Redmond WA, US
Jose Blakeley - Bothell WA, US
Nigel Westbury - Mercer Island WA, US
Sameet Agarwal - Redmond WA, US
F. Terek - Bellevue WA, US

International Classification:

G06F007/00

US Classification:

707/001000

Abstract:

A technique for representing the structure of hierarchically-organized data in a non-hierarchical data structure, such as a relation. The hierarchically-organized data is represented as a tree, and each node in the tree is assigned a position identifier that represents both the depth level of the node within the hierarchy, and its ancestor/descendant relationship to other nodes. The data represented by each node, as well as its position identifier, is stored in a row of a relational database, thereby capturing the hierarchical structure of the data in such relational database. A technique is provided for the compressed storage of position identifiers in a format that allows an efficient bytewise comparison of position identifiers to determine relative order and ancestry.

US Patent:

20050021549, Jan 27, 2005

Filed:

Aug 24, 2004

Appl. No.:

10/924534

Inventors:

Patrick O'Neil - Cambridge MA, US
Elizabeth O'Neil - Cambridge MA, US
Shankar Pal - Redmond WA, US
Gideon Schaller - Bellevue WA, US
Istvan Cseri - Redmond WA, US
Jose Blakeley - Bothell WA, US
Nigel Westbury - Mercer Island WA, US
Sameet Agarwal - Redmond WA, US
F. Terek - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F017/00

US Classification:

707101000

Abstract:

A technique for representing the structure of hierarchically-organized data in a non-hierarchical data structure, such as a relation. The hierarchically-organized data is represented as a tree, and each node in the tree is assigned a position identifier that represents both the depth level of the node within the hierarchy, and its ancestor/descendant relationship to other nodes. The data represented by each node, as well as its position identifier, is stored in a row of a relational database, thereby capturing the hierarchical structure of the data in such relational database. A technique is provided for the compressed storage of position identifiers in a format that allows an efficient bytewise comparison of position identifiers to determine relative order and ancestry.

US Patent:

20050027728, Feb 3, 2005

Filed:

Aug 24, 2004

Appl. No.:

10/925104

Inventors:

Patrick O'Neil - Cambridge MA, US
Elizabeth O'Neil - Cambridge MA, US
Shankar Pal - Redmond WA, US
Gideon Schaller - Bellevue WA, US
Istvan Cseri - Redmond WA, US
Jose Blakeley - Bothell WA, US
Nigel Westbury - Mercer Island WA, US
Sameet Agarwal - Redmond WA, US
F. Terek - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F017/00

US Classification:

707100000

Abstract:

A technique for representing the structure of hierarchically-organized data in a non-hierarchical data structure, such as a relation. The hierarchically-organized data is represented as a tree, and each node in the tree is assigned a position identifier that represents both the depth level of the node within the hierarchy, and its ancestor/descendant relationship to other nodes. The data represented by each node, as well as its position identifier, is stored in a row of a relational database, thereby capturing the hierarchical structure of the data in such relational database. A technique is provided for the compressed storage of position identifiers in a format that allows an efficient bytewise comparison of position identifiers to determine relative order and ancestry.