JP2013516017A - Method and apparatus for storing data - Google Patents

Abstract

A method and apparatus (700) for a hierarchical database (702) that includes a root table that includes one or more attributes each capable of storing object data, and a hierarchical level sub-table. The configuration function (708) assigns a table identifier TID generated by multiplying a series of prime numbers associated with the parent table of each sub-table to that sub-table. The storage function (704) assigns an object identifier OID to each object in the database so that the table identifier TID of the path of sub-tables hierarchically connected at various consecutive levels is encoded into the object identifier OID, and connects Store the data related to that object in the sub-table in the table path.
[Selection] Figure 7

Description

  The present invention generally relates to a method and apparatus for efficiently storing and retrieving data in a database.

  When large amounts of data are stored in the database for different objects, it is useful to organize the data so that relevant data can be easily retrieved when receiving a data query or data request for a particular object It is. Stored data relates to any kind of object information that is logically arranged in various classes or categories of the hierarchical structure. For example, the term “object” is used herein, although other terms such as items, assets, entities, etc. may be further used. Some practical examples of objects that exist in such a database are media items, sales items, telecommunications subscribers, and the like.

  In general, multiple attributes are associated with each object, and data representing such attributes is stored in a database that can be retrieved in response to a data query. In practice, attributes generally form columns in one or more tables of the database. As used herein, the term “attribute” refers to any subject matter, aspect, or feature associated with describing an object. Attributes may be general or unique.

  For example, the media item is divided into classes “moving image” and “still image”, and “moving image” is further divided into classes such as “movie”, “sports”, and “documentary”. In this way, various classes can form a hierarchical structure that can be represented by a database table. Each class is associated with one or more attributes associated with that class.

  FIG. 1 schematically illustrates a hierarchical structure of various classes that can logically organize data for objects. The top of the hierarchy is “Info 1”, “Info 2”, “Info 3”. . . It is a “root class” including the attribute indicated by These attributes indicate general or “abstract” data related to all objects in the database, eg title, description, language, input data, etc., using the example media item. The object identity “object ID” is further specified in this class of fields and identifies each object that can be used as a primary key for searching the data. As an example, the root class is called an “asset class”.

  The next levels are “Info A1”, “Info A2”, “Info A3”,. . . And “Info B1”, “Info B2”, “Info B3”. . . 2 subclasses A and B including the attribute indicating The attributes of each subclass are only relevant for objects that fit that subclass. Using the media item example again, subclass A indicates moving images, its attributes indicate encoding, duration, color, etc., and subclass B indicating still images, for example, other than width, height, resolution, format, etc. With related attributes.

  Similarly, the next level of subclass AA and subclass AB represent movies and sports, respectively, organized under subclass A and each having one or more subclass attributes. All subclasses A, B, AA, BB. . . Has an object ID field and identifies the object that fits the respective subclass.

  Today, relational databases are commonly used to hold data that can be organized in a hierarchical manner based on the classes described above. However, mapping an object or class definition to a database table is associated with a problem. This problem is called "impedance mismatch associated with objects". In the following, three different approaches commonly used in the field of relational databases will be briefly described.

  1) A single table is used for all subclasses and attributes of the entire class hierarchy. Therefore, the table contains columns for all attributes used in the database. In the example of FIG. 1, the table includes all attributes Info 1-3, Info A1-A3, Info B1-B3, Info AA1-AA3, Info AB1-AB3. . . In general, a table has a large number of columns. Thus, a data query requires only one table search when retrieving data for an object. On the other hand, since a single table is generally very large, the readability and performance of the database is low. Also, since many attributes are often unrelated to the object, many columns are empty, i.e. contain null values. Therefore, much space in the database remains unused, and the database becomes larger than necessary. Additional identification information is further required in the database to indicate the type of object.

  2) One table is used for each subclass and includes all attributes associated with objects that conform to that subclass, and those attributes include attributes of all superclasses that connect to that subclass. In the example of FIG. 1, the table for subclass AA includes columns for attributes Info AA1-AA3, Info A1-A3, Info 1-3, and the table for subclass AB includes attributes Info AB1-AB3, Info A1-A3, Info. Includes columns for 1-3. The advantage of this approach is that all data for an object is stored in the same table, and no search in other tables is required. On the other hand, since a table storing data for an object is not recognized, the table must be searched one by one until data is found for the searched object. In addition, since many attributes exist in many tables as in the above example, for example, a large amount of redundancy occurs due to duplication of data, and the database becomes larger than necessary even in this method.

  3) Since one table is used for each subclass and includes only attributes of the subclass, redundancy and duplication of data are avoided. However, in this method, it is not clear how various classes are connected to each other in a hierarchical structure. When searching for object data, the location where the search begins is not known, but using the knowledge of the hierarchy, tables can be selected for searching and other tables can be ignored. Many tables still give a null result, which is very time consuming and wastes processing resources.

  In the three approaches described above using tables in the database, only the third approach needs to join information between the tables. However, as described above, none of the methods can use the storage space effectively, and a quick search cannot be performed. Therefore, a large amount of stored data must be searched to retrieve relevant data in response to an indicated data query or data request for a particular object, which is time consuming and requires a lot of processing resources So it is a problem. Another problem is that the database becomes excessively large as a result of the above-described redundancy and duplication of stored data.

  The object of the present invention is to address at least some of the problems mentioned above. A further object is to obtain a database solution that can avoid duplication and redundancy in the database while at the same time avoiding unnecessary processing delays and the load of searching the database. These and other objects can be realized by using the methods and apparatus described in the attached independent claims.

  According to one aspect, a hierarchy including a root table that includes one or more attributes each capable of storing object data, and a plurality of predefined sub-tables organized at a number of hierarchical levels below the root table A method is provided for processing object-related data in a database. In this method, a table identifier TID is assigned to each sub-table. Here, the table identifier TID is generated by multiplying a series of prime numbers associated with the parent table of the sub-table. Furthermore, the object identifier OID is assigned to each object in the database so that the table identifier TID of the path of sub-tables connected hierarchically at various successive levels is encoded into the object identifier OID. Data about the object is stored in a subtable connected to the table path as appropriate.

  Thereby, it is possible to avoid duplication and redundancy of stored data in the database due to the repeated attributes of a plurality of tables. At the same time, encoding the valid table and valid table path for the searched object into the object identifier OID can limit the search for data to where the data about the object is expected to be found, thereby reducing processing delays and The load for searching the database can be minimized.

  According to another aspect, an apparatus is provided that is configured to process object related data in a hierarchical database as described above. The database device includes a configuration function configured to assign a table identifier TID generated by multiplying a series of prime numbers associated with the parent table of each sub-table to the sub-table. The database device assigns an object identifier OID to each object in the database so that the table identifier TID of the path of the sub-tables hierarchically connected at various successive levels is encoded into the object identifier OID, and connects the connected sub-tables. A storage function configured to store data relating to the object of the table in a table path is further included.

  The method and database device described above are configured and implemented according to various embodiments. In one embodiment, the table identifier TID is generated for the sub-table by multiplying the next available prime number of the parent table by the parent table identifier PID of the parent table of the adjacent-level sub-table. Thereby, the table path is easily encoded into a single number used as the object identifier OID using prime factorization.

  In another embodiment, the data associated with the object determines a table path that includes an identified sub-table associated with the object and a parent table hierarchically connected to the sub-table, The object identifier OID is assigned to the object calculated from the table identifier TID of the table, and the data and the object identifier OID are stored in the path table, and stored in the database.

