Data lineage data type

• US 6,434,558 B1
• Filed: 12/16/1998
• Issued: 08/13/2002
• Est. Priority Date: 12/16/1998
• Status: Expired due to Term

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Rajarajan, Vij, MacLeod, Stewart P., Kiernan, Casey L.
• Primary Examiner(s): Mizrahi, Diane D.
• Application Number:
  US09/212,238
• Time in Patent Office: 1,336 Days
• Field of Search: 707/100, 707/101, 707/102, 707/103, 707/6, 707/7, 707/3, 707/4, 707/10, 707/201, 700/9
• US Class Current: 1/1
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: Y10S 707/99936 Pattern matching access
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

Abstract

A system for tracking the lineage of data in a database. Data within the tables are tracked by attaching lineage information to the data, preferably, by adding a lineage identifier to each row in a table. Data that share a common lineage can be identified by virtue of sharing a common lineage identifier. The lineage identifier can then be used to trace the source of the data, i.e., data having a common identifier share a common history. Preferably, the lineage data type is an identifier that is universally unique and is optimized to provide little impact on the performance of the database. For example, by providing a sufficient size identifier to ensure its uniqueness while minimizing storage size. More preferably, the data lineage data type is a sixteen-byte number.

Claims

1. A data structure for access by a computer programs, said data structure embodied in a computer readable medium, comprising

a table for use in a database, said table comprising a plurality of rows and columns said table storing information imported into said table from a source external to the database;

a data lineage data type associated with each of said plurality of rows, said data lineage data type storing data indicative of the external source of said row.

2. The data structure as recited in claim 1 wherein said data type is selected to have a size sufficient store a universally unique identifier.

3. The data structure as recited in claim 2 wherein said data type comprises about 16 bytes of storage.

4. The data structure as recited in claim 1 wherein said data type comprises an integer number.

5. The data structure as recited in claim 1 wherein said database comprises a relational databases.

6. The data structure as recited in claim 1 wherein said data type comprises a pointer to a storage location of lineage information.

7. A method for tagging data in a relational database system, comprising:

providing a table of data organized in rows and columns;

importing data into said table from an external data source; and

providing a lineage transform that attaches an identifier to substantially every row in the table.

8. The method as recited in claim 7 wherein said identifier is an identifier intended to uniquely identify a set of rows being moved into the table from a common source.

9. The method as recited in claim 8 wherein said identifier comprises a four-byte identifier.

10. The method as recited in claim 9 wherein said four-byte identifier is derived as a compression function of a system generated unique identifier having a length greater than four bytes.

11. The method as recited in claim 10 wherein the compression function comprises a cyclical redundancy check algorithm.

12. A computer-readable medium bearing computer-readable instructions for carrying out the steps recited in claim 7.

13. A computer-readable medium bearing a data structure accessible by a database management program for providing data lineage to data in a database, comprising:

a table comprising rows and columns said table storing information imported into said table from a source external to the database;

an identifier bound to each row by said database management program for identifying rows moved into the table from a common external data source.

14. The data structure as recited in claim 13 wherein the identifier comprises a four-byte integer value.

15. The data structure as recited in claim 13, wherein the identifier comprises a sixteen-byte GUID.

16. The data structure as recited in claim 13 wherein the identifier comprises a four-byte integer value representing a compressed GUID.

17. The data structure as recited in claim 16 wherein the compressed GUID is based on a cyclical redundancy check value derived from a sixteen-byte GUID.