JP3318844B2 - Database search processing method by schematizing sets - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a personal computer system or a work provided with a graphic display device and a pointing device such as a mouse in use of a commercial database service, a business database in a company and a personal database. The present invention relates to a database search processing method using a station system.

[0002]

2. Description of the Related Art In a conventional database search processing method, a search condition formula is described by using an instruction of an inquiry language program provided by a database system, and is input by a keyboard device. In general, data elements are output in a response message in a character format to a display device such as a display device.

[0003]

In the database search, there are a logical problem in thinking of recognizing an object and a technical problem in operation for finding the object. The logical task is to analyze the requirements of the abstract object, understand the set of objects in the database, and create specific search conditions to limit the set, based on the knowledge and understanding in the target field, and The purpose is to evaluate and judge a set obtained based on the search result, and to create an optimum search condition for more appropriately limiting a target. The technical problem is that a command of a query language program that searches for a target object with knowledge of computer operation, database configuration information such as file names and field names, and knowledge of the notation or grammar of the query language. Is described and input.

It is an object of the present invention to present the quantity of a database search set and the logical relationship between the sets by a diagram shown in FIG. , A graphical user interface that allows a user to specify a rectangular area on a diagram and extract data, and the logical and technical issues described above. An object of the present invention is to provide a search processing method that can be integratedly solved.

[0005]

In order to achieve the above object, the present invention provides a computer system having a graphic display device and a pointing device such as a mouse, and a query language program corresponding to a database management system. Operates as a program that executes the command operation in place of the user operating the
Access the database system. The present invention relates to a system configuration (2-a) in which the program, database, and system of the present invention operate on one personal computer system or workstation computer system shown in FIG. A personal computer system or a workstation computer system on which a program operates is realized in a system configuration (2-b) connected as a terminal system of a host computer on which a database system operates via a communication network.

The present invention provides means based on the following concept (object) and manages and controls the inside of a program. (A) Spatial object The spatial object draws a rectangular area having a predetermined area on the graphic display device screen,
It represents a database file or user view of a population set as a basis of a search, and draws a rectangular area representing the set inside the area, thereby forming a topological space for evaluating the existence of data. The space object is a space definition statement (A-A) that describes a unique identification number, a space object name, a database node, a database file name, and a query language name by connecting them with commas.
1) and a plurality of field definition statements (A) describing the field object name, data format and data length, and database field name by connecting them with commas
-2), and a maximum of 32 spatial objects can be defined. (A-1) Example of space definition statement 001, emp1oyee, Host, EMP, SQL (A-2) Example of field object definition statement personal_id, number (12), PE
RSONAL_NO name, char (30), NAME age, integer, AGE bandwidth, date, BIRTHDAY address, char (40), ADDR_1 The spatial object has a field having a common value that can correspond to the elements of the set one-to-one. In the spatial join definition statement (A-3),
Elements of a set can be mapped to each other between spatial objects. The spatial join definition statement includes the spatial object name_1. Field name_1, spatial object name_2. Field name_2 is described by connecting it with a comma. (A-3) Example of space join definition statement employee. personal_id, pers
onal_history. h_emp_id