The object identifier OID is calculated as OID = 2 ^k · n + TID. Where ^k is an integer selected to set 2 ^k as the maximum value of the table identifier TID in the database hierarchy, and n is the sequence number for the determined object of the associated subtable. Thus, the table identifier TID is encoded into the object identifier OID, and all the parent table identifiers PID are determined from the table identifier TID by the prime factorization.

  In a further embodiment, when receiving a data query regarding the object identifier OID of the requested object, the object related data from the database is calculated by calculating a table identifier TID of a sub-table associated with the requested object from the received object identifier OID. Can be searched. Next, the table path encoded in the received object identifier OID is determined by calculating the parent table identifier PID at successive levels until reaching the route table. The object data is then retrieved from the table in the determined table path, and the retrieved data is finally returned in response to the data query.

The table identifier TID of the sub-table associated with the requested object is calculated as TID = mod (OID, 2 ^k ). Where ^k is an integer selected to set 2 ^k as the maximum value of the table identifier TID in the database hierarchy, and OID is the received object identifier. Each parent table identifier PID is calculated by dividing the current table identifier TID by the maximum prime factor.

In a further embodiment, the new sub-table is added to the database by calculating the table identifier PID for the new sub-table by multiplying the table identifier PID of the parent table by the next available prime number. If the calculated table identifier TID does not fall below 2 ^k , k is incremented by 1 and the object identifier OID of the object stored in the database is updated according to the new k. k is an integer selected to set 2 ^k as the maximum value of the table identifier TID in the database hierarchy. A new sub-table is added to the database using the calculated table identifier TID.

  Further possible features and advantages of the present invention will become apparent from the following detailed description.

  The invention will now be described in more detail using exemplary embodiments and with reference to the accompanying drawings.

