JPH10177578A - Partial totalization database - Google Patents

Abstract

PROBLEM TO BE SOLVED: To improve the response of data base retrieval and totalization by constituting a large-scale table data into a totalization database when the data are retrieved by only using limited keys except such a case that the data are retrieved with all keys by adding retrieval conditions to the keys. SOLUTION: A partial totalization database contains a basic data base 1 which is a large-scale table database, a key layout 2 for basic data base which indicates the configuration of key rows in the database 1, and a totalization database 3 corresponding to limited keys containing the retrieval condition of a user. The key rows are indicated by the keys 1-5 in each key and their combinational keys 6-N. In the database 3, small-scale table databases which are constructed by hierarchizing the basic databases provided corresponding to the keys containing the retrieval condition of the user and their combination as totalization databases 31-3n.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a search for a base database composed of large-scale table data, and more particularly to a part for hierarchizing a base database into small-scale table data by using keys or key combinations to speed up a search response. Regarding the summary database.

[0002]

2. Description of the Related Art In the case of a database that performs search and aggregation from various angles, such as a sales aggregation file, a date or an organization, a customer, a supplier, a product, or the like is designated by a key or a key of the key according to a user's request. Aggregation is required in combination. In order to perform this totaling, necessary keys are totaled from the table data using a key having access or a combination key thereof as a search condition. On the other hand, it is natural that the number of required keys or required key combinations increases for the convenience of the user. However, as a database, an increase in data accumulated through use and diversification of search conditions due to user requests lead to a deterioration in search response. As a result of responding to various user requests, the expansion of the table data is unavoidable, but the deterioration of the search response significantly impairs the user's convenience.

[0003]

A first problem in the above-mentioned prior art is that the number of keys of table data increases with an increase in required search conditions, and the search response deteriorates. The reason is that the index information and the data amount increase as a result of the convenience of the user. An object of the present invention is to improve the response by hierarchizing a database search / aggregation in a case where a search is performed using only a limited key, except when a search is performed by adding all keys to a search condition. .

[0004]

For this reason, the present invention is characterized in that a large-scale base database is hierarchized into a key database including search conditions of a user or an aggregation database corresponding to a combination of the keys. And

[0005] Since a search can be performed on a partial tabulation database that includes search conditions input by a user, the number of populations to be searched is reduced, and deterioration of search responses can be prevented.

[0006]

Next, the present invention will be described with reference to the drawings. FIG. 1 shows a configuration of an embodiment of the present invention.
, A base database 1 which is large-scale table data, a base database key layout 2 showing a configuration of key columns of the base database 1, and a total database 3 corresponding to limited keys including a user search condition. And The key sequence is represented by keys 1 to 5 and a combination of keys 6 to N. Total database 3
Aggregate databases 31 to 3n are hierarchies of small table databases, which are provided in correspondence with the keys including the search conditions of the user and the combinations thereof, and in which the base database is hierarchized. Each of the tallying databases 31 to 3n corresponds to a limited key including a search condition of the user, and the tallying database 31 of the key 1 and the tallying database n of the key N-2.
-2, a total database n-1 for the key N-1, and a total database n for the key N.

Next, referring to FIG. 2 showing a search operation for the tallying database 1, a search condition input from the input device 4 is determined (step 41), and a tallying database 31 to thirty-one corresponding to a key input of the search condition is determined. 3n (steps 41 to 4).
n). The search result is displayed in response to the input device, and the user recognizes the search result on the display and performs a desired search again. When a lower order search is required, the base database 1 is searched using “other than the above” as a search condition (step 4n).
+1). According to the above description, since search targets are narrowed down to the tallying databases 31 to 3n, the search response time is reduced.

[0008]

As described above, the first effect of the present invention is that the retrieval response can be shortened even when the number of data in the base database is enormous. When the trial example is presented, FIG.
As shown in the table, when the search condition is set to five levels and the total database and the base database for each are searched, the top key and the fourth hierarchy key are about several tenths, and the bottom key is the base database. It does not change because it is a search. From this result, it is possible to see the effect of reducing the number of populations of the search target data because the base database is converted into a total database for each search key.

[Brief description of the drawings]

FIG. 1 is a diagram showing a configuration of an embodiment of the present invention.

FIG. 2 is a flowchart showing a search operation of the embodiment of FIG.

FIG. 3 is a diagram illustrating a search result of a specific example based on the embodiment of FIG. 1;

[Explanation of symbols]

 Reference Signs List 1 key database 2 key layout of database table 3 total database 4 input device 21 key configuration 31 to 3n total database

Claims (2)

[Claims] 1. A partial summary database, wherein a large-scale base database is hierarchized into a summary database corresponding to a key including a user search condition or a combination of the keys. 2. The partial tabulation database according to claim 1, wherein the base database and the tabulation database are tabular data, respectively.