Domain based partitioning and reclustering of relations in object-oriented relational database management systems

• US 5,448,727 A
• Filed: 04/30/1991
• Issued: 09/05/1995
• Est. Priority Date: 04/30/1991
• Status: Expired due to Term

• Current Assignee: Hewlett-Packard Company (HP Inc.)
• Original Assignee: Hewlett-Packard Company (HP Inc.)
• Inventors: Annevelink, Jurgen
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): ELLCESSOR, LARR
• Application Number:
  US07/693,826
• Time in Patent Office: 1,589 Days
• Field of Search: 364/200, 364/300, 364/283.1, 364/283.2, 364/283.3, 364/283.4, 395/600, 395/650
• US Class Current: 1/1
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

Abstract

A system and method of logically and physically clustering data (tuples) in a database. The database management system of the invention partitions (declusters) a set of relations into smaller so-called local relations and reclusters the local relations into constructs called domains. The domains are self-contained in that a domain contains the information for properly accessing and otherwise manipulating the data it contains. In other words, the data objects stored in the domains may be stored in a particular domain based upon a locality-of-reference algorithm in which a tuple of data is placed in a domain if and only if all objects referenced by the tuple are contained in the domain. On the other hand, the data objects stored in a domain may be clustered so that a tuple of data is placed in a domain based on the domain of the object referenced by a particular element of the tuple. By clustering the related object data in this manner, the database management system may more efficiently cache data to a user application program requesting data related to a particular data object. The system may also more efficiently lock and check-in and check-out data from the database so as to improve concurrency. Moreover, versioning may be more readily supported by copying tuples of a particular domain into a new domain which can then be updated as desired.

Claims

1. A relational database management system for storing and manipulating data objects having object identities for use as arguments to database functions, comprising:

means for defining and manipulating tuples of data representing domain based relationships of said data objects;

a relational database having storage tables therein for storing said tuples; and

storage management means for partitioning said storage tables, in accordance with domain based relationships of said data objects, into a plurality of local tables and for clustering said local tables into domains comprising collections of said local tables, each of said domains comprising a collection of local tables for storing a collection of data objects and the domain based relationships of said collection of data objects to other data objects in said relational database.

2. A system as in claim 1, wherein said means for defining and manipulating tuples comprises a user system having means for processing a user application program and a cache memory accessible by said user application program via said storage management means.

3. A system as in claim 2, wherein said storage management means caches tuples of a domain into said cache memory for controlling access by said user application program.

4. A system as in claim 1, wherein said relational database stores an input tuple in a local table corresponding to a domain in which all data objects referenced by data within the input tuple are contained.

5. A system as in claim 4, wherein said storage management means further partitions said storage tables into a global table which stores relationships between data objects in different domains.

6. A system as in claim 1, wherein said relational database stores an input tuple in a local table corresponding to a domain of a data object referenced by a particular data element of said input tuple.

7. A system as in claim 6, wherein said storage management means further partitions said storage tables into a global table which stores tuples not contained in said local tables.

8. A system as in claim 1, wherein a row of a local table stores a tuple, where each tuple comprises an ordered list of values including an object identity of a data object.

9. A system as in claim 1, wherein said storage management means assigns a domain object identity to each of said domains.

10. A system as in claim 9, wherein said storage management means identifies said data objects by composite object identities determined by combining said object identities of said data objects within a particular domain with said domain object identity of said particular domain.

11. A system as in claim 9, wherein said storage management means defines a logical domain which corresponds to a plurality of said domains by specifying an object identity of the logical domain, the name of the logical domain and a set of domains to be contained in the logical domain.

12. A method of partitioning data stored in a relational database in accordance with domain based relationships between data objects having object identities for use as arguments to database functions and of clustering the partitioned data into domains comprising collections of storage tables which allow tuples of application defined data stored therein to be manipulated by an application program, said method comprising the steps of:

storing tuples of data representing domain based relationships of said data objects in at least one storage table of said relational database;

partitioning said at least one storage table into a plurality of local tables in accordance with the domain based relationships of said data objects, each local table being associated with a domain comprising a collection of local tables for storing a collection of data objects and the domain based relationships of said collection of data objects to other data objects in said relational database; and

clustering said local tables within said relational database into respective domains.

13. A method as in claim 12, wherein said storing step comprises the step of storing an input tuple in a local table corresponding to a domain in which all data objects referenced by data within the input tuple are contained.

14. A method as in claim 13, wherein said partitioning step comprises the step of partitioning said at least one storage table into a global table which stores relationships between data objects in different domains.

15. A method as in claim 12, wherein said storing step comprises the step of storing an input tuple in a local table corresponding to a domain of a data object referenced by a particular data element of said input tuple.

16. A method as in claim 15, wherein said partitioning step comprises the step of partitioning said at least one storage table into a global table which stores tuples not contained in said local tables.

17. A method as recited in claim 12, comprising the further step of assigning a domain object identity to each of said domains.

18. A method as recited in claim 17, wherein said assigning step comprises the step of identifying said data objects by composite object identities determined by combining said object identities of said data objects within a particular domain with said domain object identity of said particular domain.

19. A method as in claim 17, wherein said assigning step comprises the step of defining a logical domain which corresponds to a plurality of said domains by specifying an object identity of the logical domain, the name of the logical domain and a set of domains to be contained in the logical domain.

20. A method of manipulating data which is part of and represents related data objects stored in a relational database, comprising the steps of:

storing tuples of data representing domain based relationships of said data objects in at least one storage table of said relational database;

partitioning said at least one storage table into a plurality of local tables in accordance with the domain based relationships of said data objects, each table being associated with a domain comprising a collection of local tables for storing a collection of data objects and the domain based relationships of said collection of data objects to other data objects in said relational database;

clustering said local tables within said relational database into respective domains;

retrieving tuples from selected ones of said respective domains; and

manipulating said retrieved tuples by applying object management operations to data objects within said selected domains.

21. A method as in claim 20, wherein said retrieving step comprises the step of caching tuples in a selected domain into a cache memory accessible by a user application program.

22. A method as in claim 21, wherein said retrieving step comprises the further step of controlling access to said tuples by said user application program on a per domain basis.

23. A method as in claim 20, comprising the further steps of assigning domain object identities to said domains and assigning object identities to said data objects, and wherein said object identities for said data objects within a first domain are composite object identities determined by combining said object identities of said data objects within said first domain with said domain object identity of said first domain.

24. A method as in claim 23, wherein said manipulating step comprises the steps of copying all tuples in said first domain to local tables of a second domain, and assigning said data objects within said second domain composite object identities determined by combining said object identities of said data objects within said first domain with said domain object identity of said second domain.