FIG. 1 is a diagram illustrating an exemplary hierarchical structure that includes various classes of object information. FIG. 2 is a schematic block diagram illustrating a method by which a data query can be processed by a logical search function according to one possible embodiment. FIG. 3 is a schematic diagram illustrating an exemplary database structure according to another possible embodiment. FIG. 4 is a flowchart including steps performed by a logical storage function for storing object data in a database according to a further exemplary embodiment. FIG. 5 is a flow chart that includes steps performed by a logical search function that searches object data in a database in accordance with a further exemplary embodiment. FIG. 6 is a flow chart that includes steps performed by a logical configuration function that adds a new table to a database in accordance with a further exemplary embodiment. FIG. 7 is a block diagram illustrating in more detail an apparatus including a logical storage function, a logical search function, and a logical configuration function connected to a database in accordance with a further exemplary embodiment.

  Briefly described, a solution is provided in which tables associated with various logical classes or categories are arranged hierarchically to efficiently store object data and to be quickly retrieved from a database. Each table includes one or more attributes arranged in columns, or the like, that can store data for various objects. The database is basically constructed according to the above method 3), i.e. using only one table for each subclass containing only the attributes of that subclass. In this case, attributes and stored data in many tables do not necessarily overlap. Thus, the database is logically organized in a hierarchical structure of tables, for example, according to the scheme shown in FIG. 1, including a root table at the highest level in the hierarchy and a number of sub-tables at the lower level. According to the terminology used herein, a “parent table” is a table in which one or more subordinate subtables are connected in a hierarchical structure. Therefore, each sub-table is connected to the parent table.

  In the solution of the present invention, an object identifier “OID” is assigned to each object stored in the database, and the identities of all interconnected sub-tables associated with a particular object are the OID of that object. Is effectively encoded. Therefore, the table related to the search can be determined only from the OID of the requested object, and there is no need to search for a further table, so basically any unnecessary search is avoided. At the same time, tables that are not related to the searched object are exempt from the search target.

  Each table in the database is assigned a table identifier “TID” having a number that can be encoded in the object identifier OID as follows. Each TID is generated by multiplying a series of prime numbers. Therefore, the TID of the subtable connected to the parent table is the “next available prime number”, that is, the prime number that has not yet been used to generate any other subtable connected to the parent table. It is generated by multiplying the TID of the table. In the following, this will be described in more detail using an example.

  Thus, all subtables connected to a parent table must have a prime factor greater than the parent table's gretest prime number factor, and each prime is generated by the parent table as a dependent subtable. Used only once to do. For example, if primes 7, 11, and 13 are used to generate TIDs for three specific sub-tables connected to a specific parent table with TID = 5, then the next available prime number is 17 Yes, a new sub-table TID is generated by multiplying 17 by the parent table TID. As a result, TID = 5 · 17 = 85. Thus, the other three sub-tables connected to the parent table containing TID = 5 have TID = 5 · 13 = 65, TID = 5 · 11 = 55 and TID = 5 · 7 = 35, respectively. By generating the TID in this way, each table in the database is assigned a unique TID.

  It is assumed that the database structure and table hierarchy are known because they are predetermined, and the sub-table most relevant (lowest) to a given object can be logically determined. The object data is further stored in the parent table to which the lowest most related subtable is connected. Thus, since all tables in the path of interconnected tables are valid for a given object, a continuous hierarchy that must be searched whenever a data query on the OID of that object is executed Form that table path by level. However, the process of logically identifying the subtable most relevant to an object when storing data is outside the scope of the present invention.

