Susan Lynn Davidson

US Patent:

20050198064, Sep 8, 2005

Filed:

Mar 5, 2004

Appl. No.:

10/794170

Inventors:

Susan Davidson - Gladwyne PA, US
Wenfei Fan - Somerset NJ, US
Carmem Hara - Curitiba-PR, BR
Jing Qin - Elkins Park PA, US

International Classification:

G06F007/00

US Classification:

70710300R

Abstract:

Method and apparatus for validating propagation of XML constraints to functional dependencies when transforming XML to relational data. The method includes steps of accepting variables indicative of XML-based data, determining if one of the variables is unique based on checking the validity of XML keys defining XML constraints and determining if one or more fields in said relational data do not have a null value. The variables are selected from a set of XML keys (Σ), a transformation Rule (R) and a Functional Dependency (φ). One determining step includes substeps of viewing a transformation Rule as a Table Tree and traversing nodes in the Table Tree. The nodes are traversed until an XML key is found at a particular node and then said one of said plurality of variables (in one embodiment identified as x) is determined to be unique when compared to the context of said XML key.

US Patent:

59787902, Nov 2, 1999

Filed:

May 28, 1997

Appl. No.:

8/864538

Inventors:

Peter Buneman - Philadelphia PA
Susan B. Davidson - Gladwyne PA
Dan Suciu - Mountainside NJ

Assignee:

AT&T Corp. - New York NY

International Classification:

G06F 1730

US Classification:

707 2

Abstract:

An apparatus and method for restructuring a database modeled by an edge-labeled tree. Portions of an output tree is generated by matching patterns of tree elements of a starting tree. Portions of the output tree are combined to form a complete output tree which may be restructured again until a final output tree presents a desired "view" of the starting database. If the pattern matches used in restructuring the starting tree is restricted to attributes of tree elements that only includes preceding edge information, successive tree restructuring may be composed into a single restructuring process that optimizes the restructuring by taking advantage of restructuring results of each of the original restructuring processes.

US Patent:

59604255, Sep 28, 1999

Filed:

May 28, 1997

Appl. No.:

8/864539

Inventors:

Peter Buneman - Philadelphia PA
Susan B. Davidson - Gladwyne PA
Dan Suciu - Mountainside NJ

Assignee:

AT&T Corp. - New York NY

International Classification:

G06F 1730

US Classification:

707 3

Abstract:

A database access system responds a user database access request by restructuring a requested database based on two sets of expressions. Expressions are instructions for generating a new database from a starting database modeled as a starting edge-labeled tree by using pattern matches. Expressions always generate an edge-labeled tree allowing a sequence of expressions to be processed to restructure the starting tree. The database access system divides the database restructuring process into two sets of expressions. A first set of expressions is constructed based on subscriber requirements and a second set of expressions is constructed based on particular user requests. The first and second expressions are optimized by composition and the requested database is restructured based on the composed expression.