US20030200219A1 - Version-enabled, multi-typed, multi-targeting referential integrity relational database system and methodology - Google Patents
Version-enabled, multi-typed, multi-targeting referential integrity relational database system and methodology Download PDFInfo
- Publication number
- US20030200219A1 US20030200219A1 US10/128,428 US12842802A US2003200219A1 US 20030200219 A1 US20030200219 A1 US 20030200219A1 US 12842802 A US12842802 A US 12842802A US 2003200219 A1 US2003200219 A1 US 2003200219A1
- Authority
- US
- United States
- Prior art keywords
- columns
- sub
- super
- column
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99943—Generating database or data structure, e.g. via user interface
Definitions
- the disclosures herein relate generally to content management systems and more particularly to relational databases.
- a relational database typically includes several tables with rows and column populated with data such as the CONTACT TABLE of FIG. 1A and the NEWSLETTER TABLE of FIG. 1B.
- the primary key field of a table typically refers to a column in the table which is unique to that table and which functions as an index for that table. The actual primary key value for each record of the table must contain data unique to that particular record.
- the CONTACT ID field is the primary key
- the NEWSLETTER ID field is the primary key.
- Two tables can be linked together by another table called a linking table such as the CONTACT-NEWSLETTER LINKING TABLE of FIG. 1C. Since a linking table relates one table to another table, the term “relational database” is used to describe the resultant database.
- a “foreign key” relationship exists between the CONTACT-NEWSLETTER LINKING TABLE of FIG. 1C and the CONTACT TABLE of FIG. 1A because the LINKING TABLE of FIG. 1C includes the primary key “CONTACT ID” from the CONTACT TABLE of FIG. 1A.
- a “foreign key” relationship exists between the CONTACT-NEWSLETTER LINKING TABLE of FIG. 1C and the NEWSLETTER TABLE of FIG. 1B because the LINKING TABLE of FIG. 1C includes the primary key “NEWSLETTER ID” from the NEWSLETTER TABLE of FIG. 1B.
- the CONTACT TABLE of FIG. 1A and the NEWSLETTER TABLE of FIG. 1B. are referred to as “parent tables” because they are the source of the primary keys which populate the LINKING TABLE of FIG. 1C.
- the LINKING TABLE of FIG. 1C is referred to as the “child table” since it contains the foreign keys which point back to the parent tables.
- the child table is dependent because its foreign key values are constrained to be values of the primary keys in the parent tables.
- foreign keys are widely used in linking tables to establish a special referential relationship between two tables.
- foreign keys have several limitations in a real-world referential relationship between two tables. These limitations include no data definition support for allowing multiple parent tables and no data modification support for allowing multiple parent tables. Moreover, foreign keys do not provide version support.
- a database including a plurality of first target tables exhibiting different table types.
- the database system further includes a source table including a plurality of records, each record having a common super-column including a plurality of sub-columns. At least one of the sub-columns of a particular is record references one of the table types of the plurality of first target tables.
- FIG. 1A is a CONTACT TABLE employed in a typical relational database.
- FIG. 1B is a NEWSLETTER TABLE employed in a typical relational database.
- FIG. 1C is a CONTACT-NEWSLETTER LINKING TABLE employed in a relational database.
- FIG. 2 is a relational database which is capable of handling multiple contact types.
- FIG. 3A is a relational database capable of handling multiple contacts types by using an “any contact ID” super-column.
- FIG. 3B is a relational database capable of handling both multiple contact types and multiple newsletter types by using both an “any contact ID” super-column and an “any newspaper ID” super-column.
- FIG. 4 is a relational database including versioning capability.
- FIG. 5 a relational database including a linking source table capable of pointing to multiple types, multiple targets and multiple versions in the target tables.
- FIG. 6 depicts a representative row of a source table and a representative row of a target table having a direct path therebetween and a path through a referential integrity (RI) table.
- RI referential integrity
- FIG. 7 is a block diagram of a host-client computer system employing the disclosed relational database system.
- RDBS relational database system
- foreign keys are statically defined.
- a particular foreign key in a child table can not point to one parent table under certain conditions and then point to another parent table under other conditions.
- a particular foreign key can only point to one parent table for the life of that table.
- the conventional foreign key is regarded as being “single-typed”.
- Data definition time is defined to be the time when tables in an RDBS are initially set up, namely the time before such tables are populated with data.
- Run time is defined to be the time when the already initialized tables are populated with data, record by record.
- Another problem encountered with the conventional RDBS is that there is no versioning capability. For example, in the contact table of FIG. 1A, it is not possible to have two different versions of CONTACT ID 1 or two different versions of CONTACT ID 2 .
- FIG. 1A As seen in FIG. 1A, once the tables of this conventional RDBS are created during data definition time and then populated with data at run time, the RDBS is static in the sense that it is difficult to modify the database to add support for multiple contact types or multiple versions. There is simply one contact type, namely “CONTACT ID” and one version of each CONTACT ID record.
- One possible solution for adding support of multiple data types is shown in FIG. 2 as RDBS 100 . Comparing FIG. 2 to FIGS. 1 A- 1 C, the contact table of FIG. 1A has been divided into three separate table types designated GENERAL CONTACT table 102 , PERSONAL CONTACT table 104 and DEPARTMENT CONTACT table 106 .
- RDBS 100 also includes a NEWSLETTER table 108 employing the same fields as the newsletter table of FIG. 1B. Since the contact table is now divided into three contact type tables 102 , 104 and 106 , the LINKING table 110 is likewise divided into multiple columns as shown in FIG. 2. Each of the contact ID columns of FIG. 2, namely GENERAL CONTACT ID, PERSONAL CONTACT ID and DEPARTMENT CONTACT ID correspond to a different contact type table 102 , 104 and 106 , respectively. Unfortunately, when LINKING table 110 is so divided and populated with foreign key contact type information (indicated by asterisks) many of the fields are left unpopulated. Such an approach, while functional, wastes a large amount of valuable storage space and is thus inefficient.
- FIG. 3A shows an RDBS 200 which is capable of multiple types, multiple targeting and multiple versioning as will subsequently be explained.
- RDBS 200 includes a source table 202 , a portion of which is shown as having a “super-column” 204 which is divided into a plurality of sub-columns, for example 4 sub-columns in this particular embodiment.
- super-column 204 includes “target table name” sub-column 204 A, “target row ID” sub-column 204 B, “referential integrity (RI) row ID” sub-column 204 C and “target version number” sub-column 204 D.
- source table 202 is provided with great flexibility in being able to target multiple types of target records among target tables 212 , 214 and 216 . While in the present example, we have zoomed in on super-column 204 for discussion purposes, it should be understood that source table 202 will in actual practice include other columns which are defined by the user as desired.
- a relational database view function can be used to make it appear to the user that super-column 204 is one column, when in actual practice it is implemented as multiple sub-columns in this particular example. From the user's perspective, super-column 204 will appear as a reference, namely reference 206 as indicated in FIG. 3A.
- Reference 206 represents any contact and is capable of pointing to any of the contact tables such as GENERAL CONTACT table 212 , PERSONAL CONTACT table 214 and DEPARTMENT CONTACT table 216 . Stated alternatively, the “any contact” reference 206 associated with source table 202 is capable of pointing to any of target contact tables 212 , 214 and 216 .
- Super-column 204 provides both a multi-type feature and a multi-targeting feature. It is noted that the multi-type feature is similar to the multi-targeting feature. What is important is that reference 206 , although single-valued, can point to different types (tables) and different targets (records). At run time RDBS 200 exhibits a multi-type feature because source table 202 and its super-column 204 can point to multiple types of tables, for example one of contact tables 212 , 214 and 216 . More particularly, “target table name” sub-column 204 A of the super-column can point to these different table types as desired by the user.
- RDBS 200 also exhibits a multi-targeting capability at run time because its super-column 204 can point to multiple targets within tables 212 , 214 and 216 .
- “target row ID” sub-column 204 B can point to such multiple different targets.
- tables 212 , 214 and 216 correspond to different types or species, namely a general contact table, a personal contact table and a department contact table, respectively, they are related in that they are of the same genus, namely they are all contact tables.
- RI relative integrity
- FIG. 3B illustrates an alternative embodiment of the disclosed RDBS as RDBS 300 .
- RDBS 300 is similar to RDBS 200 of FIG. 3A with like numbers indicating like elements.
- RDBS 300 is different from RDBS 200 in that it's source table 302 includes two super columns, namely super-column 204 (already discussed above) and a second super-column 304 .
- RDBS 300 is also different from RDBS 200 in that it includes 3 types of target newsletter tables, namely SHORT NEWSLETTER table 312 , MEDIUM NEWSLETTER table 314 and LARGE NEWSLETTER table 316 .
- RDBS 300 includes an “ANY NEWSPAPER ID” super-column 304 which is divided into a plurality of sub-columns, for example 4 sub-columns in this particular embodiment.
- super-column 304 includes “target table name” sub-column 304 A, “target row ID” sub-column 304 B, “referential integrity (RI) row ID” sub-column 304 C, and “target version number” sub-column 304 D.
- source table 302 is provided with great flexibility in being able to target multiple types of target records among target tables 212 , 214 and 216 , as well as target tables 312 , 314 and 316 . While in the present example, we have zoomed in on super-column 304 (and super-column 204 ) for discussion purposes, it should be understood that source table 302 will in actual practice include other columns which are defined by the user as desired.
- a relational database view function can again be used to make it appear to the user that super-column 304 is one column, when in actual practice it is implemented as multiple sub-columns in this particular example. From the user's perspective, super-column 304 will appear as a reference, namely reference 306 as indicated in FIG. 3B.
- Reference 306 represents any newsletter type and is capable of pointing to any of the newsletter tables such as SHORT NEWSLETTER table 312 , MEDIUM NEWSLETER table 314 and LARGE NEWSLETTER table 316 .
- the “ANY NEWSLETTER ID” reference 306 associated with source table 302 is capable of pointing to any of target newsletter tables 312 , 314 and 316 .
- Multi-typing and multi-targeting is thus provided by source table 302 via its “any newsletter” super-column 304 .
- super-column 304 could also be programmed to point to any of the contact tables such as GENERAL CONTACT table 212 , PERSONAL CONTACT table 214 and DEPARTMENT CONTACT table 216 .
- GENERAL CONTACT table 212 GENERAL CONTACT table 212
- PERSONAL CONTACT table 214 PERSONAL CONTACT table 214
- DEPARTMENT CONTACT table 216 Great flexibility is provided by this RDBS architecture.
- FIG. 4 illustrates an RDBS 400 similar to RDBS 300 of FIG. 3B and including a versioning capability.
- RDBS 400 saves and keeps track of older versions.
- Super-column 204 is version-enabled meaning that the super-column not only tracks the contact type and target in one example, but also tracks the particular version of the designated target contact type. More specifically, “target version number” sub-column 204 D points to a particular contact type version in one of target tables 212 , 214 or 216 .
- the actual version information is stored in the designated VERSION field 222 , 224 or 226 , respectively, of these target tables.
- contact target tables 212 , 214 and 216 store the most recent version, the oldest (original) version or any specific version of the contact information.
- the VERSION field 222 , 224 and 226 stores the version information while the remaining fields of target contact tables 212 , 214 and 216 store the actual contact data.
- super column 204 will appear as a reference, namely version-enabled reference 206 at source table 302 as indicated in FIG. 4.
- Reference 206 represents any contact and is capable of pointing to any of the contact type tables (target tables) such as GENERAL CONTACT table 212 , PERSONAL CONTACT table 214 and DEPT. CONTACT table 216 .
- Version-enabled reference 206 also points to the particular version of the contact information desired whether it be the most recent version, the original version or a particular specific version. Multi-typing, multi-targeting and versioning capability are thus provided by source table 302 via its “any contact” super-column 204 operating in the database in conjunction with target contact tables 212 , 214 and 216 .
- a reference such as version-enabled reference 206 uniquely identifies a referential relationship between a source row in source table 302 and a target row component in the target tables 212 , 214 and 216 .
- a source row may include zero or more references.
- a reference may be single-valued (i.e. referencing one target row) and is free to point to any row of any target table.
- a reference includes on-insert, on update, and on delete referential integrity on source rows which is maintained by the database system.
- a reference has on-delete referential integrity (restrict, no action, set null, or cascade) on target rows which is also maintained by the database system.
- a reference also exhibits versioning referential integrity (referring to a specific or most current version) on both source and target rows which is again maintained by the database system. This referential integrity is specified during run time.
- super-column 304 is similar to super-column 204 and can be populated to point to multiple types and targets in target tables 212 , 214 , 216 , 312 , 314 and 316 . Each of these tables includes a version field. Target tables 312 , 314 and 316 include version fields 322 , 324 and 326 . In actual practice source tables may include other columns and rows in addition to super-columns 204 and 304 as desired by the user or others.
- FIG. 5 shows an RDBS 500 that includes a source table 510 which is a linking table.
- Source table 510 is also called a linking source table.
- Linking source table 510 includes multiple rows and columns.
- the records 520 , 530 , 540 , 550 , 560 and 570 include super columns such as 204 and 304 . Moreover, these records include other columns in addition to columns 204 and 304 as desired by the user or others.
- the super-columns in the records of source table 510 exhibit the multi-typed, multi-targeting, multi-versioning features described above. Adjacent records 520 and 550 can together be considered a record of source tables 510 . Likewise adjacent records 530 and 560 can together be considered a record of source table 510 .
- FIG. 6 shows the relation between a representative source row 520 of source table 510 and a representative target row 610 of target table 212 in more detail. While there is a direct path 620 between source row 520 and target row 610 , there is also a referential integrity path 630 through Referential Integrity Table of which a representative RI row 640 is shown. While the actual RDBS employs a source table, an RI table and target table, or a plurality thereof, for simplicity a source row 520 , an RI row 640 of an RI table and a target row 610 of target table 212 have been shown in FIG. 6 instead of the entire table structures. The RI table is used to maintain referential integrity of all the references that exist in the data base system. Each row (such as row 640 ) in the RI table represents a reference which is composed of source and target row information.
- path 630 instead of pointing directly from source row 520 to target row 610 , source row 520 points to RI row 640 of the RI table for the purpose of maintaining referential integrity.
- direct path 620 provides high execution speed while RI path 630 maintains referential integrity.
- the path through RI row 640 and its RI table is transparent to the user.
- target row 610 is synchronized with RI row 640 of the RI table. Whenever there is a delete in the target table, there is a corresponding delete in the RI table. Once this synchronization between the target table and RI table is carried out for a particular row, further synchronization between the RI table and the source table is conducted. From the source table to the RI table, a foreign key-like relationship is defined from the RI ROW ID (one column of the super-column) to the RI column (a primary key) in the RI table. However, from the RI table to the target table, there is no foreign key relationship. (It will be recalled that RI ROW ID is one sub-column of super column 204 , namely “referential integrity (RI) row ID” sub-column 204 C, as shown in FIG. 3A.
- target trigger 650 monitoring changes made to the target table.
- target trigger 650 detects that a delete or other change has been made to the target table, it instructs the RI table to make the same delete or other change in the corresponding record in the RI table. Changes made to the RI table are cascaded back to the source table of which source row 520 is a member.
- target trigger 650 includes trigger logic which is dynamically attached to the target table as needed to synchronize deletions and changes between the target and RI tables. These deletions and changes include version deletions and version changes.
- a source trigger 660 is attached to source table 510 which includes source row 510 as shown in FIG. 6.
- Source trigger 660 takes care of forward deleting the corresponding RI row when a source row is deleted.
- on delete and update triggers are attached to source and target tables for maintaining global referential integrity.
- Source table triggers are statically created during source table generation whereas target triggers are dynamically created.
- FIG. 7 is a block diagram of an information handling system or computer system 700 on which relational database systems (RDBS's) 200 , 300 , 400 or 500 are operated. More particularly, computer system 700 includes a client computer 710 which is coupled 20 to a server computer or host 720 . RDBS's 200 , 300 , 400 or 500 are installed on server or host computer 720 as shown. Client computer 710 sends queries to the RDBS in server computer 710 and receives results back from that RDBS.
- RDBS's 200 , 300 , 400 or 500 are installed on server or host computer 720 as shown.
- Client computer 710 sends queries to the RDBS in server computer 710 and receives results back from that RDBS.
- the disclosed content management system can be stored on virtually any computer-readable storage media, such as CD, DVD and other magnetic and optical media in either compressed or non-compressed form. Of course, it can also be stored on a server computer system or other information handling system.
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
- The disclosures herein relate generally to content management systems and more particularly to relational databases.
- A relational database typically includes several tables with rows and column populated with data such as the CONTACT TABLE of FIG. 1A and the NEWSLETTER TABLE of FIG. 1B. The primary key field of a table typically refers to a column in the table which is unique to that table and which functions as an index for that table. The actual primary key value for each record of the table must contain data unique to that particular record. In FIG. 1A the CONTACT ID field is the primary key and in FIG. 1B the NEWSLETTER ID field is the primary key. Two tables can be linked together by another table called a linking table such as the CONTACT-NEWSLETTER LINKING TABLE of FIG. 1C. Since a linking table relates one table to another table, the term “relational database” is used to describe the resultant database.
- A “foreign key” relationship exists between the CONTACT-NEWSLETTER LINKING TABLE of FIG. 1C and the CONTACT TABLE of FIG. 1A because the LINKING TABLE of FIG. 1C includes the primary key “CONTACT ID” from the CONTACT TABLE of FIG. 1A. Likewise, a “foreign key” relationship exists between the CONTACT-NEWSLETTER LINKING TABLE of FIG. 1C and the NEWSLETTER TABLE of FIG. 1B because the LINKING TABLE of FIG. 1C includes the primary key “NEWSLETTER ID” from the NEWSLETTER TABLE of FIG. 1B.
- The CONTACT TABLE of FIG. 1A and the NEWSLETTER TABLE of FIG. 1B. are referred to as “parent tables” because they are the source of the primary keys which populate the LINKING TABLE of FIG. 1C. The LINKING TABLE of FIG. 1C is referred to as the “child table” since it contains the foreign keys which point back to the parent tables. The child table is dependent because its foreign key values are constrained to be values of the primary keys in the parent tables.
- In relational databases, foreign keys are widely used in linking tables to establish a special referential relationship between two tables. However, foreign keys have several limitations in a real-world referential relationship between two tables. These limitations include no data definition support for allowing multiple parent tables and no data modification support for allowing multiple parent tables. Moreover, foreign keys do not provide version support.
- What is needed is a mechanism and methodology for removing these limitations when using a foreign key to establish a relationship between tables.
- Accordingly, in one embodiment a database is disclosed including a plurality of first target tables exhibiting different table types. The database system further includes a source table including a plurality of records, each record having a common super-column including a plurality of sub-columns. At least one of the sub-columns of a particular is record references one of the table types of the plurality of first target tables.
- Principal advantages of the embodiment disclosed herein include support for multi-typed target tables, multiple targeting and multiple versioning as explained subsequently.
- FIG. 1A is a CONTACT TABLE employed in a typical relational database.
- FIG. 1B is a NEWSLETTER TABLE employed in a typical relational database.
- FIG. 1C is a CONTACT-NEWSLETTER LINKING TABLE employed in a relational database.
- FIG. 2 is a relational database which is capable of handling multiple contact types.
- FIG. 3A is a relational database capable of handling multiple contacts types by using an “any contact ID” super-column.
- FIG. 3B is a relational database capable of handling both multiple contact types and multiple newsletter types by using both an “any contact ID” super-column and an “any newspaper ID” super-column.
- FIG. 4 is a relational database including versioning capability.
- FIG. 5 a relational database including a linking source table capable of pointing to multiple types, multiple targets and multiple versions in the target tables.
- FIG. 6 depicts a representative row of a source table and a representative row of a target table having a direct path therebetween and a path through a referential integrity (RI) table.
- FIG. 7 is a block diagram of a host-client computer system employing the disclosed relational database system.
- When a conventional relational database system (RDBS) is created, foreign keys are statically defined. In other words, a particular foreign key in a child table can not point to one parent table under certain conditions and then point to another parent table under other conditions. A particular foreign key can only point to one parent table for the life of that table. In this respect, the conventional foreign key is regarded as being “single-typed”. There is no data definition support for allowing a conventional foreign key to point to multiple parent tables during data definition time. Data definition time is defined to be the time when tables in an RDBS are initially set up, namely the time before such tables are populated with data.
- Moreover, during “run time” such a database has no data modification support for foreign keys. Run time is defined to be the time when the already initialized tables are populated with data, record by record. Another problem encountered with the conventional RDBS is that there is no versioning capability. For example, in the contact table of FIG. 1A, it is not possible to have two different versions of
CONTACT ID 1 or two different versions ofCONTACT ID 2. - As seen in FIG. 1A, once the tables of this conventional RDBS are created during data definition time and then populated with data at run time, the RDBS is static in the sense that it is difficult to modify the database to add support for multiple contact types or multiple versions. There is simply one contact type, namely “CONTACT ID” and one version of each CONTACT ID record. One possible solution for adding support of multiple data types is shown in FIG. 2 as
RDBS 100. Comparing FIG. 2 to FIGS. 1A-1C, the contact table of FIG. 1A has been divided into three separate table types designated GENERAL CONTACT table 102, PERSONAL CONTACT table 104 and DEPARTMENT CONTACT table 106. Contact tables 102, 104 and 106 employ the same fields as the contact table of FIG. 1A.RDBS 100 also includes a NEWSLETTER table 108 employing the same fields as the newsletter table of FIG. 1B. Since the contact table is now divided into three contact type tables 102, 104 and 106, the LINKING table 110 is likewise divided into multiple columns as shown in FIG. 2. Each of the contact ID columns of FIG. 2, namely GENERAL CONTACT ID, PERSONAL CONTACT ID and DEPARTMENT CONTACT ID correspond to a different contact type table 102, 104 and 106, respectively. Unfortunately, when LINKING table 110 is so divided and populated with foreign key contact type information (indicated by asterisks) many of the fields are left unpopulated. Such an approach, while functional, wastes a large amount of valuable storage space and is thus inefficient. - To solve the problems discussed above, FIG. 3A shows an
RDBS 200 which is capable of multiple types, multiple targeting and multiple versioning as will subsequently be explained.RDBS 200 includes a source table 202, a portion of which is shown as having a “super-column” 204 which is divided into a plurality of sub-columns, for example 4 sub-columns in this particular embodiment. As seen in FIG. 3A,super-column 204 includes “target table name”sub-column 204A, “target row ID”sub-column 204B, “referential integrity (RI) row ID”sub-column 204C and “target version number”sub-column 204D. By including this information insuper-column 204, source table 202 is provided with great flexibility in being able to target multiple types of target records among target tables 212, 214 and 216. While in the present example, we have zoomed in onsuper-column 204 for discussion purposes, it should be understood that source table 202 will in actual practice include other columns which are defined by the user as desired. - A relational database view function can be used to make it appear to the user that super-column204 is one column, when in actual practice it is implemented as multiple sub-columns in this particular example. From the user's perspective,
super-column 204 will appear as a reference, namely reference 206 as indicated in FIG. 3A.Reference 206 represents any contact and is capable of pointing to any of the contact tables such as GENERAL CONTACT table 212, PERSONAL CONTACT table 214 and DEPARTMENT CONTACT table 216. Stated alternatively, the “any contact”reference 206 associated with source table 202 is capable of pointing to any of target contact tables 212, 214 and 216. -
Super-column 204 provides both a multi-type feature and a multi-targeting feature. It is noted that the multi-type feature is similar to the multi-targeting feature. What is important is thatreference 206, although single-valued, can point to different types (tables) and different targets (records). Atrun time RDBS 200 exhibits a multi-type feature because source table 202 and itssuper-column 204 can point to multiple types of tables, for example one of contact tables 212, 214 and 216. More particularly, “target table name”sub-column 204A of the super-column can point to these different table types as desired by the user.RDBS 200 also exhibits a multi-targeting capability at run time because itssuper-column 204 can point to multiple targets within tables 212, 214 and 216. For example, in more detail, “target row ID”sub-column 204B can point to such multiple different targets. - This solves two very significant problems associated with foreign keys, namely that they can not point to multiple type tables once the tables are set up and that they can not point to multiple targets once the tables are populated with data. While tables212, 214 and 216 correspond to different types or species, namely a general contact table, a personal contact table and a department contact table, respectively, they are related in that they are of the same genus, namely they are all contact tables. The usage of “referential integrity (RI) row ID” sub-column, 204C and “target version number”
sub-column 204D are discussed later. - FIG. 3B illustrates an alternative embodiment of the disclosed RDBS as
RDBS 300.RDBS 300 is similar to RDBS 200 of FIG. 3A with like numbers indicating like elements.RDBS 300 is different fromRDBS 200 in that it's source table 302 includes two super columns, namely super-column 204 (already discussed above) and asecond super-column 304.RDBS 300 is also different fromRDBS 200 in that it includes 3 types of target newsletter tables, namely SHORT NEWSLETTER table 312, MEDIUM NEWSLETTER table 314 and LARGE NEWSLETTER table 316. To accommodate the multiple types or multi-typing of newsletter tables 312, 314 and 316,RDBS 300 includes an “ANY NEWSPAPER ID”super-column 304 which is divided into a plurality of sub-columns, for example 4 sub-columns in this particular embodiment. As seen in FIG. 3B,super-column 304 includes “target table name”sub-column 304A, “target row ID”sub-column 304B, “referential integrity (RI) row ID”sub-column 304C, and “target version number”sub-column 304D. By including this information insuper-column 304, source table 302 is provided with great flexibility in being able to target multiple types of target records among target tables 212, 214 and 216, as well as target tables 312, 314 and 316. While in the present example, we have zoomed in on super-column 304 (and super-column 204) for discussion purposes, it should be understood that source table 302 will in actual practice include other columns which are defined by the user as desired. - A relational database view function can again be used to make it appear to the user that super-column304 is one column, when in actual practice it is implemented as multiple sub-columns in this particular example. From the user's perspective,
super-column 304 will appear as a reference, namely reference 306 as indicated in FIG. 3B.Reference 306 represents any newsletter type and is capable of pointing to any of the newsletter tables such as SHORT NEWSLETTER table 312, MEDIUM NEWSLETER table 314 and LARGE NEWSLETTER table 316. In other words, the “ANY NEWSLETTER ID”reference 306 associated with source table 302 is capable of pointing to any of target newsletter tables 312, 314 and 316. Multi-typing and multi-targeting is thus provided by source table 302 via its “any newsletter”super-column 304. If desired,super-column 304 could also be programmed to point to any of the contact tables such as GENERAL CONTACT table 212, PERSONAL CONTACT table 214 and DEPARTMENT CONTACT table 216. Great flexibility is provided by this RDBS architecture. - FIG. 4 illustrates an RDBS400 similar to RDBS 300 of FIG. 3B and including a versioning capability. For example, rather than simply overwriting an old version of a contact with a new version of a contact,
RDBS 400 saves and keeps track of older versions.Super-column 204 is version-enabled meaning that the super-column not only tracks the contact type and target in one example, but also tracks the particular version of the designated target contact type. More specifically, “target version number”sub-column 204D points to a particular contact type version in one of target tables 212, 214 or 216. The actual version information is stored in the designatedVERSION field VERSION field - From the user's perspective,
super column 204 will appear as a reference, namely version-enabledreference 206 at source table 302 as indicated in FIG. 4.Reference 206 represents any contact and is capable of pointing to any of the contact type tables (target tables) such as GENERAL CONTACT table 212, PERSONAL CONTACT table 214 and DEPT. CONTACT table 216. Version-enabledreference 206 also points to the particular version of the contact information desired whether it be the most recent version, the original version or a particular specific version. Multi-typing, multi-targeting and versioning capability are thus provided by source table 302 via its “any contact”super-column 204 operating in the database in conjunction with target contact tables 212, 214 and 216. - In more detail, it is noted that a reference such as version-enabled
reference 206 uniquely identifies a referential relationship between a source row in source table 302 and a target row component in the target tables 212, 214 and 216.. A source row may include zero or more references. A reference may be single-valued (i.e. referencing one target row) and is free to point to any row of any target table. A reference includes on-insert, on update, and on delete referential integrity on source rows which is maintained by the database system. Moreover, a reference has on-delete referential integrity (restrict, no action, set null, or cascade) on target rows which is also maintained by the database system. A reference also exhibits versioning referential integrity (referring to a specific or most current version) on both source and target rows which is again maintained by the database system. This referential integrity is specified during run time. - As mentioned earlier,
super-column 304 is similar tosuper-column 204 and can be populated to point to multiple types and targets in target tables 212, 214, 216, 312, 314 and 316. Each of these tables includes a version field. Target tables 312, 314 and 316 includeversion fields RDBS 500 that includes a source table 510 which is a linking table. Source table 510 is also called a linking source table. Linking source table 510 includes multiple rows and columns. Therecords columns Adjacent records adjacent records - FIG. 6 shows the relation between a
representative source row 520 of source table 510 and arepresentative target row 610 of target table 212 in more detail. While there is adirect path 620 betweensource row 520 andtarget row 610, there is also areferential integrity path 630 through Referential Integrity Table of which arepresentative RI row 640 is shown. While the actual RDBS employs a source table, an RI table and target table, or a plurality thereof, for simplicity asource row 520, anRI row 640 of an RI table and atarget row 610 of target table 212 have been shown in FIG. 6 instead of the entire table structures. The RI table is used to maintain referential integrity of all the references that exist in the data base system. Each row (such as row 640) in the RI table represents a reference which is composed of source and target row information. - In
path 630, instead of pointing directly fromsource row 520 to targetrow 610,source row 520 points toRI row 640 of the RI table for the purpose of maintaining referential integrity. However,direct path 620 provides high execution speed whileRI path 630 maintains referential integrity. The path throughRI row 640 and its RI table is transparent to the user. - To maintain referential integrity,
target row 610 is synchronized withRI row 640 of the RI table. Whenever there is a delete in the target table, there is a corresponding delete in the RI table. Once this synchronization between the target table and RI table is carried out for a particular row, further synchronization between the RI table and the source table is conducted. From the source table to the RI table, a foreign key-like relationship is defined from the RI ROW ID (one column of the super-column) to the RI column (a primary key) in the RI table. However, from the RI table to the target table, there is no foreign key relationship. (It will be recalled that RI ROW ID is one sub-column ofsuper column 204, namely “referential integrity (RI) row ID”sub-column 204C, as shown in FIG. 3A. - Even though there is no foreign key relationship between the target table and the RI table (e.g. between
target row 610 andRI row 640 in FIG. 6), there is atarget trigger 650 monitoring changes made to the target table. Whentarget trigger 650 detects that a delete or other change has been made to the target table, it instructs the RI table to make the same delete or other change in the corresponding record in the RI table. Changes made to the RI table are cascaded back to the source table of which source row 520 is a member. It is noted thattarget trigger 650 includes trigger logic which is dynamically attached to the target table as needed to synchronize deletions and changes between the target and RI tables. These deletions and changes include version deletions and version changes. - A
source trigger 660 is attached to source table 510 which includessource row 510 as shown in FIG. 6.Source trigger 660 takes care of forward deleting the corresponding RI row when a source row is deleted. To summarize trigger operation, as described above, on delete and update triggers are attached to source and target tables for maintaining global referential integrity. Source table triggers are statically created during source table generation whereas target triggers are dynamically created. - FIG. 7 is a block diagram of an information handling system or
computer system 700 on which relational database systems (RDBS's) 200, 300, 400 or 500 are operated. More particularly,computer system 700 includes aclient computer 710 which is coupled 20 to a server computer orhost 720. RDBS's 200, 300, 400 or 500 are installed on server orhost computer 720 as shown.Client computer 710 sends queries to the RDBS inserver computer 710 and receives results back from that RDBS. - The disclosed content management system can be stored on virtually any computer-readable storage media, such as CD, DVD and other magnetic and optical media in either compressed or non-compressed form. Of course, it can also be stored on a server computer system or other information handling system.
- The principal advantages of these embodiments are the providing of a relational database system and methodology which permits multi-typing, multi-targeting and multi-versioning while conserving valuable memory space in the host server system.
- Although illustrative embodiments have been shown and described, a wide range of modification, change and substitution is contemplated in the foregoing disclosure and in some instances, some features of an embodiment may be employed without a corresponding use of other features. Accordingly, it is appropriate that the appended claims be construed broadly and in a manner consistent with the scope of the embodiments disclosed herein.
Claims (23)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/128,428 US6947948B2 (en) | 2002-04-23 | 2002-04-23 | Version-enabled, multi-typed, multi-targeting referential integrity relational database system and methodology |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/128,428 US6947948B2 (en) | 2002-04-23 | 2002-04-23 | Version-enabled, multi-typed, multi-targeting referential integrity relational database system and methodology |
Publications (2)
Publication Number | Publication Date |
---|---|
US20030200219A1 true US20030200219A1 (en) | 2003-10-23 |
US6947948B2 US6947948B2 (en) | 2005-09-20 |
Family
ID=29215466
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/128,428 Expired - Lifetime US6947948B2 (en) | 2002-04-23 | 2002-04-23 | Version-enabled, multi-typed, multi-targeting referential integrity relational database system and methodology |
Country Status (1)
Country | Link |
---|---|
US (1) | US6947948B2 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080126367A1 (en) * | 2006-11-08 | 2008-05-29 | International Business Machines Corporation | Deletion of Data From Child Tables with Multiple Parents |
US20100318494A1 (en) * | 2009-06-15 | 2010-12-16 | Microsoft Corporation | Conversion of an application database to minimize time in single-user access mode |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7552123B2 (en) * | 2003-08-13 | 2009-06-23 | At&T Intellectual Property I, L.P. | Methods, systems and computer program products for synchronizing records in billing and service databases |
US8984133B2 (en) | 2007-06-19 | 2015-03-17 | The Invention Science Fund I, Llc | Providing treatment-indicative feedback dependent on putative content treatment |
US9374242B2 (en) | 2007-11-08 | 2016-06-21 | Invention Science Fund I, Llc | Using evaluations of tentative message content |
US8682982B2 (en) | 2007-06-19 | 2014-03-25 | The Invention Science Fund I, Llc | Preliminary destination-dependent evaluation of message content |
US8082225B2 (en) | 2007-08-31 | 2011-12-20 | The Invention Science Fund I, Llc | Using destination-dependent criteria to guide data transmission decisions |
US8065404B2 (en) | 2007-08-31 | 2011-11-22 | The Invention Science Fund I, Llc | Layering destination-dependent content handling guidance |
US7930389B2 (en) | 2007-11-20 | 2011-04-19 | The Invention Science Fund I, Llc | Adaptive filtering of annotated messages or the like |
US8051209B2 (en) * | 2008-11-26 | 2011-11-01 | Microsoft Corporation | Minimizing conflicts when synchronizing interrelated data between two systems |
US9098470B2 (en) * | 2011-05-23 | 2015-08-04 | Microsoft Technology Licensing, Llc | Versioned and hierarchical data structures and distributed transactions |
Citations (53)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4751740A (en) * | 1984-12-10 | 1988-06-14 | Wang Laboratories, Inc. | Apparatus, method, and structure for translating a document having one structure into a document having another structure |
US4969091A (en) * | 1987-08-06 | 1990-11-06 | Mueller Otto | Apparatus for stack control employing mixed hardware registers and memory |
US5615337A (en) * | 1995-04-06 | 1997-03-25 | International Business Machines Corporation | System and method for efficiently processing diverse result sets returned by a stored procedures |
US5644768A (en) * | 1994-12-09 | 1997-07-01 | Borland International, Inc. | Systems and methods for sharing resources in a multi-user environment |
US5680557A (en) * | 1994-02-16 | 1997-10-21 | The United States Of America As Represented By The Secretary Of The Army | Natural computing system |
US5701400A (en) * | 1995-03-08 | 1997-12-23 | Amado; Carlos Armando | Method and apparatus for applying if-then-else rules to data sets in a relational data base and generating from the results of application of said rules a database of diagnostics linked to said data sets to aid executive analysis of financial data |
US5742813A (en) * | 1994-11-10 | 1998-04-21 | Cadis, Inc. | Method and apparatus for concurrency in an object oriented database using lock inheritance based on class objects |
US5742810A (en) * | 1995-08-31 | 1998-04-21 | International Business Machines Corporation | System, method and computer program product for passing host variables to a database management system |
US5774719A (en) * | 1993-01-08 | 1998-06-30 | Digital Equipment Corporation | Method for comparing data structures that cross address space boundaries |
US5778398A (en) * | 1993-07-20 | 1998-07-07 | Canon Kabushiki Kaisha | Document processing to permit sharing of content by plural documents |
US5799310A (en) * | 1995-05-01 | 1998-08-25 | International Business Machines Corporation | Relational database extenders for handling complex data types |
US5819252A (en) * | 1996-04-10 | 1998-10-06 | Digital Equipment Corporation | Method and apparatus for handling and detecting an invalid use of a data structure |
US5862378A (en) * | 1996-05-31 | 1999-01-19 | International Business Machines Corporation | Passing arrays to stored procedures |
US5875332A (en) * | 1996-05-31 | 1999-02-23 | International Business Machines Corporation | Generating a common gateway interface adapter customized for a stored procedure |
US5892902A (en) * | 1996-09-05 | 1999-04-06 | Clark; Paul C. | Intelligent token protected system with network authentication |
US5940616A (en) * | 1996-05-31 | 1999-08-17 | International Business Machines Corporation | Tracker class for object-oriented programming environments |
US5953525A (en) * | 1997-03-31 | 1999-09-14 | International Business Machines Corporation | Multi-tier view project window |
US5956036A (en) * | 1997-03-31 | 1999-09-21 | International Business Machines Corporation | Shared modules graphical user interface |
US6012067A (en) * | 1998-03-02 | 2000-01-04 | Sarkar; Shyam Sundar | Method and apparatus for storing and manipulating objects in a plurality of relational data managers on the web |
US6016497A (en) * | 1997-12-24 | 2000-01-18 | Microsoft Corporation | Methods and system for storing and accessing embedded information in object-relational databases |
US6016394A (en) * | 1997-09-17 | 2000-01-18 | Tenfold Corporation | Method and system for database application software creation requiring minimal programming |
US6052693A (en) * | 1996-07-02 | 2000-04-18 | Harlequin Group Plc | System for assembling large databases through information extracted from text sources |
US6055637A (en) * | 1996-09-27 | 2000-04-25 | Electronic Data Systems Corporation | System and method for accessing enterprise-wide resources by presenting to the resource a temporary credential |
US6063133A (en) * | 1995-08-31 | 2000-05-16 | International Business Machines Corporation | No preprocessor for embedded SQL in a 3GL |
US6065117A (en) * | 1997-07-16 | 2000-05-16 | International Business Machines Corporation | Systems, methods and computer program products for sharing state information between a stateless server and a stateful client |
US6088524A (en) * | 1995-12-27 | 2000-07-11 | Lucent Technologies, Inc. | Method and apparatus for optimizing database queries involving aggregation predicates |
US6104393A (en) * | 1998-06-11 | 2000-08-15 | International Business Machines Corporation | Integration of procedural and object-oriented user interfaces |
US6128621A (en) * | 1997-10-31 | 2000-10-03 | Oracle Corporation | Apparatus and method for pickling data |
US6148342A (en) * | 1998-01-27 | 2000-11-14 | Ho; Andrew P. | Secure database management system for confidential records using separately encrypted identifier and access request |
US6161182A (en) * | 1998-03-06 | 2000-12-12 | Lucent Technologies Inc. | Method and apparatus for restricting outbound access to remote equipment |
US6167405A (en) * | 1998-04-27 | 2000-12-26 | Bull Hn Information Systems Inc. | Method and apparatus for automatically populating a data warehouse system |
US6219826B1 (en) * | 1996-08-01 | 2001-04-17 | International Business Machines Corporation | Visualizing execution patterns in object-oriented programs |
US6233586B1 (en) * | 1998-04-01 | 2001-05-15 | International Business Machines Corp. | Federated searching of heterogeneous datastores using a federated query object |
US20010008015A1 (en) * | 1997-05-02 | 2001-07-12 | Son Trung Vu | Method and apparatus for secure processing of cryptographic keys |
US6263313B1 (en) * | 1998-08-13 | 2001-07-17 | International Business Machines Corporation | Method and apparatus to create encoded digital content |
US6263342B1 (en) * | 1998-04-01 | 2001-07-17 | International Business Machines Corp. | Federated searching of heterogeneous datastores using a federated datastore object |
US6272488B1 (en) * | 1998-04-01 | 2001-08-07 | International Business Machines Corporation | Managing results of federated searches across heterogeneous datastores with a federated collection object |
US6279008B1 (en) * | 1998-06-29 | 2001-08-21 | Sun Microsystems, Inc. | Integrated graphical user interface method and apparatus for mapping between objects and databases |
US6279111B1 (en) * | 1998-06-12 | 2001-08-21 | Microsoft Corporation | Security model using restricted tokens |
US6282649B1 (en) * | 1997-09-19 | 2001-08-28 | International Business Machines Corporation | Method for controlling access to electronically provided services and system for implementing such method |
US20010019614A1 (en) * | 2000-10-20 | 2001-09-06 | Medna, Llc | Hidden Link Dynamic Key Manager for use in Computer Systems with Database Structure for Storage and Retrieval of Encrypted Data |
US6289344B1 (en) * | 1998-05-11 | 2001-09-11 | International Business Machines Corporation | Context-sensitive authorization in an RDBMS |
US6292936B1 (en) * | 1998-11-12 | 2001-09-18 | International Business Machines Corporation | Enabling multiple runtime processors in an interpreter-based embedded scripting system |
US6308274B1 (en) * | 1998-06-12 | 2001-10-23 | Microsoft Corporation | Least privilege via restricted tokens |
US6314449B1 (en) * | 1998-08-28 | 2001-11-06 | International Business Machines Corporation | Method and system for accessing application log messages appearing in a web-based user interface in a distributed network |
US6327629B1 (en) * | 1996-05-31 | 2001-12-04 | International Business Machines Corporation | Stored procedure universal calling interface |
US20020002486A1 (en) * | 1999-07-27 | 2002-01-03 | Michael Loeb | Method and system for qualifying consumers for trade publication subscriptions |
US6338056B1 (en) * | 1998-12-14 | 2002-01-08 | International Business Machines Corporation | Relational database extender that supports user-defined index types and user-defined search |
US6339777B1 (en) * | 1999-07-30 | 2002-01-15 | International Business Machines Corporation | Method and system for handling foreign key update in an object-oriented database environment |
US6343286B1 (en) * | 1998-09-24 | 2002-01-29 | International Business Machines Corporation | Efficient technique to defer large object access with intermediate results |
US6550057B1 (en) * | 1999-08-31 | 2003-04-15 | Accenture Llp | Piecemeal retrieval in an information services patterns environment |
US6601234B1 (en) * | 1999-08-31 | 2003-07-29 | Accenture Llp | Attribute dictionary in a business logic services environment |
US6636845B2 (en) * | 1999-12-02 | 2003-10-21 | International Business Machines Corporation | Generating one or more XML documents from a single SQL query |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
IL122023A (en) | 1997-10-26 | 2007-06-17 | Enco Tone Ltd | Non-transferable bio-metric token-based identification method and devices |
WO1999035782A1 (en) | 1998-01-02 | 1999-07-15 | Cryptography Research, Inc. | Leak-resistant cryptographic method and apparatus |
US6173400B1 (en) | 1998-07-31 | 2001-01-09 | Sun Microsystems, Inc. | Methods and systems for establishing a shared secret using an authentication token |
US6289458B1 (en) | 1998-09-21 | 2001-09-11 | Microsoft Corporation | Per property access control mechanism |
-
2002
- 2002-04-23 US US10/128,428 patent/US6947948B2/en not_active Expired - Lifetime
Patent Citations (55)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4751740A (en) * | 1984-12-10 | 1988-06-14 | Wang Laboratories, Inc. | Apparatus, method, and structure for translating a document having one structure into a document having another structure |
US4969091A (en) * | 1987-08-06 | 1990-11-06 | Mueller Otto | Apparatus for stack control employing mixed hardware registers and memory |
US5774719A (en) * | 1993-01-08 | 1998-06-30 | Digital Equipment Corporation | Method for comparing data structures that cross address space boundaries |
US5778398A (en) * | 1993-07-20 | 1998-07-07 | Canon Kabushiki Kaisha | Document processing to permit sharing of content by plural documents |
US5680557A (en) * | 1994-02-16 | 1997-10-21 | The United States Of America As Represented By The Secretary Of The Army | Natural computing system |
US5742813A (en) * | 1994-11-10 | 1998-04-21 | Cadis, Inc. | Method and apparatus for concurrency in an object oriented database using lock inheritance based on class objects |
US5644768A (en) * | 1994-12-09 | 1997-07-01 | Borland International, Inc. | Systems and methods for sharing resources in a multi-user environment |
US5701400A (en) * | 1995-03-08 | 1997-12-23 | Amado; Carlos Armando | Method and apparatus for applying if-then-else rules to data sets in a relational data base and generating from the results of application of said rules a database of diagnostics linked to said data sets to aid executive analysis of financial data |
US5615337A (en) * | 1995-04-06 | 1997-03-25 | International Business Machines Corporation | System and method for efficiently processing diverse result sets returned by a stored procedures |
US6047291A (en) * | 1995-05-01 | 2000-04-04 | International Business Machines Corporation | Relational database extenders for handling complex data types |
US5799310A (en) * | 1995-05-01 | 1998-08-25 | International Business Machines Corporation | Relational database extenders for handling complex data types |
US5742810A (en) * | 1995-08-31 | 1998-04-21 | International Business Machines Corporation | System, method and computer program product for passing host variables to a database management system |
US6063133A (en) * | 1995-08-31 | 2000-05-16 | International Business Machines Corporation | No preprocessor for embedded SQL in a 3GL |
US6088524A (en) * | 1995-12-27 | 2000-07-11 | Lucent Technologies, Inc. | Method and apparatus for optimizing database queries involving aggregation predicates |
US5819252A (en) * | 1996-04-10 | 1998-10-06 | Digital Equipment Corporation | Method and apparatus for handling and detecting an invalid use of a data structure |
US6067414A (en) * | 1996-05-31 | 2000-05-23 | International Business Machines Corporation | Generating a common gateway interface adaptor customized for a stored procedure |
US6327629B1 (en) * | 1996-05-31 | 2001-12-04 | International Business Machines Corporation | Stored procedure universal calling interface |
US5862378A (en) * | 1996-05-31 | 1999-01-19 | International Business Machines Corporation | Passing arrays to stored procedures |
US5875332A (en) * | 1996-05-31 | 1999-02-23 | International Business Machines Corporation | Generating a common gateway interface adapter customized for a stored procedure |
US5940616A (en) * | 1996-05-31 | 1999-08-17 | International Business Machines Corporation | Tracker class for object-oriented programming environments |
US6052693A (en) * | 1996-07-02 | 2000-04-18 | Harlequin Group Plc | System for assembling large databases through information extracted from text sources |
US6219826B1 (en) * | 1996-08-01 | 2001-04-17 | International Business Machines Corporation | Visualizing execution patterns in object-oriented programs |
US5892902A (en) * | 1996-09-05 | 1999-04-06 | Clark; Paul C. | Intelligent token protected system with network authentication |
US6055637A (en) * | 1996-09-27 | 2000-04-25 | Electronic Data Systems Corporation | System and method for accessing enterprise-wide resources by presenting to the resource a temporary credential |
US5956036A (en) * | 1997-03-31 | 1999-09-21 | International Business Machines Corporation | Shared modules graphical user interface |
US5953525A (en) * | 1997-03-31 | 1999-09-14 | International Business Machines Corporation | Multi-tier view project window |
US20010008015A1 (en) * | 1997-05-02 | 2001-07-12 | Son Trung Vu | Method and apparatus for secure processing of cryptographic keys |
US6065117A (en) * | 1997-07-16 | 2000-05-16 | International Business Machines Corporation | Systems, methods and computer program products for sharing state information between a stateless server and a stateful client |
US6016394A (en) * | 1997-09-17 | 2000-01-18 | Tenfold Corporation | Method and system for database application software creation requiring minimal programming |
US6282649B1 (en) * | 1997-09-19 | 2001-08-28 | International Business Machines Corporation | Method for controlling access to electronically provided services and system for implementing such method |
US6128621A (en) * | 1997-10-31 | 2000-10-03 | Oracle Corporation | Apparatus and method for pickling data |
US6016497A (en) * | 1997-12-24 | 2000-01-18 | Microsoft Corporation | Methods and system for storing and accessing embedded information in object-relational databases |
US6148342A (en) * | 1998-01-27 | 2000-11-14 | Ho; Andrew P. | Secure database management system for confidential records using separately encrypted identifier and access request |
US6012067A (en) * | 1998-03-02 | 2000-01-04 | Sarkar; Shyam Sundar | Method and apparatus for storing and manipulating objects in a plurality of relational data managers on the web |
US6161182A (en) * | 1998-03-06 | 2000-12-12 | Lucent Technologies Inc. | Method and apparatus for restricting outbound access to remote equipment |
US6233586B1 (en) * | 1998-04-01 | 2001-05-15 | International Business Machines Corp. | Federated searching of heterogeneous datastores using a federated query object |
US6263342B1 (en) * | 1998-04-01 | 2001-07-17 | International Business Machines Corp. | Federated searching of heterogeneous datastores using a federated datastore object |
US6272488B1 (en) * | 1998-04-01 | 2001-08-07 | International Business Machines Corporation | Managing results of federated searches across heterogeneous datastores with a federated collection object |
US6167405A (en) * | 1998-04-27 | 2000-12-26 | Bull Hn Information Systems Inc. | Method and apparatus for automatically populating a data warehouse system |
US6289344B1 (en) * | 1998-05-11 | 2001-09-11 | International Business Machines Corporation | Context-sensitive authorization in an RDBMS |
US6104393A (en) * | 1998-06-11 | 2000-08-15 | International Business Machines Corporation | Integration of procedural and object-oriented user interfaces |
US6279111B1 (en) * | 1998-06-12 | 2001-08-21 | Microsoft Corporation | Security model using restricted tokens |
US6308274B1 (en) * | 1998-06-12 | 2001-10-23 | Microsoft Corporation | Least privilege via restricted tokens |
US6279008B1 (en) * | 1998-06-29 | 2001-08-21 | Sun Microsystems, Inc. | Integrated graphical user interface method and apparatus for mapping between objects and databases |
US6263313B1 (en) * | 1998-08-13 | 2001-07-17 | International Business Machines Corporation | Method and apparatus to create encoded digital content |
US6314449B1 (en) * | 1998-08-28 | 2001-11-06 | International Business Machines Corporation | Method and system for accessing application log messages appearing in a web-based user interface in a distributed network |
US6343286B1 (en) * | 1998-09-24 | 2002-01-29 | International Business Machines Corporation | Efficient technique to defer large object access with intermediate results |
US6292936B1 (en) * | 1998-11-12 | 2001-09-18 | International Business Machines Corporation | Enabling multiple runtime processors in an interpreter-based embedded scripting system |
US6338056B1 (en) * | 1998-12-14 | 2002-01-08 | International Business Machines Corporation | Relational database extender that supports user-defined index types and user-defined search |
US20020002486A1 (en) * | 1999-07-27 | 2002-01-03 | Michael Loeb | Method and system for qualifying consumers for trade publication subscriptions |
US6339777B1 (en) * | 1999-07-30 | 2002-01-15 | International Business Machines Corporation | Method and system for handling foreign key update in an object-oriented database environment |
US6550057B1 (en) * | 1999-08-31 | 2003-04-15 | Accenture Llp | Piecemeal retrieval in an information services patterns environment |
US6601234B1 (en) * | 1999-08-31 | 2003-07-29 | Accenture Llp | Attribute dictionary in a business logic services environment |
US6636845B2 (en) * | 1999-12-02 | 2003-10-21 | International Business Machines Corporation | Generating one or more XML documents from a single SQL query |
US20010019614A1 (en) * | 2000-10-20 | 2001-09-06 | Medna, Llc | Hidden Link Dynamic Key Manager for use in Computer Systems with Database Structure for Storage and Retrieval of Encrypted Data |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080126367A1 (en) * | 2006-11-08 | 2008-05-29 | International Business Machines Corporation | Deletion of Data From Child Tables with Multiple Parents |
US7801921B2 (en) | 2006-11-08 | 2010-09-21 | International Business Machines Corporation | Deletion of data from child tables with multiple parents |
US20100318494A1 (en) * | 2009-06-15 | 2010-12-16 | Microsoft Corporation | Conversion of an application database to minimize time in single-user access mode |
US8165990B2 (en) * | 2009-06-15 | 2012-04-24 | Microsoft Corporation | Conversion of an application database to minimize time in single-user access mode |
Also Published As
Publication number | Publication date |
---|---|
US6947948B2 (en) | 2005-09-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11113250B2 (en) | Techniques for activity tracking, data classification, and in database archiving | |
US6714943B1 (en) | Method and mechanism for tracking dependencies for referential integrity constrained tables | |
US6728719B1 (en) | Method and mechanism for dependency tracking for unique constraints | |
US8200664B2 (en) | Program for capturing data changes utilizing data-space tracking | |
EP2410442B1 (en) | Optimizing search for insert-only databases and write-once data storage | |
US7730097B2 (en) | Smart database | |
US6266662B1 (en) | Bitmap segmentation | |
US7487171B2 (en) | System and method for managing a hierarchy of databases | |
US6161109A (en) | Accumulating changes in a database management system by copying the data object to the image copy if the data object identifier of the data object is greater than the image identifier of the image copy | |
US8140602B2 (en) | Providing an object to support data structures in worm storage | |
US6879986B1 (en) | Space management of an IMS database | |
US6947948B2 (en) | Version-enabled, multi-typed, multi-targeting referential integrity relational database system and methodology | |
US6823334B2 (en) | Metadata system for managing data mining environments | |
US6829616B2 (en) | Method, system, and program for implementing a database trigger | |
US20070088733A1 (en) | Method and system for comparing and re-comparing data item definitions | |
US6820080B2 (en) | Dependent object processing for triggers | |
Almazyad et al. | Incremental view maintenance: an algorithmic approach | |
US20090157775A1 (en) | Archiving method and system | |
US20020087271A1 (en) | Maintaining and reconstructing the history of database content modified by a series of events | |
US7146373B2 (en) | Data-space tracking with index data-spaces and data data-spaces | |
Carter | Table optimizations | |
Nakamura et al. | Extending postgreSQL to handle OLXP workloads | |
Schmidt et al. | Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP | |
Kyte | Datatypes | |
Kyte et al. | Datatypes |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WANG, ANDY I-SHIN;CHOY, DAVID M.;LIANG, LILY L.;AND OTHERS;REEL/FRAME:013175/0374;SIGNING DATES FROM 20020801 TO 20020805 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
REMI | Maintenance fee reminder mailed | ||
FPAY | Fee payment |
Year of fee payment: 8 |
|
SULP | Surcharge for late payment |
Year of fee payment: 7 |
|
FPAY | Fee payment |
Year of fee payment: 12 |