Thus, the OID is determined by first logically identifying or determining the most relevant subtable for the object, and then using the TID of that subtable to generate an OID for the object as follows: Assigned to an object.
OID = 2 ^k・ n + TID (1)

In Equation (1), k is an integer selected to set 2 ^k as the maximum value of TID in the entire database hierarchy, and n is the sequence number for the determined related sub-table object. Thus, for example, a first object stored in sub-table TID has n = 1 and a second object in that sub-table has n = 2. In practice, the parameter k is the number of bits necessary to store the maximum value of TID. For example, since 8 binary bits can be used to indicate the value 256, the maximum TID = 256 when k = 8. If TID> 256 is required for a new table in the database, k must be incremented by 1, thus affecting the OID already generated for the stored object. As a result, whenever k is incremented to give “space” to a higher TID value in the database, the OID of the object already stored in the database must be updated according to the new k value in equation (1). Don't be.

  Next, with reference to FIG. 2, a method capable of processing a data query by the logic search function will be described. The search function 200 is configured to search for object data in the hierarchical database 202 upon receiving a search query or search request for object data as follows. The database 202 is basically configured as described above.

If a search query is received regarding the OID of the object being searched, the search function 200 will probably return the received OID, which indicates the (lowest) sub-table most relevant to the requested object, as shown in block 204. Determine the maximum encoded TID value. Since all TIDs of the database are generated by multiplying prime numbers as described above, the maximum TID value encoded in the OID is calculated as follows.
TID = mod (OID, 2 ^k ) (2)
In the formula, “mod” is a remainder operator that determines an integer remainder after dividing the OID by 2 ^k .

  The search function 200 then extracts all lower TIDs in the interconnected sub-table path by identifying the prime number that generates the first TID, as shown in block 206. Since each of the sub-tables TID is generated from the parent table TID as described above, that is, it is generated by multiplying the “next available prime number” by the TID of the parent table, this calculation is possible. is there. Basically, the TID determined by (2) in block 204 described above is a prime number factorized in block 206.

  If all table TIDs have been determined in the table path, the data searches for objects in the database 202 accordingly, as shown in block 208. Since the object's data cannot be expected to exist in any other table outside the path, such a search is limited to the determined path table only. Thus, the determined table path is valid for the object when encoded into OID. Finally, as shown in block 210, the search results, i.e., the data found, can be returned to the query requester.

  3 shows a route table at the highest level 300 in the hierarchy, followed by lower layers 302, 304, 306. . . Shows a TID method for a database organized in a hierarchical structure of tables including a large number of sub-tables. The TID of the table is given in the indicated spot. And the prime number used to generate the underlying TID is given by each connection arrow. The route table has TID = 1 and the three sub-tables shown at level 302 below are generated by multiplying a series of prime numbers, ie 2, 3 and 5, by 1, resulting in TID 2, 3 respectively. And a TID of 5. At the next level 304, the four sub-tables are generated by multiplying a series of prime numbers, ie 3, 5, 7, and 11, by 2, resulting in a parent having TIDs resulting in TIDs 6, 10, 14, and 22, respectively. Connected to table 2.

  For example, a similar calculation for TID is generated by multiplying a series of prime numbers, ie 5, 7, 11 and 13, by 3 and results in a parent table 3 having TIDs of TIDs 15, 21, 33 and 39 respectively. This is done for the four connected sub-tables. Each TID is generated by multiplying the TID of the parent table by the next available prime number, that is, a prime number not used for any other sub-table connected to the parent table. Thus, because each prime used to generate the underlying TID is used only once for each parent table, the term “next available prime” is used for all tables in the database. Guaranteed to be unique.

  Next, an exemplary procedure for storing data relating to a new object in a database will be described with reference to the flowchart of FIG. This procedure is executed by a “data storage function” connected to the database in the database device. Assume that the database includes a root table and a plurality of predefined sub-tables organized in a number of hierarchical levels below the root table, each table including one or more attributes that can store object data. To do. It is further assumed that the table identifier TID generated by multiplying a series of prime numbers associated with each parent table as described above is assigned to each sub-table.

  In a first step 400, data associated with the object is received for storage in a database. In the next step 402, the sub-table most relevant to the object and assigned TID is basically received in the data storage function. Identifying the subtable most relevant to an object is a logical operation that depends on the properties of the object and the definition of the predefined subtable in the database. The operation of identifying related sub-tables is performed manually to some extent by an administrator or automatically according to preset logic, for example based on the type of object and / or stored data. However, the details of this operation are outside the scope of the present invention.

  Once the most relevant sub-table and assigned TID are determined, a valid table path including the parent table that is subsequently interconnected to the upper layer in the hierarchy is determined from the TID of the associated sub-table in a subsequent step 404. The In this specification, the TID for the parent table is also indicated as a parent table identifier “PID”. The parent table is determined such that each parent table identifier PID is calculated one by one by dividing the current table identifier TID by the maximum prime factor. Using the example table structure of FIG. 3, a result that can determine that the most prime factor is 11 if the most relevant table is identified as a sub-table with TID = 231 located at the fourth hierarchical level 306, for example. , A parent table including TID = 2311/11 = 21 is obtained. Further, as a result of this sub-table having 7 as the largest prime factor, the next parent table including TID = 21/7 = 3 is obtained. When the route table is reached, the determination of this table path basically ends.