(B) Set object A set object represents a database search set by integrating a conditional expression and the number of sets.
It is described by a condition attribute and a number attribute, and is managed by an identifier unique to each spatial object. As the set object identifier, characters from 'a' to 'z' are automatically and sequentially assigned after 'A' to 'Z', but when explicitly specified, a set object is generated. Description (B
In -3), the set object identifier can be specified by up to four alphanumeric characters enclosed in double quotes.
The set object condition attribute is described by a set conditional expression (B-1) or a set propositional logical expression (B-2). (B-1) Example of set conditional expression age> = 30 and age <35 (B-2) Example of set propositional logical expression <+>(('A' ^★ 'B') + ('A' ^★ 'C ')
+ ('B' ^★ 'C')) <->('A' ^★ 'B' ^★ '
C ') A set conditional expression is a description of a search conditional expression of an inquiry language program, and describes a key field used as a search indicator and its condition value by a relational operator. The set propositional logical expression is called a set logical expression (B-3), and the condition of the logical expression described by referring to the set conditional expression with the set object identifier is “true”.
And the positive logical symbol '<+>'
Precede the negation logical symbol '<->' to indicate that it is "false" and describe the truth of the proposition. The set logical expression is obtained by adding the set object identifier to the logical sum symbol “+” and the logical difference symbol “
-'And the conjunction symbol' ^★ '
Describe a logical set. The number and population of the entire database file are represented by '#' symbols. (B-3) Example of set logical expression ('A'-(('A' ^★ 'B') + ('A' ^★ '
C '))) A set object holding a set conditional expression is called a primitive set object (B-4), and a set object holding a set propositional logical expression is called a deduced set object (B-5). (B-4) Example of primitive set object 1, 'A', age> = 30 and age <3
5 (B-5) Example of deductive set object 2, "X", <+>(('A' ^★ 'B') + ('A'
^★ 'C') + ('B' ^★ 'C')) <->('A' ^★ '
B ' ^* ' C ') The numerical value at the front of the set object is used to identify the primitive set object (' 1 ') and the deductive set object (' 2 ').

(C) Area object The area object is an area object which is drawn by mapping one rectangular object to one rectangular area using the rectangular area of the space object as a drawing frame. Representing by area, the logical relationship between sets,
This is represented by the arrangement of the areas shown in FIG. The logical product of the two sets is the intersection of the area objects (3-a), and the logical sum is the outer circumference (3-b) surrounding the two area objects.
In addition, the logical difference is the intercept (3
The population set excluding the search set is represented in -c), and is represented in the extension part (3-d) of the area object. The intercept of the region generated by the intersection of the region objects is represented by a set logical expression (C) expressed by an identifier of the set object and a logical operator.
-1). (C-1) Example of a set logical expression that describes the sum of intercepts of two area objects ('A'-(('A' ^★ 'B') + ('A' ^★ '
C '))) + (' B '-((' A ' ^★ ' B ') + ('
B ' ^★ ' C ')))

(D) Aggregation Graph A diagram drawn by a region object that maps an aggregation object onto a rectangular region representing a spatial object is called an aggregation graph (FIG. 1). The set graph can draw up to three sets at the same time, and the number of partitions generated by the intersection of the three area objects and the area objects shown in FIG. , 7 formats (4-a), 6 formats (4-a)
b) 5 formats (4-c), 4 formats (4-d),
The relation is represented in three forms (4-e). In the graph of the three set objects, there are eight logical sets including the area of the space object, and by combining those sections, 255 search condition expressions can be generated.

[0010] Based on the concept of the object described above, a program that realizes the present invention draws an operation panel called a control panel shown in FIG. 5 on a screen of a graphic display device. A rectangular area (5-1) representing the spatial object is displayed on the control panel.
And a field object browser (5-2) for displaying a field object defined in the space and selecting it, and a collection object for displaying a collection object and selecting it.
A browser (5-3), a message box (5-4) for inputting commands from a keyboard device, and displaying output from the program, and a notification field (5) for displaying guidance, warning and error messages. −
A set generation button (5-) that includes a button (5) and instructs execution of the means by clicking the mouse in the area.
6), set drawing button (5-7), set selection button (5
-8), the set mapping button (5-9) and the set extraction button (5-10) are drawn. In addition, a log window (5-5) for recording commands and internal processing generated by the operation, communication status with the inquiry language program, and displaying them in real time.
11), the number of elements of the union of the drawn area objects (5-12), the graphic
The number of dots of the display device (5-13), the drawing style (5-14), the name of the spatial object (5-15), the number of elements in the population (5-16), the database node (5
-17), display a query language program (5-18), a window (5-19) for displaying the number attribute of the set object and the subset object, and present operation status and environmental information. When the program of the present invention is started, the corresponding database / data is defined based on the spatial object definition information defined for each user identification code of the user.
The file is opened. When the user clicks on the spatial object name (5-15), a spatial object browser is displayed and can be selected.

The program of the present invention has an original command called "set graph search language", and execution of the means by operating the control panel is converted into the set graph search language and processed. The inside of the program is composed of modules shown in FIG. 6, and the modules are processed by an internal command called an object message described in a set graph search language. The execution of the means can be executed non-procedurally (in the direction of the arrow in FIG. 6) using the object as an input.

In the following description, a space object definition described below and a generated aggregate object will be exemplified. Spatial object name "employee" 1, employee, Host, EMP, SQL Employee code personal_id, number (8), PERSONAL_NO Employee number name, char (40), NAME Name age, integer, AGE Date of birth Date address, char (40), ADDR_1 Address tel, char (12), TEL_NO Phone number years, integer, YEARS Years of service dept_no, number (4), DEPT_CODE Department number proj_no, number of object (4CO) Name "personal_history" 2, personal_h history, TECH_HIST, SQL History record h_emp_id, number (8), EMP_NO Employee number h_keyword, char (20), SYSTEM Background information h_from_date, date_start_date, date_start_date_date char (255), DESC Background Content Spatial Object Binding Definition Statement employee. personal_id, pers
onal_history. h_emp_id Collective object group of space object “employee” 1, 1, 'A'age> = 30 and age <35 1, 'B', years> 12 1, 'C', proj_nois null 1, 'E', dept_no = 100 2, "X"<+>('A' ^★ 'B') + ('A' ^★ '
C ') + (' B ' ^★ ' C ')) <->(' A ' ^★ ' B '
^★ 'C') 2, 'D', 2: ['A'] 2, 'F', <+>('A' + 'B') <->('A'
^★ 'C') <+>('A' ^★ 'B' ^★ 'C') Spatial object "personal_histor"
set object of y "1, 'A', h_keyword = 'UNIX'

(A) Set generation means A search condition expression (a-a) describing a key field serving as a search indicator and a corresponding condition value connected by a relational operator.
1) is input into the message box (5-4), and the set generation button (5-6) is clicked. Field name is field object browser (5-3)
It is also possible to click on the mouse to select it. (A-1) Input example of search condition expression age> = 30 and andge <35

(B) Set drawing means When up to three set objects to be drawn are selected by clicking with the mouse from the set object browser (5-3), the set objects are displayed in a message box (5-4). Since the identifier (b-1) is written,
Click the set drawing button (5-7). (B-1) Input example of selected set object identifier 'A', 'B,' C '

(C) Set selecting means The inside of the area object on the set graph is selected by clicking with the mouse. If the target set consists of the logical OR of multiple area objects or their intercepts, selecting the area objects consecutively in any order while pressing the shift key to add them will result in a message Set logical expression (c-1) in box (5-4)
Is clicked, and a set selection button (5-8) is clicked. The numerical value described after the equal sign at the end of the set logical expression indicates the number of the logical set that has been formed. (C-1) Example of set logical expression expressed by clicking area object ('A'-(('A' ^★ 'B') + ('A' ^★ '
C '))) + (' C '-((' A ' ^★ ' C ') + ('
B ' ^★ ' C '))) + (' B '-((' A ' ^★ ' B ')
+ ('B' ^★ 'C'))) = 85

(D) Set mapping means A set to be mapped is selected from a set object browser (5-3) or a logical set from a set graph by a set selection means, and is displayed in a message box. In the state where the set object identifier or the set propositional logical expression is described (d-1), the set mapping button (5-
9) Click. (D-1) Example of set object identifier or set propositional logical expression to be mapped 'A' or <+>(('A' ^★ 'B') + ('A' ^★ 'C')
+ ('B' ^★ 'C')) <->('A' ^★ 'B' ^★ '
C ') The set mapping button changes to an "OK?" Button, and a spatial object browser that displays a list of spatial objects that can be mapped is displayed at the display position of the field object browser. Is clicked on with a mouse to select a space object name, and the "OK?" Button is clicked in the state described in the message box (d-2). (D-2) Example of spatial object name of destination to be mapped employee

(E) Set extracting means A set to be extracted is selected from a set object browser (5-3) or a logical set from a set graph by a set selecting means, and is set in a message box. In the state where the set object identifier or the set propositional logical expression (e-1) is described, the set extraction button (5-
10) Click. (C-1) Example of set object identifier or set propositional logical expression to be extracted 'D' or <+>'A'<->(('A' ^★ '
B ') + (' A ' ^★ ' C ')) The set extraction button changes to an "OK?" Button. Click on the field group to be extracted from the field object browser (5-2) with the mouse. Is selected and displayed in the message box (e-2), and clicks the "OK?" Button. (E-2) Example of field object name of set to be extracted personal_id, name, age, dept
_No,

[0018]

[Action]

(A) Set generation operation By clicking the set generation button, the retrieval condition expression (a-1) described in the message box is acquired, and the set generation object message (a-2) converted into the set graph search command is obtained. Generate. (A-1) Input example of search condition expression age> = 30 and age <35 (a-2) Example of set generation object message createSet 'A' where age> =
30 and age <35. The set generation object message is converted into a query command of the query language defined in the space object in the query language command generation unit, and transmitted to the query language program through the query language interface unit. The response message received from the inquiry language program is analyzed by the inquiry language interface unit, and the number of answers is notified to the set generation unit. The set generation unit records the search condition expression in the condition attribute of the set and the number of answers in the number attribute of the set, and assigns and registers a unique identifier within the spatial object. In addition, a set drawing object message (a-3) for drawing the generated set object on the set graph is executed. (A-3) Example of set drawing object message executed by set generation action drawSet 'A' by rate.

(B) Set drawing operation By clicking the set drawing button, the set object identifier (b-1) described in the message box is obtained, and the set drawing object and message (b-2) are obtained.
Generate (B-1) Example of set object identifier to be drawn 'A', 'B', 'C' (b-2) Example of set drawing object message drawSet 'A', 'B', 'C' by fi
t. When multiple aggregate objects are specified, the logical product between the selected aggregate objects is automatically verified. The logical product between the set objects is obtained by generating a set object of the logical product condition from the condition attribute of the collective object, performing a search process, and acquiring the number of logical product sets. The conditional expression of the intersection set and the number of answers are called a subset object, and are retained and reused for the duration of the session. (B-3) Example of object message for generating subset object createSubSet 'A' ^★ 'B'. The set graph can be drawn in three modes: relative, fit, and zoom.
The relative style is a style in which the ratio of the number of set objects to the number of elements of the space object is drawn as the area of the area object in the area of the space object, and is suitable for comparison with the mother set. The conforming style is
This is a mode in which all area objects are drawn by adjusting to a magnification that can be accommodated in the drawing frame, and is suitable for quantitative comparison between sets and determination of a logical relationship between sets. The enlarging style is a style in which the drawing magnification of the relative style is set to 1 and the drawing is doubled every time redrawing is performed, and is suitable for paying more attention to the detailed relationship of the set graph.

(C) Set selection operation By clicking the set selection button, the set logical expression (c-1) of the set formed by selecting the area objects described in the message box is obtained, and the "set logical expression" is obtained. Is performed in the message box instead of the set propositional logical expression (c-2), and the set selection object message (c-3) is generated. (C-1) Example of set logical expression formed by selecting area objects (('A' ^★ 'B')-('A' ^★ 'B' ^★ 'C'))
+ (('B' ^★ 'C')-('A' ^★ 'B' ^★ '
C ')) + ((' A ' ^★ ' C ')-(' A ' ^★ '
B ' ^★ ' C ')) = 85 (c-2) Example of a set propositional logical expression described in a message box <+>((' A ' ^★ ' B ') + (' A ' ^★ ' C ')
+ ('B' ^★ 'C')) <->('A' ^★ 'B' ^★ '
C ') (c-3) Example of Set Selection Object Message selectSet <+>((' A ' ^★ ' B ') + ('
A ' ^★ ' C ') + (' B ' ^★ ' C ')) <->(' A '
^★ 'B' ^★ 'C') The set selection means determines the logical set, performs “paraphrasing of the set logical expression”, and sets propositional logic as an input to each of the means of set generation, set mapping, and set extraction. Generates an expression. When the set generation button is clicked with the set propositional formula (c-2) written in the message box, the set generation object message (c-3) is executed and a deduced set object is generated. (C-3) Example of Object Message for Generating Deductive Set Object createSet "X" with <+>(('
A ' ^★ ' B ') + (' A ' ^★ ' C ') + (' B ' ^★ '
C ')) <->(' A ' ^★ ' B ' ^★ ' C ')

(D) Set mapping action By clicking the set mapping button, a set object identifier (d-1) described in the message box,
Alternatively, a set propositional logical expression is obtained, and then the spatial object name (d-2) of the destination to be mapped described in the message box is obtained by clicking the "OK?" Button, and the set mapped object message ( d-3) is generated. (D-1) Example of set object identifier 'A' (d-2) Example of spatial object name of destination to be mapped employee (d-3) Example of set mapped object message projectSet'A'to 1: employee
e This object message executes the space selection object message (d-4) that shifts to the spatial object to be mapped, and after the space object displayed on each image transitions, the set generation object message (d Perform -5). The condition attribute of the set object generated by the set mapping action is the original condition attribute modified by the original space object number. (D-4) Example of space selection object message selectSpace personal-hist
ory. (D-5) Example of Set Generation Object Message createSet'D'with 2: ['A'] The set generation object message executed by the set mapping object message is a query language defined in the spatial object of the mapping destination. Sent to sub-module of command generator

(E) Set extraction action By clicking the set extraction button, the set object identifier or the set propositional formula (e-1) described in the message box is obtained, and then the "OK?" Button is clicked. , The field object name (e-2) to be extracted described in the message box is obtained, and the set extraction object message (e-3)
Generate (E-1) Example of set propositional logical expression <+>(('A' ^★ 'B' ^★ 'D') + ('A' ^★ '
C ' ^★ ' D ') + (' B ' ^★ ' C ' ^★ ' D ')) <-
>('A' ^★ 'B' ^★ 'C' ^★ 'D') (e-2) Example of field object name to be extracted personal_id, name, age, dept
_No, (e-3) Example of set extraction object message readSet <+>(('A' ^★ 'B' ^★ 'D') +
('A' ^★ 'C' ^★ 'D') + ('B' ^★ 'C' ^★ '
D ')) <->(' A ' ^★ ' B ' ^★ ' C ' ^★ ' D ')
[Name, age, dept_no, proj_n
o]. The set extraction object message is transmitted to the query language command generation unit, converted into a query command for the query language, and transmitted to the query language program through the query language interface unit. The response message received from the inquiry language program is analyzed by the inquiry language interface unit, and the extracted data is returned to the set extraction command unit. The extracted data is displayed on the data display window.

(F) Operation of “paraphrase of set logical formula” Selecting the area objects of the set graph in an arbitrary order means that the logical set composed of the same area objects shown in (7-a) of FIG. Different set logical expressions (f−1,
The result represented by f-2) is obtained. Also, since a set logical expression that describes the intercept of the area object is synthesized,
The description of the elements of the intersection set overlaps, or the description of the included set exists. The “paraphrasing of set logical expression” is to convert such an indefinite and redundant set logical expression into a set propositional logical expression (f-3) that rearranges its elements, calculates the logic of the elements, and describes the proposition. This is a paraphrase. (F-1) Example of set logical expression (1) ('B'-(('A' ^★ 'B') + ('B' ^★ '
C '))) + ((' B ' ^★ ' C ')-(' A ' ^★ ' B '
^★ 'C')) + ('A'-(('A' ^★ 'B') + ('
A ' ^★ ' C '))) + ((' A ' ^★ ' B ')-(' A '
^★ 'B' ^★ 'C')) + ('A' ^★ 'B' ^★ 'C') =
255 (f-2) Example of a set logical expression having the same proposition as that of example (1) of a set logical expression (2) ('A' ^★ 'B' ^★ 'C') + (('B' ^★ 'C' )-
('A' ^★ 'B' ^★ 'C')) + (('A' ^★ 'B')
− ('A' ^★ 'B' ^★ 'C')) + ('B' + (('
A ' ^★ ' B ') + (' B ' ^★ , C'))) + ('A'-
(('A' ^★ 'B') + ('A' ^★ 'C'))) = 25
5 (f-3) Example of set propositional logical expression <+>('A' + 'B') <->('A' ^★ 'C') <
+>('A' ^★ 'B' ^★ 'C') The set propositional formula (f-3) has a logical set on the left-hand side larger than the right-hand side. The symbol "<->" is used to describe the set alternately, and the set is changed from "large" to "excluding this part", but "excluding this part that is smaller than the excluded part." Is a format that is expressed step by step. This expression form is a form that can easily recognize the set proposition and can be converted into a search command provided by a general query language. The set logical expression (f-5) including the deduced set object (f-4) is expanded by replacing the identifier of the deduced set object with the identifier of the primitive set object, and then “paraphrasing the set logical expression”
To construct a set propositional formula (f-6). (F-4) Example of deductive set object 2, 'F', <+>('A' + 'B') <->('A'
^★ 'C') <+>('A' ^★ 'B' ^★ 'C') (f-5) Example of set logical expression including deductive set object 'E' ^★ 'F' (f-6) Set proposition Example of logical expression <+>(('A' ^★ 'B' ^★ 'E') + ('B' ^★ '
C ' ^★ ' E ')) <->(' A ' ^★ ' B ' ^★ ' C ' ^★ '
E ′) FIG. 7 shows a diagram of a logical set formed by selecting an area object, a set logical expression expressing the logical set, and a result of a set propositional logical expression generated by “paraphrasing the set logical expression”. .

(G) Query Language Command Generation Function The query language command generation unit generates a query command for a query language program from the input object message. The query language command generation unit is provided with individual sub-modules corresponding to the language specifications, and generates a search command corresponding to the name of the query language program defined in the space object. The program of the present invention is a software program of SOA
Implement sub-modules corresponding to each language specification, such as a search program, an interactive SQL program, and a HyperCard database function provided by Apple Computer. The SOAR search program converts the set propositional formula generated by the program of the present invention almost directly into S
It can be input to the OAR-LQ program and processed. The HyperCard database function replaces the positive logical part and the negative logical part of the set propositional logical expression with individual mark instructions and executes them. Finally, the marked card becomes a search set. In the following description, an example of conversion into a search command of a general interactive SQL program will be described. The set generation object message (g-1) is
A search command (g-2) is generated using the database file name defined in the spatial object as the base table name for search. (G-1) Example of Set Generation Object Message createSet'A'where age> = 30
and age <35. (G-2) Example of search command SELECT COUNT ( ^★ ) FROM EMP W
HERE age> = 30 and age <35; The set mapping object message (g-3) uses a database file name defined for a mapping destination spatial object as a base table name and searches for linking elements by link fields. A command section (g-4) is generated, and a search command section for a database file name and a conditional expression defined in the original spatial object is generated and combined to generate one search command (g-5) . (G-3) Example of Set Mapping Object Message projectSet'A'to employee. (G-4) Example of main search command section SELECT COUNT ( ^★ ) FROM EMP WHERE EMP. PERSONAL_NO = TEC
H_HISTORY. EMP_ID (g-5) Example of set mapping search command generated by adding search conditions for original object SELECT COUNT ( ^★ ) FROM empl
eye WHERE employee. personal_i
d = personal_history. h_emp_
id AND personal_history. h
_Keyword = 'UNIX'; The set extraction object message (g-6) is a data extraction command part (g-
7) is generated, a search command part is generated by referring to the condition attribute from the set object identifier, and is combined to generate one search command (g-8). (G-6) Example of set extraction object message readSet'A '[personal_id, na
me, age, dept_no]. (G-7) Example of data extraction command section SELECT PERSONAL_NO, NAME, A
GE, DEPT_CODE FROM EMP (g-8) Example of set extraction search command generated by adding search command section SELECT PERSONAL_NO, NAME, A
GE, DEPT_CODE FROM EMP WHERE AGE> = 30 AND AGE <35; If the object message is an object message (g-9) including a set propositional logical expression, the set object identifier of the set propositional logical expression and the set logical The operator is converted into a corresponding SQL command to generate a query language command (g-10). The set logical operator is OR '
+ 'And positive logic'<+>'are"UNION" or "OR", and the logical difference'-'and negative logic'<->'
Is replaced with “MINUS”, and the logical product “ ^★ ” is replaced with “AND” or “INTERSECT”. (G-9) Example of Set Generation Object Message by Set Propositional Logical Expression createSet'E'with <+>'A'<->
(('A' ^★ 'B') + ('A' ^★ 'C')). (G-10) Example of search command SELECT COUNT ( ^★ ) FROM EMP W
HERE AGE> = 30 AND AGE <35 M
INUS ((SELECT COUNT ( ^★ ) FROM EMP WHERE AGE> = 30 AND AGE> 35
AND YEARS> 12) UNION (SELECT COUNT ( ^★ ) FROM EMP WHERE AGE) = 30 AND AGE> 35
AND PROJ_CODE IS NULL));

(H) Inquiry Language Interface Function The inquiry language interface unit communicates between the inquiry language program and the program of the present invention through an interface with a communication line or a function such as a pipe on the same computer system. Controls transmission / reception processing. A reserved word for selecting and extracting the number of answers from the input / output state of the inquiry language program and the response message is selected and defined in advance in the interface keyword statement. The interface keyword statement describes a keyword, a query language program name, and a reserved word. For transmission to the inquiry language program, a state in which input is possible is determined by the prompt message (h-1), and a command is transmitted. Reception from the inquiry language program includes reception of the number of answers and reception of data elements in set extraction. In the reception of the number of answers, a reserved word (h-2) indicating the number is searched and extracted from the received message text and transmitted to the request source. In the reception of the data element, the state in which the query language command for set extraction is transmitted is recorded, and all response messages received thereafter are transmitted to the set extraction unit until the next prompt message is received. (H-1) Example of prompt message definition prompt_ready, SOAR, " ^★ TYPE
COMMAND (M) "prompt_ready'SQL,"SQL>"(h-2) Example of reserved word definition indicating number of counts count_receive, SOAR," RECORD "
DS FOUND ”count_receive, SQL,“ record
s selected ”

(I) Log record The operation record and the communication record with the inquiry language are recorded with the log header record described below. nnn sss-LE: message nnn. . . −. . : Log line number. . sss-. . : Spatial object number Message level. . . . . . -1. : Main command object message . . . . . -2. : Subcommand object message. . . . . . -3. : Communication message with database query language. . . . . . -4. : Trace message. . . . . . -9. : Message confirming the contents obtained from the message box Message class code. . . . . . −. C: Command. . . . . . −. I: Trace information. . . . . . −. W: Warning. . . . . . −. E: Processing exception. . . . . . −. F: System failure. . . . . . −. . : Object message and communication message The object message records the operation command of the control panel and the command between modules.
The communication message is provided with a destination node name and a communication message sequence number, and a command transmission message (i-1) and a response reception message (i-2) are recorded. (I-1) Example of command transmission message 032 001-3S: Host: 034: "SELE
CT COUNT ( ^★ ). . . ; (I-2) Example of response reception message 033 001-3R: Host: 034: "200
records selected. "

[0027]

DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment for searching a personnel information database by a program implementing the present invention will be described below. The personnel information database is a database built on a database management system of the SQL specification, and has an employee table.
EMP ”and technical history table“ TECH_HISTO ”
RY ”. The employee table has a space object“ 0 ”.
01 ”, the technical history table stores the spatial object“ 0 ”.
02, and “p” of the spatial object “001”
personal_id, and the spatial object “00”
The “emp_id” of “2” is defined and combined in a spatial join statement. The search proposition is “Create a roster of new project leader candidates” and the candidate is “30 years of age. More than 35 years old and 12 years of service
You must be at least 30 years old and under 35 years of age and do not belong to the project, or have been with the project for 12 years or more and do not belong to the project. It is necessary to be an employee who has the development experience of " Was analyzed.
This stage is a business thinking task based on the knowledge and experience of the HR personnel in the field of application. The thinking task in a database search operation is to analyze a target attribute and describe a search condition expression. It is understood that the attributes to be searched are constituted by a combination of the following four search conditions as factors. (A) "Age of 30 to 35" (B) "12 or more years of service" (C) "Not belonging to the project" (D) "Development experience with UNIX" To show the process of processing In the log that records the object message.

A set object that satisfies the condition "age is 30 years old or more and less than 35 years old" is generated. In the message box, the condition "age> = 30 and age
Input <35 ”, and click a set generation button on the operation screen.012 001-9I: create Set =: ag
e> = 30 and age <35 013 001-1C: createSet'A'wh
ere age> = 30 and age <35. 014 001-3S: Host: 001: "SELE
CT COUNT ( ^★ ) FROM EMP NHRE
AGE> = 30 AND AGE <35;"015 001-3R: Host: 001:" 200
records selected. "016 001-2C: drawSet'A'byr
ate. The number of respondents was 200. "Age 30 or older 3
An aggregate object that satisfies the condition "under 5 years"
A ′ is drawn in the relative style aggregate graph shown in FIG.

Next, a set object 'B' is generated under the condition that "the length of service is 12 years or more". 017 001-9I: create Set =: ye
ars> 12 018 001-1C: createSet'B'wh
area ears> 12. 019 001-3S: Host: 002: "SELE
CT COUNT ( ^★ ) FROM EMP WHE
RE YEARS>12;"002 001-3R: Host: 002:" 150
records selected. "021 001-2C: drawSet'B'byr
ate. The number of answers was 150. Aggregate object 'B'
Is registered, and a set graph is drawn.

Here, the aggregate objects "A" and "B"
In order to confirm the relationship, a set graph is drawn. 022 001-9I: draw Set =: '
A ',' B '023 001-1C: drawSet' A ',' B '
by fit. 024 001-2C: createSubset '
A ' ^★ ' B '. 025 001-3S: Host: 003: "SELE
CT COUNT ( ^★ ) FROM EMP WHERE
AGE) = 30 AND AGE <35 AND Y
EARS>12;"026 001-3R: Host: 003:" 75r
records selected. The number of AND sets of the set objects 'A' and 'B' was 75. A set graph of the conforming style shown in FIG. 9 was drawn. It can be determined that there is an employee who has a "year of 12 years or more".

"Not belonging to a project" means that it is not currently assigned to a specific project, and can be searched under the condition "proj_no is null". Aggregate object '
Generate C ′. 027 001-9I: create Set =: Pr
oj_no is null. 028 001-1C: createSet'C'wh
ere proj_nois null. 029 001-3S: Host: 004: "SELE
CT COUNT ( ^★ ) FROM EMP WHERE
PROJ_CODE IS NULL; "030 001-3R: Host: 004:" 100
records selected. "031 001-2C: drawSet'C'by r
ate. The number of answers was 100. Aggregate object 'C'
Is registered, and the set graph is drawn.

The subjects of the proposition are "A" is 30 years old or older and less than 35 years old, "A";
This is the sum of the logical product of each of the collective objects of “C” that does not belong to the project, and is the logical product under the condition of “development experience with UNIX”. Before generating the set "Development experience on UNIX", the three set objects' A ',' B ','
Draw a set graph with C '. 032 001-9I: draw Set =: '
A ',' B ',' C '033 001-1C: drawSet' A ','
B ',' C 'by fit. 034 001-2C: createSubset '
A ' ^★ ' C '. 035 001-3S: Host: 005: "SELE
CT COUNT ( ^★ ) FROM EMP WHERE
AGE> = 30 AND AGE <35 AND PROJ_CODE IS NULL; "036 001-3R: Host: 005:" 50r
records selected. "037 001-2C: createSubset '
B ' ^★ ' C '. 038 001-3S: Host: 006: "SELE
CT COUNT ( ^★ ) FROM EMP WHERE
YEARS> 12 AND PROJ_CODE I
S NULL; "039 001-3R: Host: 006:" 50r
records selected. "040 001-2C: createsubset '
A ' ^★ ' B ' ^★ ' C '. 041 001-3S: Host: 007: "SELE
CT COUNT ( ^★ ) FROM EMP WHERE
AGE> = 30 AND AGE <35 AND
YEARS> 12 AND PROJ_CODE I
S NULL; "042 001-3R: Host: 007:" 30 r
records selected. "A subset object, 'A' ^★ 'C' is 50, 'B'
^★ 'C' was 50, 'A' ^★ 'B' ^★ 'C' was 30. As a result, according to the set graph shown in FIG.
It can be confirmed that each of the three sets has an intersecting portion. ('A' ^★ 'B') area is "age is 3
The intersection of (0 to 35 years old and 12 or more years of service), and the area of ('A' ^★ 'C'), "age is 30 to 35 years old and does not belong to the project" In the area of ('B' ^★ 'C'), "
This is an area object that represents the existence of a logical AND set that does not belong to the project for more than one year. Also,('
The area of A ' ^★ ' B ' ^★ ' C ') represents the intersection of "age is 30 to 35 years old, has been working for 12 years or more, and does not belong to the project." Parts must be excluded from the subject.

(('A' ^★ 'B')-('A' ^★ 'B'
^★ 'C')), (('A' ^★ 'C')-('A' ^★ '
B ' ^★ ' C ')), ((' B ' ^★ ' C ')-('
A ' ^★ ' B ' ^★ ' C ') is selected and one deductive set object is generated. An area on the set graph shown in FIG. 11 is selected by clicking with the mouse, and a set selection button is clicked to generate a set propositional formula. 043 001-9I: select Set
=: (('A' ^★ 'B')-('A' ^★ 'B' ^★ '
C ')) + ((' A ' ^★ ' C ')-(' A ' ^★ '
B ' ^★ ' C ')) + ((' B ' ^★ ' C ')-('
A ' ^★ ' B ' ^★ ' C ')) = 85 044 001-1C: selectSet <+
>(('A' ^★ 'B') + ('A' ^★ 'C') + ('
B ' ^★ ' C ')) <->(' A ' ^★ ' B ' ^★ ' C ') In order to register this logical set as a deductive set object with an explicit designation of "X", the message -Place the character cursor in front of the set propositional formula described in the box and enter "" X "with". 045 001-9I: create Set =: "
X "with <+>(('A' ^★ 'B') + ('
A ' ^★ ' C ') + (' B ' ^★ ' C ')) <->(' A '
^★ 'B' ^★ 'C') 046 001-1C: createSet "X" wi
th <+>(('A' ^★ 'B') + ('A' ^★ 'C')
+ ('B' ^★ 'C')) <->('A' ^★ 'B' ^★ '
C ') 047 001-3S: Host: 008: "((SE
LECT COUNT ( ^★ ) FROM EMP WHE
RE AGE> = 30 AND AGE <35 AND YEARS> 12) UNION (SELECT COUNT ( ^★ ) FROM EMP
WHERE AGE> = 30 AND AGE <35
AND PROJ_CODE IS NULL) UNION (SELECT COUNT ( ^★ ) FROM EMP
WHERE YEARS> 12 AND PROJ_
CODE IS NULL)) MINUS (SELECT COUNT ( ^★ ) FROM EMP
WHERE AGE> = 30 AND AGE <35
AND YEARS> 12 AND PROJ_CO
DE IS NULL); "048 001-3R: Host: 008:" 85r
records selected. A deduction set object "" X "is registered.

The condition of "development experience on UNIX" is that an employee number in which "UNIX" is described in the h_keyword field of the personal_history space object is searched, and the employee number is referred to as "employ".
A set mapped to a yee space object is obtained. First, click on the spatial object name,
Display the spatial object browser and open a person
The al_history space object is selected, and the space object is transited. 049 001-9I: select Space =:
personal_history 050 001-1C: selectSpace Pe
rsonal_history. A set object is created under the condition "development experience with UNIX". 051 002-9I: create Set =: h_
keyword = 'UNIX' 052 002-1C: createSet'A 'wh
e h_keyword = 'UNIX' 053 002-3S: Host: 009: “SELE
CT COUNT ( ^★ ) FROM TECH_HIST
ORY WHERE SYSTEM = 'UNIX';"054 002-3R: Host: 009:" 625
records selected. 055 002-2C: drawSet 'A'by
rate. The number of respondents was 625. A group of employees called "Development experience with UNIX" is personal_his.
It is registered in the collection object 'A' of the tory space object.

The generated aggregate object 'A' is expressed as em
Select from the collective object browser to map to pie space. 056 002-9I: project Set =: '
A ′ As shown in FIG. 12, a set mapping button (project)
Set) changes to "OK?", And a message "Please select a space to map the set from the spatial object browser" is displayed in the notification field. Click the employee to select it. 057 002-9I: project Space
=: Employee. 058 002-1C: projectSet'A't
o employee. 059 002-2C: selectSpace em
ploeeee. 060 001-3S: Host: 010: "SELE
CT COUNT ( ^★ ) FROM EMP WHERE
TECH_HISTORY. SYSTEM = 'UNI
X ';"061 001-3R: Host: 010:" 120 "
records selected. "A set object 'A' in the personal_history space is mapped onto the employee space object and registered as a set object 'D'.
The number of sets mapped to the employee space is 120
Was the case.

The previously created deductive set object "X"
And the set object 'D' that has been mapped is designated to draw the set graph. 062 001-9I: draw Set =: "
X ", 'D' 063 001-1C: drawSet" X ", 'D'
by fit. 064 001-2C: createSubset "
X " ^★ 'D'. 065 001-4I:" X " ^★ 'D' explod
ed to <+>(('A' ^★ 'B' ^★ 'D')
+ ('A' ^★ 'C' ^★ 'D') + ('B' ^★ 'C' ^★ '
D ')) <->(' A ' ^★ ' B ' ^★ ' C ' ^★ ' D ') 066 001-3S: Host: 011: "((SE
LECT COUNT ( ^★ ) FROM EMP WHE
RE AGE> = 30 AND AGE <35 AND YEARS> 12 AND TECH_HIS
TORY. SYSTEM = 'UNIX' UNION (SELECT COUNT ( ^★ ) FROM EMP
WHERE AGE> = 30 AND AGE <35
AND PROJ_CODE IS NULL AND AND TECH_HISTORY. SYSTEM = '
UNIX ') UNION (SELECT COUNT ( ^★ ) FROM EMP
WHERE YEARS> 12 AND PROJ_C
ODE IS NULL AND TECH_HIST
ORY. SYSTEM = 'UNIX')) MINUS (SELECT COUNT ( ^★ ) FROM EMP
WHERE AGE) = 30 AND AGE <35
AND YEARS> 12 AND PROJ_CO
DE IS NULL AND TECH_HISTO
RY. 067 001-3R: Host: 011: "23 r" (SYSTEM = 'UNIX');
records selected. The number of intersections of "X" and "D" was 23.
As a result, a set graph shown in FIG. 13 is drawn. "
X ” ^★ 'D' means“ age is between 30 and 35 years old and has been working for 12 years or more. Age is between 30 and 35 years old and does not belong to the project. Does not belong to any of the conditions,
He also has UNIX development experience. It is a set of employees.

In order to create a list of subjects, a set "
X " ^★ Extract the employee number, name, age, and department number of 'D'. Select the area object" X " ^★ 'D' and click the set selection button. 068001-9I: select Set =: ("
X " ^★ 'D') = 23 069 001-4I:" X " ^★ 'D'explod
ed to <+>(('A' ^★ 'B' ^★ 'D') +
('A' ^★ 'C' ^★ 'D') + ('B' ^★ 'C' ^★ '
D ')) <->(' A ' ^★ ' B ' ^★ ' C ' ^★ ' D ') 070 001-1C: selectSet <+>
(('A' ^★ 'B' ^★ 'D') + ('A' ^★ 'C' ^★ '
D ') + (' B ' ^★ ' C ' ^★ ' D ')) <->(' A '
^★ 'B' ^★ 'C' ^★ 'D') With the set propositional formula written in the message box, click the set extraction button. 071 001-9I: read Set =: <+>
(('A' ^★ 'B' ^★ 'D') + ('A' ^★ 'C' ^★ '
D ') + (' B ' ^★ ' C ' ^★ ' D ')) <->(' A '
^★ 'B' ^★ 'C' ^★ 'D') As shown in FIG. 14, a set extraction button (readSe)
t) changes to "OK?", and a message "Please select a group of fields to be extracted from the field object browser" is displayed in the notification field. From the Field Object Browser, click to select the field to extract. 072 001-9I: read Items =: pe
rsonal_id, name, age, dept_n
o, 073 001-1C: readSet <+>(('
A ' ^★ ' B ' ^★ ' D ') + (' A ' ^★ ' C ' ^★ ' D ')
+ ('B' ^★ 'C' ^★ 'D')) <->('A' ^★ '
B ' ^★ ' C ' ^★ ' D ') [personal-id, n
ame, age, dept_no]. 074 001-3S: Host: 012: "((SE
LECT PERSONAL_NO, NAME, AG
E, DEPT_CODE FROM EMP WHER
E AGE> = 30 AND AGE <35 AND
YEARS> 12 AND TECH_HISTORY. SYSTEM = '
UNIX ') UNION (SELECT PERSONAL_NO, NAME,
AGE, DEPT_CODE FROM EMP WH
ERE AGE> = 30 AND AGE <35 AND PROJ_CODE IS NULL AND
TECH_HISTORY. SYSTEM = 'UNI
X ') UNION (SELECT PERSONAL_NO, NAME,
AGE, DEPT_CODE FROM EMP WH
ERE YEARS> 12 AND PROJ_COD
E IS NULL AND TECH_HISTOR
Y. SYSTEM = 'UNIX')) MINUS (SELECT PERSONAL_NO, NAME,
AGE, DEPT_CODE FROM EMP WH
ERE AGE> = 30 AND AGE <35 AND YEARS> 12 AND PROJ_COD
E IS NULLLAND TECH_HISTOR
Y. 075 001-3R: Host: 012: "read" (SYSTEM = 'UNIX');
y for output ”As shown in the above embodiment, the“ database search processing method by schematizing a set ”is that all search processing is performed on a graphic object except that a conditional expression of a basic set object is described. This is realized by a graphic user interface for selecting and instructing, and realized by a stepwise operation flow (FIG. 15) synchronized with a logical thinking process.

[0038]

According to the present invention, the set is mapped to a geometric rectangular figure and illustrated. (A) From the size and the positional relationship of the rectangular area, the quantity of the set and the Can visually evaluate and recognize the logical relationships in,
(B) The set graph drawn by the three rectangular regions includes the intercept of the maximum of seven regions and the population set of the extension.
Logical sets are presented, and by selecting and instructing the sets, 255 kinds of search condition expressions can be generated and data extraction operation can be performed. Since the amount and the relationship of the existence are recorded in a graph, there is an effect that a time series of a set in a graph can be compared and a medium for explanation and presentation in a graph can be provided. Database searches, such as information and literature searches, do not clearly know what to search for.
Repeat trial and error under uncertain and unclear provisional conditions. The purpose of such a search process is to search for an object itself, execute a search process using a relatively simple conditional expression to generate a set, combine the generated set with a pool operator, and generate a set. Understand objects from logical relationships. In database searches such as personnel information and business management information, compound conditions for multiple items in multiple database files are described, and the best combination of sets obtained by assuming multiple condition values is used. May be asked. In all of these searches, the difficulty of the logical task of grasping the quantity of sets and the logical relationship between sets is more important than the difficulty of technical tasks in computer operation. For this reason, the user hand-draws a diagram representing the existence of the set in a circle on the paper surface of the desk,
It is often found that the user evaluates and understands by a diagram and inputs the search condition again to the computer keyboard. INDUSTRIAL APPLICABILITY The present invention has an effect of integrally solving a logical problem in a thinking process and a technical problem in an operation process in a complicated and sophisticated search or an uncertain and unclear search.

[Brief description of the drawings]

FIG. 1 is a diagram showing a “set graph”.

FIG. 2 is a diagram showing a configuration of a system. (2-a) System configuration of a single computer system (2-b) System configuration connected to a host computer system

FIG. 3 is a diagram showing a format in which a logical set is represented in a rectangular area (shaded area). (3-a) The intersection of the set 'A' and the set 'B',
A ' ^{★ Described as} 'B'. (3-b) The union of the set 'A' and the set 'B',
Notated as A '+' B '. (3-c) A difference set obtained by subtracting the set 'B' from the set 'A' and expressed as 'A'-('A' ^★ 'B'). (3-d) A difference set obtained by subtracting the set 'A' and the set 'B' from the mother set '#', and expressed as '#'-('A' + 'B').

FIG. 4 is a diagram showing a format of a set graph for drawing three sets. (4-a) 'A' ^★ 'B' ≠ 0, 'A' ^★ 'C' ≠
0, 'B' ^★ 'C' ≠ 0, 'A' ^★ 'B' ^★ 'C' ≠ 0
In the case of, an arrangement form in which seven sections are generated. (4-b) 'A' ^★ 'B' ≠ 0, 'A' ^★ 'C' ≠
0, 'B' ^★ 'C' ≠ 0, 'A' ^★ 'B' ^★ 'C' = 0
In the case of, an arrangement form in which six sections are generated. (4-c) 'A' ^★ 'B', 'A' ^★ 'C', '
B ' ^{★ An} arrangement format in which five sections are generated when any one of' C 'is 0. (4-d) 'A' ^★ 'B', 'A' ^★ 'C', '
B ' ^{★ An} arrangement format in which four sections occur when any two of' C 'are 0. (4-e) 'A' ^★ 'B', 'A' ^★ 'C', '
B ' ^{★ An} arrangement format in which three sections are generated when all of' C 'are 0.

FIG. 5 is a diagram showing an operation panel called a control panel.

FIG. 6 is a diagram showing a module configuration of a program for realizing the present invention and a processing order of means.

FIG. 7: “Parallelization of set logical expression” by set selection means
It is a figure which shows the effect | action of. When an area of each graph is selected (shaded area), the logical expression shown at the bottom of the graph is written, and it is paraphrased into a set propositional logical expression written in the latter half of '='.

FIG. 8 is a diagram illustrating a set graph in which a generated set object is drawn in a relative format after execution of a set generation command in the embodiment.

FIG. 9 is a diagram illustrating a set object “A”, “
It is a figure showing a set graph of B '.

FIG. 10 is a set object in the embodiment.
It is a figure showing a set graph of A ',' B ', and' C '.

FIG. 11 shows an example of a deductive set object.
It is a figure which shows the part on the set graph selected at the time of producing | generating X ".

FIG. 12 is a diagram showing an example in which the group mapping button is clicked in the embodiment, and is changed to an “OK?” Button.
FIG. 7 is a diagram illustrating a state in which a browser is displayed.

FIG. 13 shows an example of a deductive set object.
It is a figure which shows the set graph of X "and the mapped dakutaku set object 'D'.

FIG. 14 is a diagram showing a state in which a set extraction button is clicked and changed to an “OK?” Button in the embodiment.

FIG. 15 is a diagram showing a step-by-step operation flow of a “database search processing method by grouping sets” in the embodiment.

Continuation of the front page (58) Field surveyed (Int.Cl. ⁷ , DB name) G06F 17/30 G06F 12/00 JICST file (JOIS)

Claims (3)

(57) [Claims] 1. A process for determining the number of sets in a database search and a processing method for extracting data elements of a set, comprising the steps of: (a) abstracting a search condition of a set and the number of answers; Generation, which is registered as a simple object (set object)
A step, select the aggregate object up to three from the set object registered (b), the amount of the set, mapped onto geometric rectangular area logical relationships between the set and the set A group drawing step of presenting a diagram on the screen of a graphic display device; and (c) a logical area in which a drawn rectangular area and a section of the area are specified using a pointing device such as a mouse, and these are combined. constitute a specific set, a set selection step, a set constructed logically by (d) set selection step
Register as a deductive set object,
Objects and other set objects, the quantity of those sets
And the logical relationship between sets
The graphic mapped to the area of the shape is displayed on the graphic display.
A group mapping step for presenting on a screen of a device ; 2. The method according to claim 1, wherein the set drawing is performed.
In the process, the amount of the set is represented by the area of the area
And logical relationships between sets into sets of areas
Therefore, database search processing characterized by representation
Method. 3. The method of claim 1, wherein the set mapping is performed.
The rectangular area and the section of the area drawn by the process are
Use a pointing device such as a mouse to give instructions and combine them.
Set extraction to extract the data elements of the logical set
A database search processing method having a process.