IP Library Patent Application 11674038
Patent Application
App. No. 11/674,038

SELF-DESCRIBING WEB DATA STORAGE MODEL

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
11/674,038
Abstract

A type system and query language for interpreting, storing, and communicating data is provided wherein the data is of hierarchical structure. The data is defined according to a web data model and materialized views are provided in conjunction with the available data as well as general hierarchical querying functionality.

Claims (25)

1 . A semi-structured data interaction system, comprising:

a program application component; and

an interface component that facilitates interaction between the application component and structurally-typed, semi-structured data organized in accordance with a web data model.

2 . The system of claim 1 , the interface component comprises a query component that facilitates querying of the data according to a hierarchical query syntax.

3 . The system of claim 1 , the interface component comprises a data storage component that implements a distributed storage system such that the data is stored on multiple data partitions.

4 . The system of claim 3 , the data storage component stores data related to an instance of a top-level entity data type in a data partition where the instance resides.

5 . The system of claim 1 , the interface component comprises a data type definition component that defines a data type in accordance with the web data model.

6 . The system of claim 5 , the data type comprises at least one name/value pair.

7 . The system of claim 6 , further comprising a data structuring component that structures data in accordance with the data type.

8 . The system of claim 6 , the value of the at least one name/value pair is a link to an instance of the same data type resident on a different data partition.

9 . The system of claim 6 , the value of the at least one name/value pair is of a disparate defined sub-level entity data type.

10 . The system of claim 6 , the value of the at least one name/value pair is a primitive data type paired with a unit specification.

11 . The system of claim 6 , the value of the at least one name/value pair is one of at least one name/value pair, a collection or array of values, a null set, or an intentional representation of an executable function.

12 . The system of claim 6 , the data type further comprising a boolean indicator to represent whether the value is nullable and a boolean indicator to represent whether the value is not null.

13 . The system of claim 1 , the interface component comprises a data retrieval component that presents requested data, according to the web data model, using atomic values for primitive data, hard-links to reference data from the same partition but of a different data type and soft-links to reference data resident on a different partition.

14 . A method for aggregating semi-structured data in a distributed data storage and retrieval system comprising:

storing data on a data partition according to an instance of a top-level entity data type to which the data relates; and

materializing a view of the data by storing values resulting from a query based on at least one criterion along with a link to a related instance of a top-level entity data type.

15 . The method of claim 14 , the materialized views are automatically created according to a machine learning based determination that defining the view will be beneficial in avoiding overall system latency.

16 . The method of claim 14 , the at least one criterion relates to a value of a sub-level entity data type.

17 . The method of claim 16 , further comprising creating a subview of the materialized view based on an additional query of the resulting data values.

18 . A computer readable medium having stored thereon a data structure comprising:

one or more name/value pairs, the value of at least one name/value pair is a reference to a different instance of the same data structure located on a different data partition.

19 . The data structure of claim 18 , the value of at least one name/value pair is one of at least one name/value pair, a collection of values, a null value, an intentional representation of an executable function or a primitive value.

20 . The data structure of claim 19 , the value of at least one name value pair is a primitive value decorated with a unit specification.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 15, 2015
From: MICROSOFT CORPORATION
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 034766/0509 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 28, 2007
From: MEIJER, HENRICUS JOHANNES MARIA; SHIELDS, MARK B.; SENGUPTA, SOUMITRA
To: MICROSOFT CORPORATION
Reel/Frame 018939/0696 →