In a further step 406, the OID is calculated using equation (1) above, using as input the TID of the most relevant sub-table identified in step 402 above, assigned to the object. As described above, k is an integer selected to set 2 ^k as the maximum value of TID in the entire database hierarchy, and n is the sequence number for the determined related sub-table object. The sequence number n is set for an object as a unique object number in the table, eg, the next available number that is not used for any other previous object in the table. Finally, in step 408, the object data received in step 400 and the OID calculated and assigned in step 406 are stored in the table of the table path determined in step 404 as appropriate. Depending on the data that can be stored, it is not necessary to input data to all attributes of the path table in this step.

  Next, an exemplary procedure for searching for data associated with a new object in the database will be described with reference to the flowchart of FIG. This procedure is executed by a “data search function” or the like connected to the database in the database device. Again, assume that the database includes a route table, each containing one or more attributes, and a sub-table below the route table. It is further assumed that the table identifier TID generated by multiplying prime numbers as described above is assigned to each sub-table.

In a first step 500, a data query for an object's OID is received from a query requester. In the next step 502, the TID of the table most relevant to the object is calculated from the received OID using equation (2) above. As a result, the highest TID value encoded in the OID is obtained. For example, if k is set to 10, 2 ^k = 1024. If the received OID is 4369, mod (OID, 2 ^k ) = 273. This is an integer remainder when OID / 2 ^k = 4369/1024 = 4 + 273/1024. Therefore, TID = 273, and it happens to exist in FIG. Since 13 is the maximum prime factor of 273, the parent table with TID = 273 can be identified as PID = 273/13 = 21.

  In a further step 504, the maximum prime factor of the calculated TID is determined and the next PID of the parent table connected to the first sub-table is derived from that by dividing the previously calculated TID by the maximum prime factor. Calculated. Next, in step 506, it is determined whether the route table has already been reached. If not reached yet, the process returns to step 504, and the next PID is calculated by continuously dividing the previously calculated PID by the maximum prime factor. Thus, steps 504 and 506 are repeated to find the parent table one by one until the route table is reached.

  When it is determined in step 506 that the route table is finally reached, the valid table path determination is completed, and the object data can be searched from the table in the path according to the TID / PID calculated in the next step 508 and extracted. As described above, it is not necessary to search every table other than in the determined table path. Thereafter, in the last shown step 510, the retrieved object data is returned to the query requester.

  Next, an exemplary procedure for extending the database by adding a new table will be described with reference to the flowchart of FIG. This procedure is executed by a “database configuration function” or the like connected to the database in the database device. Again, assume that the database includes a route table, each containing one or more attributes, and a sub-table below the route table. It is further assumed that the table identifier TID generated by multiplying prime numbers as described above is assigned to each sub-table.

  In this example, for example, if an object with new features that does not fit in some way with an existing table definition is stored in the database, or a specific existing table is implemented in a very large amount of stored data and searched there Further assume that it is desirable to add a new table to the table hierarchy if it needs to be subdivided to facilitate. In the first shown step 600, information about the new table is generally received at a database configuration function defined, for example, by setting a name for the table and defining attributes. This detail is outside the scope of the present invention. It is further determined where the new table should be located in the table hierarchy. That is, the parent table is determined.

