Data processing: database and file management or data structures – Database design – Data structure types
Patent
1996-03-29
1998-09-22
Lintz, Paul R.
Data processing: database and file management or data structures
Database design
Data structure types
G06F 1730
Patent
active
058129987
DESCRIPTION:
BRIEF SUMMARY
TECHNICAL FIELD
This invention relates to a database management method and apparatus as well as a database search method and apparatus.
BACKGROUND ART
When a database having a table format is searched, generally use is made of a sequential search as the search method. A database having a table format includes a plurality of data sets which contain identification-code data for identifying the data sets and classification data with regard to respective ones of a plurality of items. The search of a database is conducted by giving the classification to be searched as a keyword. However, since the structure of a database having a table format is fixed, it is difficult to conduct a search at high speed.
There is an apparatus in which data having common items are collected together by a filing device, which correlates and files a plurality of data extending over a plurality of items, thereby creating group data, the group data are filed in a magnetic disk device, group data corresponding to a search command are selected when the search command has been applied, and data corresponding to the search command are extracted from the group data selected. (For example, see Japanese Patent Application Laid-Open No. 2-19968.)
However, the common items in the group data are fixed on a group-data basis even in such a file apparatus. As a consequence, when a new search command different from that of the common item is applied, a rapid search is difficult.
DISCLOSURE OF THE INVENTION
An object of the present invention is to shorten the time needed for searching and conduct a comparatively efficient database search.
A database management method according to a first aspect of the present invention is a method of organizing one or a plurality of sub-databases from an original database comprising a collection of data sets containing identification numbers and including classification data on an item-by-item basis, characterized by giving a search condition designating one or a plurality of classifications to be searched, and organizing the one or a plurality of sub-databases comprising a collection of data sets having the designated classification of the given search condition in common.
An apparatus for executing the method according to the first aspect of the invention also is provided. Specifically, the apparatus is an apparatus for managing an original database comprising a collection of data sets containing identification numbers and including classification data on an item-by-item basis, characterized by comprising an input unit for accepting a search condition designating one or a plurality of classifications to be searched, and sub-database organizing means for organizing one or a plurality of sub-databases comprising a collection of data sets having in common the designated classification of the given search condition accepted by the input unit.
In accordance with the first aspect of the invention, when a search condition is given, one or a plurality of sub-databases comprising a collection of data sets having the designated classification of the given search condition in common are organized. Accordingly, the next time the same search condition or a closely resembling search condition is given, search time is shortened and an efficient search can be conducted.
A database management method according to a second aspect of the invention is a method of reorganizing sub-databases when there is at least one of an original database comprising a collection of data sets containing identification codes and including classification data on an item-by-item basis, and one or a plurality of sub-databases, created based upon the original database, comprising a collection of data sets having a specific classification in common, characterized by storing designated classifications contained in a search condition whenever the search condition, which designates one or a plurality of classifications to be searched, is given, calculating degrees of similarity between designated classifications having a high frequency of occurrence amo
REFERENCES:
patent: 4839853 (1989-06-01), Deerwester et al.
patent: 5423035 (1995-06-01), DePrez
patent: 5483650 (1996-01-01), Pedersen et al.
patent: 5544352 (1996-08-01), Egger
patent: 5576954 (1996-11-01), Driscoll
patent: 5600829 (1997-02-01), Tsatalos et al.
patent: 5619709 (1997-04-01), Caid et al.
Supplementary European Search Report, Oct. 20, 1997.
Chang, Shi-Kuo and Wu-Haung, Cheng, "A methodology for Structured Database Decomposition", IEEE Transactions on Software Engineering; vol. SE-6:2, Mar 1980.
Subieta, K. and Rzeczkowski, W., "Query Optimization by Stored Queries", Proceedings of the Thirteenth international Conference on Very Large Databases: 1987 13th VLDB, pp. 369-380.
Nakajima Hiroshi
Tashima Toshihiro
Tsutsumi Yasuhiro
Lintz Paul R.
Omron Corporation
LandOfFree
Similarity searching of sub-structured databases does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Similarity searching of sub-structured databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Similarity searching of sub-structured databases will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1635161