In the next step 602, a TID is generated for the new table by multiplying the PID of the parent table by the next available prime number in the manner described above. Then in a subsequent step 604, the generated TID is checked or not reach the parameter 2 ^k which is set as the maximum value of the TID in the whole database hierarchy.

If the generated TID is greater than or equal to parameter 2 ^{k in} step 604, k is incremented by 1, as shown in step 606, ie k = k + 1, and additional “space” for larger TIDs in the database. And the OID already stored in the database must be updated based on the newly incremented k. As described above, each OID is calculated according to the equation (1). On the other hand, if the generated TID is less than parameter 2 ^{k in} step 604, step 606 is excluded because the current value of k can be maintained and no OID update is required. Finally, in the last shown step 608, a new table can be added to the database.

  Next, the database apparatus will be described in more detail with reference to the block diagram of FIG. Although not shown in FIG. 7, the database device 700 processes object related data in a hierarchical database 702 that includes a root table and a plurality of predefined sub-tables organized at a number of hierarchical levels below the root table. Configured to do. Each table includes one or more attributes that can store object data. The database device 700 is used to perform any of the procedures and embodiments described above. The various functions of the database device 700 are also considered as units, blocks, elements or components, but are referred to herein as “modules”.

  The illustrated database device includes a storage function 704, a search function 706, and a configuration function 708. The configuration function 708 is configured to assign a table identifier TID generated by multiplying a series of prime numbers associated with the parent table of each sub-table to that sub-table. The storage function 704 assigns an object identifier OID to each object in the database so that the table identifier TID of the path of sub-tables hierarchically connected at various consecutive levels is encoded into the object identifier OID, and is connected. It is configured to store data related to the objects in the subtable in the table path.

  The configuration function 708 is further configured to generate a table identifier TID for the sub-table by multiplying the next available prime number of the parent table by the parent table identifier PID of the parent table of the adjacent level sub-table. The For example, TID = 399 at level 306 as shown in FIG. 3 is generated by multiplying the next available prime number 19 by PID = 21. In this case, that is 21 · 19 = 399.

  In FIG. 7, the storage function 704 includes a determination module 704a configured to determine a table path that includes an identified sub-table and a parent table that is hierarchically connected to the sub-table, and a determined associated sub-table. An allocation module 704b configured to allocate the object identifier OID to the object calculated from the table identifier TID of the table, and a storage module 704c configured to store the data and the object identifier OID in the path table are included.

The allocation module is further configured to calculate the object identifier OID as OID = 2 ^k · n + TID. Where ^k is an integer selected to set 2 ^k as the maximum value of the table identifier TID in the database hierarchy, and n is the sequence number for the determined object of the associated subtable.

  The illustrated database device further includes a search function 706 configured to determine, based on the received object identifier OID, a table to search when a data query regarding the object identifier OID of the requested object is received. . The search function 706 includes a calculation module 706a configured to calculate the table identifier TID of the sub-table most relevant to the requested object from the received object identifier OID. The search function 706 includes a determination module 706b configured to determine a table path encoded in the received object identifier OID by calculating a sequential level parent table identifier PID until the route table is reached. And a search module 706c configured to retrieve the object data from the table in the configured table path and return the retrieved data in response to the data query.

The calculation module 706a is further configured to calculate the table identifier TID of the most relevant sub-table as TID = mod (OID, 2 ^k ). Where ^k is an integer selected to set 2 ^k as the maximum value of the table identifier TID in the database hierarchy, and OID is the received object identifier. The determination module 706b is further configured to calculate each parent table identifier PID by dividing the current table identifier TID by the maximum prime factor.

The configuration function 708 includes a calculation module 708a configured to calculate a table identifier TID for a new sub-table added to the database by multiplying the table identifier PID of the parent table by the next available prime number of the parent table. Including. The configuration function 708 further includes an update module 708b. If the calculated table identifier TID does not fall below 2 ^k , the update module 708b is configured to increment k by 1 and update the object identifier OID of the object stored in the database according to the new k. k is an integer selected to set 2 ^k as the maximum value of the table identifier TID in the database hierarchy. The configuration function 708 further includes an add module 708c configured to add a new sub-table to the database using the calculated table identifier TID.

  Note that those skilled in the art can freely implement these functions using appropriate software means and hardware means, but FIG. 7 shows various functional units or functional modules in the database apparatus in a logical sense. It just shows. Thus, in general, the present invention is not limited to the structure of each of the functions 704, 706, and 708 shown, and the functional modules 704a-704c, 706a-706c, and 708a-708c are described above with respect to FIGS. Configured to operate according to methods and procedures.

  Although the invention has been described with reference to specific exemplary embodiments, in general, the specification is intended only to illustrate the concepts of the invention and should not be construed as limiting the scope of the invention. . The invention is defined by the appended claims.

Claims (17)

A method for processing object related data in a hierarchical database comprising a root table and a plurality of predefined sub-tables organized at a number of hierarchical levels below said root table, wherein each table is an object Contains one or more attributes that can store data,
A table identifier TID is assigned to each sub-table,
Wherein the table identifier ID is generated by multiplying a series of prime numbers associated with the parent table of the sub-table;
The object identifier OID is assigned to each object in the database such that the table identifier TID of the path of sub-tables hierarchically connected at various successive levels is encoded into the object identifier OID;
Wherein the data about the object is stored in the connected sub-table in the table path.   The table identifier TID for one sub-table is generated by multiplying a parent table PID of a parent table of the sub-table at an adjacent level by a prime number that can be used next to the parent table. The method according to 1. To store data related to objects in the database,
Determining a table path including an identified sub-table associated with the object and a parent table hierarchically connected to the sub-table;
Assigning an object identifier OID to the object calculated from the table identifier TID of the determined related sub-table;
The method according to claim 1, further comprising: storing the data and the object identifier OID in the table of the path. The object identifier OID is calculated as OID = 2 ^k · n + TID.
Here, k is an integer selected to set 2 ^k as the maximum value of the table identifier TID in the database hierarchy, and n is a sequence number for the determined related sub-table object. The method according to claim 3. To retrieve object related data from the database upon receiving a data query for the object identifier OID of the requested object;
Calculating a table identifier TID of a sub-table associated with the requested object from the received object identifier OID;
Determining the table path encoded in the received object identifier OID by calculating successive levels of the parent table identifier PID until reaching the route table;
Retrieving object data from the table in the determined table path;
The method according to any one of claims 1 to 4, comprising the step of returning the retrieved data in response to the data query. The table identifier TID of the sub-table associated with the requested object is calculated as TID = mod (OID, 2 ^k ), where k is 2 as the maximum value of the table identifier TID in the database hierarchy. 6. The method of claim 5, wherein ^k is an integer selected to set and OID is the received object identifier.   The method according to claim 5 or 6, wherein each of the parent table identifiers PID is calculated by dividing the current table identifier TID by the maximum prime factor. To add a new subtable to the database,
Calculating a table identifier TID for the new sub-table by multiplying the table identifier PID of the parent table by a next available prime number;
If the calculated table identifier TID is not less than 2 ^k , increment k by 1 and update the object identifier OID of the object stored in the database according to the new k;
Where k is an integer selected to set 2 ^k as the maximum value of the table identifier TID in the database hierarchy;
The method according to claim 1, further comprising: adding the new sub-table to the database using the calculated table identifier TID. A database device (700) configured to process object related data in a hierarchical database (702) comprising a root table and a plurality of predefined sub-tables organized at a number of hierarchical levels below the root table. Where each table includes one or more attributes that can store object data;
A configuration function (708) configured to assign a table identifier TID generated by multiplying a series of prime numbers associated with a parent table of each sub-table to the sub-table;
Assigning the object identifier OID to each object in the database such that the table identifier TID of the path of sub-tables hierarchically connected at various successive levels is encoded into the object identifier OID, and the connected A storage function (704) configured to store data relating to the object of the sub-table in the table path;
A database apparatus (700) comprising:   The configuration function (708) multiplies the next available prime number of the parent table by the parent table identifier PID of the parent table of the sub-table of the adjacent level, and thereby adds the table identifier TID to the sub table. The apparatus of claim 9, further configured to generate. The storage function (704)
A determination module (704a) configured to determine a table path including an identified sub-table associated with the object and a parent table hierarchically connected to the sub-table;
An assignment module (704b) configured to assign an object identifier OID to the object calculated from the table identifier TID of the determined related sub-table;
11. A device according to claim 9 or 10, comprising a storage module (704c) configured to store the data and the object identifier OID in the table of the path. The allocation module is further configured to calculate the object identifier OID as OID = 2 ^k · n + TID;
Here, k is an integer selected to set 2 ^k as the maximum value of the table identifier TID in the database hierarchy, and n is a sequence number for the determined related sub-table object. The apparatus according to claim 11.   The method further comprises a search function 706 configured to determine a table to search when a data query regarding the object identifier OID of the requested object is received based on the received object identifier OID. Item 13. The device according to any one of Items 9 to 12. The search function (706)
A calculation module (706a) configured to calculate a table identifier TID of a sub-table associated with the requested object from the received object identifier OID;
A determination module (706b) configured to determine a table path encoded in the received object identifier OID by calculating a sequential level parent table identifier PID until reaching the route table;
A search module (706c) configured to retrieve object data from the table in the determined table path and return the retrieved data in response to the data query. 13. The apparatus according to 13. The calculation module (706a) calculates the table identifier TID of the sub-table associated with the requested object as TID = mod (OID, 2 ^k ), where k is the table identifier in the database hierarchy a selected integer to set the 2 ^k as the maximum value of the TID, OID apparatus according to claim 14, characterized in that the object identifier to the received.   The apparatus according to claim 14 or 15, wherein the determination module (706b) is further configured to calculate each of the parent table identifiers PID by dividing the current table identifier TID by a maximum prime factor. . The configuration function (708)
A calculation module (708a) configured to calculate a table identifier TID for a new sub-table added to the database by multiplying the table identifier PID of the parent table by the next available prime number of the parent table; ,
If the calculated table identifier TID is not less than 2 ^k, increments k by 1, and update module to update the object identifier OID of the object the stored in the database according to the new k (708b )When,
Where k is an integer selected to set 2 ^k as the maximum value of the table identifier TID in the database hierarchy;
17. An add module (708c) configured to add the new sub-table to the database using the calculated table identifier TID, according to any one of claims 9 to 16 The device described.

Images