CN102063434A - Candidate key capture device and candidate key capture method - Google Patents

Candidate key capture device and candidate key capture method Download PDF

Info

Publication number
CN102063434A
CN102063434A CN2009102222941A CN200910222294A CN102063434A CN 102063434 A CN102063434 A CN 102063434A CN 2009102222941 A CN2009102222941 A CN 2009102222941A CN 200910222294 A CN200910222294 A CN 200910222294A CN 102063434 A CN102063434 A CN 102063434A
Authority
CN
China
Prior art keywords
attributes
combinations
data
candidate key
attribute
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN2009102222941A
Other languages
Chinese (zh)
Other versions
CN102063434B (en
Inventor
郭大维
施吉昇
骆仁山
隋培伦
郭哲玮
梁敏雄
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Institute for Information Industry
Original Assignee
Institute for Information Industry
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Institute for Information Industry filed Critical Institute for Information Industry
Priority to CN200910222294.1A priority Critical patent/CN102063434B/en
Publication of CN102063434A publication Critical patent/CN102063434A/en
Application granted granted Critical
Publication of CN102063434B publication Critical patent/CN102063434B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention relates to a candidate key capture device and a candidate key capture method. The candidate key capture device comprises a microprocessor and a storage unit, wherein the storage unit is used for storing a data table which is loaded with a data number of the data table, a plurality of attributes, data difference numbers of the attributes and data types of the attributes; and the microprocessor is used for generating a candidate key according to the data number, the data types and the data difference numbers.

Description

Candidate Key capture device and Candidate Key acquisition method thereof
Technical field
The invention relates to a kind of Candidate Key capture device and Candidate Key acquisition method.The invention relates to a kind of information that can be contained specifically, produce the Candidate Key capture device and the Candidate Key acquisition method of a Candidate Key according to a tables of data.
Background technology
Along with the arriving of digital times, the storage of data develops the digitizing record by the mode of traditional Hard copy record, and for storing a large amount of digitized data, and therefore database also accumulates and educate and give birth to.Be effective stored data of management database, information personnel often must produce the tables of data of a tool logical relation, to make things convenient for later use and maintenance earlier to desiring the work that storage data be integrated and analyze.
With the master data that stores all students of school is example, and tables of data may write down hundreds of students' class, sex and blood group or the like information, and the huge of its data volume well imagined.Generally speaking, be convenient follow-up effective management, information personnel can earlier carry out tables of data a series of normalization (normalization) to be handled, and its purpose is to avoid the data in the tables of data to duplicate or the situation of contradiction mutually, can help tables of data to be easy to use and safeguard simultaneously.Yet normalization process must begin by the Candidate Key of tables of data to carry out, and so-called Candidate Key briefly is exactly the identification pointer that is used for distinguishing different pieces of information.
For example, table 1 is a tables of data of record student master data, its be loaded with 4 students' " student number " and " sex ", and " student number " of table 1 and " sex " can be considered as an attribute of table 1 respectively, Candidate Key then is to pick out in the various combinations of attributes by tables of data.
1 2 3 4
Student number A001 A002 A003 A004
Sex The woman The woman The man The woman
Table 1
Particularly, table 1 has " student number ", " sex " and " student number+sex " three kinds of attribute combinations, the Candidate Key of table 1 must be by picking out in aforementioned three kinds of attributes combination, and must satisfy uniqueness and minimality, uniqueness is meant that all aspect numbers that a combinations of attributes is presented need more than or equal to the contained data stroke count of tables of data, with table 1 is example, it is loaded with 5 data, and every student all has different student numbers, combinations of attributes " student number " has 5 kinds of aspects at least, therefore be enough to distinguish out each contained data of table 1 according to " student number ", and combinations of attributes " student number " is to satisfy uniqueness.
In like manner, combinations of attributes " student number+sex " can present 5 kinds of aspects at least, also meet the requirement of uniqueness, but combinations of attributes " sex " the aspect that can present 2 kinds (they not being that " woman " is exactly " man ") are only arranged, stroke count (5) less than the contained data of table 1, therefore combinations of attributes " sex " does not then meet the requirement of uniqueness, builds outside the possibility list in the candidate disallowable.In addition, after combinations of attributes " student number+sex " and combinations of attributes " student number " meet the requirement of uniqueness, next just must carry out the judgement of minimality.
Minimality is meant that the number that combinations of attributes comprises attribute needs the smaller the better, from the above, combinations of attributes " student number " and combinations of attributes " student number+sex " have met uniqueness all, but combinations of attributes " student number+sex " is to comprise " student number " and " sex " two attributes, and combinations of attributes " student number " only comprises " student number " this attribute, therefore need have under the requirement of minimality in Candidate Key, combinations of attributes " student number+sex " is with the disallowable Candidate Key that not can be used as, combinations of attributes " student number " is then because of meeting the requirement of uniqueness and minimality simultaneously, so combinations of attributes " student number " then can be considered the Candidate Key of table 1.But prior art is to pass through the Candidate Key of the judgement searching tables of data of uniqueness and minimality with manual type, and this not only makes the acquisition of Candidate Key lack efficient, more may the feasible probability reduction that correctly captures Candidate Key because information personnel be lacked experience.
In view of this, how to make Candidate Key acquisition more precisely and have more efficient, the real problem of needing solution for the operator in this field badly.
Summary of the invention
A purpose of the present invention is to provide a kind of Candidate Key capture device.This Candidate Key capture device comprise a storage element and one and this storage element be the microprocessor of electric connection.This storage element is in order to storing a tables of data, and this tables of data is loaded with a data stroke count of this tables of data, a plurality of attribute, respectively a data phase heteromerism and the data type of this attribute respectively of this attribute.This microprocessor produces one first combinations of attributes in order to according to respectively data type and these attributes of this attribute, and this first combinations of attributes comprises at least one selected attribute, this at least one selected attribute be these attributes one of them.This microprocessor is more than or equal to this data stroke count in order to a product of the data phase heteromerism of at least one selected attribute of judging this first combinations of attributes also, and producing a judged result according to a quantity of at least one selected attribute of this first combinations of attributes, it is a Candidate Key that this microprocessor is set this first combinations of attributes according to this judged result.
Another object of the present invention is to provide a kind of Candidate Key acquisition method that is used for aforementioned Candidate Key capture device.This Candidate Key acquisition method comprises the following step: (a) make this microprocessor basis respectively data type and these attributes of this attribute, produce one first combinations of attributes, this first combinations of attributes comprises at least one selected attribute, this at least one selected attribute be these attributes one of them; (b) making the product of data phase heteromerism of at least one selected attribute of this first combinations of attributes of this microprocessor judges is more than or equal to this data stroke count; (c) make this microprocessor produce a judged result according to a quantity of at least one selected attribute of this first combinations of attributes; And (d) make this microprocessor according to this judged result, setting this first combinations of attributes is a Candidate Key.
In addition, for reaching the described purpose of leading portion, the present invention also provides a kind of computer program product, interior storage is a kind of in order to carry out the program of aforementioned Candidate Key acquisition method, this program can be carried out the multiprogram instruction after being loaded this Candidate Key capture device by computer, to finish the described Candidate Key acquisition method of leading portion.
In sum, Candidate Key capture device of the present invention, Candidate Key acquisition method and computer program product thereof can be according to the data stroke count of tables of data and the data types of each attribute, elder generation's filtering can not become the combinations of attributes of Candidate Key, then, again according to the data phase heteromerism of each attribute, data stroke count that tables of data is contained and the selected attribute number that combinations of attributes comprised, by capturing Candidate Key in the combinations of attributes after the filtering, therefore the present invention can intercept out Candidate Key accurately with in being made up by many pen attributes effectively, select the error that Candidate Key is produced to reduce by manual type, the shortcoming of prior art gets and is effectively overcome by this.
Description of drawings
Behind the embodiment of consulting accompanying drawing and describing subsequently, affiliated technical field has knows that usually the knowledgeable just can understand other purpose of the present invention, advantage and technological means of the present invention and implement aspect, wherein:
Fig. 1 is the synoptic diagram of the first embodiment of the present invention; And
Fig. 2 A to Fig. 2 E is the process flow diagram of the second embodiment of the present invention.
Embodiment
Below will explain content of the present invention by embodiment, and the invention relates to a kind of Candidate Key capture device, Candidate Key acquisition method and computer program product thereof, it is according to information contained in the tables of data, captures a Candidate Key.It should be noted that embodiments of the invention are not limited to particular environment, use or enforcement that therefore, the description of following examples is not restriction of the present invention only for the purpose of illustration.What must illustrate is in following examples and the accompanying drawing, to omit and do not illustrate with the non-directly related assembly of the present invention; And each interelement size relationship is only for asking easy understanding in the accompanying drawing, and is non-in order to the restriction actual ratio.
The first embodiment of the present invention as shown in Figure 1, it is a kind of synoptic diagram of Candidate Key capture device 1, Candidate Key capture device 1 comprises a storage element 11 and a microprocessor 13, storage element 11 is electric connection with microprocessor 13.Candidate Key capture device 1 reads a tables of data 2 from the outside, and tables of data 2 is stored in storage element 11.Tables of data 2 is loaded with a data phase heteromerism of a data stroke count of tables of data 2, a plurality of attribute, each attribute, a data type of each attribute and an expression figure place of each attribute.
For convenience of description, the tables of data 2 of present embodiment can be the tables of data as table 2 record student master data, and tables of data 2 has 5 data stroke counts, 4 kinds of attributes (i.e. " sex ", " blood group ", " photo " and " student number ").The data type of attribute " sex " is a character string, and the expression figure place is 1, and data phase heteromerism is 2; The data type of attribute " blood group " is a character string, and the expression figure place is 2, and data phase heteromerism is 4; The data type of attribute " photo " is the big object of binary (Binary Large Object; Call BLOB in the following text) picture file, the expression figure place be 2, data phase heteromerism is 5; The data type of attribute " student number " is a character string, and the expression figure place is 6, and data phase heteromerism is 5.
Sex (1) Blood group (2) Photo (2) Student number (6)
1 The man A imgA001 A001
2 The man B imgA002 A002
3 The woman AB imgA003 A003
4 The woman B imgA004 A004
5 The woman O imgA005 A005
Table 2
When initial start-up, Candidate Key capture device 1 is not handled because of carrying out any Candidate Key acquisition as yet, the Candidate Key that does not have any tables of data 2 exists, and in view of the above, microprocessor 13 will produce one first combinations of attributes according to data type and these attributes of each attribute earlier.Specifically, microprocessor 13 elder generations are according to the data type of each attribute, filtering can not be as the attribute of Candidate Key, for example in order to store the BLOB file and the big obj ect file of character (the Character Large Object of files such as picture, sound, image, compressed file; Call CLOB in the following text), may be first combinations of attributes of Candidate Key to produce according to screening attribute later.
According to the above, microprocessor 13 is the attribute " photo " of BLOB with data type in the filtering table 2, and then, microprocessor 13 produces first combinations of attributes according to the attribute after the filtering, this first combinations of attributes comprises at least one selected attribute, selected attribute be attribute one of them.With table 2 is example, and in this stage, microprocessor 13 produces first combinations of attributes " sex+blood group ", and first combinations of attributes " sex+blood group " comprises 2 selected attributes " sex " and " blood group ".
Preferably, in present embodiment, microprocessor 13 also can meet the requirement of preliminary uniqueness to guarantee combinations of attributes in the lump according to the expression figure place and the combination of data stroke count generation multiattribute of each attribute.For example, the expression figure place of attribute " sex " is 1, then combinations of attributes " sex " can be distinguished 2 data (being the boys and girls) at most, since combinations of attributes " sex " but at most only distinguishes data keep count of (2) be the data stroke count (5) that is less than tables of data 2, so microprocessor 13 should filter combinations of attributes " sex ".
On the other hand, the expression figure place of attribute " blood group " is 2, then total expression figure place of first combinations of attributes " sex+blood group " is 3, then can to distinguish 8 data at most (be woman+A, woman+B, woman+AB, woman+O, man+A, man+B, man+AB and man+O) to combinations of attributes " sex+blood group ", since first combinations of attributes " sex+blood group " but distinguishes data number (8) greater than the data stroke count (5) of tables of data 2, so microprocessor 13 can keep first combinations of attributes " sex+blood group ".
Then, microprocessor 13 will judge whether storage element 11 has had Candidate Key, and when being initial start-up owing to Candidate Key capture device 1, so storage element 11 will can not have any Candidate Key.After judging that storage element 11 does not have Candidate Key, microprocessor 13 will carry out the judgement of next stage to first combinations of attributes " sex+blood group ".
Particularly, next microprocessor 13 will judge first combinations of attributes " sex+blood group " selected attribute (i.e. " sex " and " blood group ") data mutually a product of heteromerism whether more than or equal to this data stroke count.By the relevant narration of aforementioned table 2 as can be known, the data phase heteromerism of selected attribute " sex " is 2, the data phase heteromerism of selected attribute " blood group " is 4, and the data of selected attribute " sex " and selected attribute " blood group " product of heteromerism (promptly 8) mutually are greater than data stroke count (5), therefore.Microprocessor 13 will judge first combinations of attributes " sex+blood group " selected attribute (i.e. " sex " and " blood group ") data mutually the product of heteromerism be more than or equal to this data stroke count.
In the data of the selected attribute (i.e. " sex " and " blood group ") of judging first combinations of attributes " sex+blood group " mutually the product of heteromerism be more than or equal to this data stroke count after, microprocessor 13 will produce a judged result according to a quantity of the selected attribute of first combinations of attributes " sex+blood group ", and will to set first combinations of attributes " sex+blood group " according to judged result be a Candidate Key 130.
Specifically, microprocessor 13 is to judge that the quantity of selected attribute of first combinations of attributes " sex+blood group " whether greater than 1, as not, then is set at first combinations of attributes one Candidate Key 130.But first combinations of attributes " sex+blood group " from here as can be known, first combinations of attributes " sex+blood group " comprises two selected attributes " sex " and " blood group ", judged result must show must first combinations of attributes " sex+blood group " selected attribute number greater than 1, therefore must be determined further according to this judged result.
Next, microprocessor 13 will combine combinations of attributes with selected attribute " blood group " to produce one in conjunction with selected attribute " sex ", and follow according to tables of data (i.e. table 2) and in conjunction with a binding data phase heteromerism of combinations of attributes calculations incorporated combinations of attributes, next, microprocessor 13 will judge that whether this binding data phase heteromerism is more than or equal to this data stroke count, in this way, then first combinations of attributes " sex+blood group " is made as Candidate Key 130 and it is stored to storage element 11, as not, then first combinations of attributes " sex+blood group " not can be Candidate Key 130.
For example, as shown in Table 2, comprise " man+A, man+B, woman+B, woman+AB, woman+O " in conjunction with combinations of attributes, binding data phase heteromerism is 5, it is to equal data stroke count (5), therefore first combinations of attributes " sex+blood group " can be made as Candidate Key 130 and it is stored to storage element 11, so far Candidate Key " sex+blood group " produces.
After Candidate Key " sex+blood group " produces, microprocessor 13 also can produce one second combinations of attributes " sex+blood group+student number " according to these data types, these attributes, these expression figure places and this data stroke count, and after one second combinations of attributes " sex+blood group+student number " produced, microprocessor 13 also judged whether storage element 11 has had Candidate Key.
Because Candidate Key " sex+blood group " 130 has been stored in storage element 11, microprocessor 13 will judge that storage element 11 has had Candidate Key 130, and to Candidate Key " sex+blood group " 130 (also can be considered first combinations of attributes " sex+blood group ") and second combinations of attributes " sex+blood group+student number " carry out one with (AND) logical operation, producing an operation result, and judge whether this operation result equals first combinations of attributes " sex+blood group "; In this way, represent that then second combinations of attributes " sex+blood group+student number " does not meet the requirement of minimality, should give rejecting; As not, microprocessor 13 will continue second combinations of attributes " sex+blood group+student number " is carried out aforementioned data phase heteromerism and in conjunction with the judgement of combinations of attributes.
Specifically, the selected attribute that aforementioned each combinations of attributes comprised is a set to represent, according to " sex, blood group, photo, student number " this order, first combinations of attributes " sex+blood group " can (1100) represent that second combinations of attributes " sex+blood group+student number " can (1101) expression.13 pairs first combinations of attributes of microprocessor (1100) and second combinations of attributes (1101) carry out being (1100) with the operation result of logical operation, it is identical with first combinations of attributes (1100), this moment, microprocessor 13 judged that just second combinations of attributes " sex+blood group+student number " does not meet the requirement of minimality, should give rejecting.
Implement aspect in other, if combinations of attributes comprises three selected attributes such as one first selected attribute, one second selected attribute and one the 3rd selected attribute, microprocessor 13 is combined into one first in conjunction with combinations of attributes with the first selected attribute and the second selected attribute, and the second selected attribute and the 3rd selected attribute be combined into one second in conjunction with combinations of attributes, and judge respectively first in conjunction with combinations of attributes and second in conjunction with the binding data phase heteromerism of combinations of attributes whether more than or equal to the data stroke count; If then can set Candidate Key according to the mode of epimere explanation; If not, then microprocessor 13 can continue in conjunction with combinations of attributes and repeat above-mentioned steps.What need emphasize is, how the present invention does not limit in conjunction with selected attribute and produce mode in conjunction with combinations of attributes, and how the visual Demand Design of affiliated technical field is in conjunction with combinations of attributes.
The second embodiment of the present invention is a kind of Candidate Key acquisition method that is used for as the described Candidate Key capture device of first embodiment shown in Fig. 2 A-Fig. 2 E.This Candidate Key capture device comprises a microprocessor and a storage element, this microprocessor and this storage element are electric connection, this storage element is in order to storing a tables of data, and tables of data is loaded with a data stroke count of tables of data, a plurality of attribute, respectively a data phase heteromerism, respectively a data type and the expression figure place of this attribute respectively of this attribute of this attribute.
In addition, the described Candidate Key acquisition method of second embodiment can be carried out by a computer program product, when the Candidate Key capture device loads this computer program product and carries out a plurality of programmed instruction that this computer program product comprises by a computer after, can finish the described Candidate Key acquisition method of second embodiment.Aforesaid computer program product can be stored in the computer-readable recording medium, for example ROM (read-only memory) (read only memory; ROM), flash memory, floppy disk, hard disk, CD, with oneself dish, tape, can or be familiar with this operator and be known and have in any other Storage Media of identical function by the database of network access.
The Candidate Key acquisition method of second embodiment comprises following steps, see also Fig. 2 A, at first execution in step 301, make microprocessor produce a combinations of attributes according to data type, data stroke count, these expression figure places and these attributes of each attribute, it produces details and illustrates in first embodiment, so not at this detailed description.Wherein, this combinations of attributes has at least one selected attribute, and the selected attribute that combinations of attributes comprised is the attribute that corresponds to tables of data.
Then, in step 302, make the microprocessor judges storage element whether have a Candidate Key, in this way, see also Fig. 2 E, then execution in step 311, make microprocessor that this combinations of attributes and this Candidate Key are carried out one and computing, to produce an operation result, then, in step 312, make this operation result of microprocessor judges whether equal this Candidate Key, in this way, represent that then this combinations of attributes does not meet the requirement of minimality, in step 304, make microprocessor reject this combinations of attributes.
Please return ginseng Fig. 2 A, judge that as step 302 the storage element position stores a Candidate Key or step 312 judges that this operation result is not equal to this Candidate Key, then execution in step 303, whether the product of data phase heteromerism that makes the selected attribute that this combinations of attributes of microprocessor judges comprised is more than or equal to the data stroke count, as denying, then the same execution in step 304 makes microprocessor reject this combinations of attributes.
The product of judging the data phase heteromerism of the selected attribute that this combinations of attributes comprised as step 303 is more than or equal to the data stroke count, then execution in step 305, whether the number of attributes that makes the selected attribute that this combinations of attributes of microprocessor judges comprised is greater than 1, see also Fig. 2 B, as not, then execution in step 306, making microprocessor set this combinations of attributes is Candidate Key, next carry out, step 307 makes microprocessor that Candidate Key is stored to storage element.
See also Fig. 2 C, the number of attributes of judging the selected attribute that this combinations of attributes comprised as step 305 is greater than 1, then execution in step 308, make microprocessor engage the selected attribute that this combinations of attributes comprises, to produce one in conjunction with community set, execution in step 309 then, make microprocessor calculate a binding data phase heteromerism according to this in conjunction with community set and this tables of data.
Next see also Fig. 2 D, whether execution in step 310 makes microprocessor judges binding data phase heteromerism more than or equal to this data stroke count, and if not, then execution in step 304, make microprocessor reject this combinations of attributes.If then execution in step 306, making microprocessor set this combinations of attributes is Candidate Key, next carries out, and step 307 makes microprocessor that Candidate Key is stored to storage element.
Except above-mentioned steps, second embodiment also can carry out first embodiment the operation described and the function, under technical field have know usually the knowledgeable can be directly acquainted with second embodiment how based on above-mentioned first embodiment to carry out these operations and function, so do not repeat them here.
In sum, Candidate Key capture device of the present invention, Candidate Key acquisition method and computer program product thereof can be according to the data stroke count of tables of data and the data types of each attribute, elder generation's filtering can not become the combinations of attributes of Candidate Key, then, again according to the data phase heteromerism of each attribute, data stroke count that tables of data is contained and the selected attribute number that combinations of attributes comprised, by capturing Candidate Key in the combinations of attributes after the filtering, therefore the present invention can intercept out Candidate Key accurately with in being made up by many pen attributes effectively, select the error that Candidate Key is produced to reduce by manual type, the shortcoming of prior art gets and is effectively overcome by this.
The above embodiments only are used for exemplifying enforcement aspect of the present invention, and explain technical characterictic of the present invention, are not to be used for limiting protection category of the present invention.Any be familiar with this operator can unlabored change or the arrangement of the isotropism scope that all belongs to the present invention and advocated, the scope of the present invention should be as the criterion with claim.

Claims (8)

1. Candidate Key acquisition method that is used for a Candidate Key capture device, this Candidate Key capture device comprises a microprocessor and a storage element, this storage element is in order to store a tables of data, this tables of data is loaded with a data stroke count of this tables of data, a plurality of attribute, respectively a data phase heteromerism and the data type of this attribute respectively of this attribute, and this Candidate Key acquisition method comprises the following step:
(a) make this microprocessor according to respectively data type and these attributes of this attribute, produce one first combinations of attributes, this first combinations of attributes comprises at least one selected attribute, this at least one selected attribute be these attributes one of them;
(b) making the product of data phase heteromerism of at least one selected attribute of this first combinations of attributes of this microprocessor judges is more than or equal to this data stroke count;
(c) make this microprocessor produce a judged result according to a number of attributes of this at least one selected attribute of this first combinations of attributes; And
(d) make this microprocessor according to this judged result, setting this first combinations of attributes is a Candidate Key.
2. Candidate Key acquisition method according to claim 1, it is characterized in that, this tables of data also is loaded with a respectively expression figure place of this attribute, this step (a) also makes this microprocessor represent figure place, this data stroke count, these data types and these attributes according to these, produces this first combinations of attributes.
3. Candidate Key acquisition method according to claim 1 is characterized in that, this first combinations of attributes comprises a plurality of selected attributes, and this Candidate Key acquisition method also comprises the following step:
(e) make this microprocessor according to this judged result, in conjunction with these selected attributes, to produce one in conjunction with combinations of attributes;
(f) make this microprocessor according to this in conjunction with combinations of attributes and this tables of data, calculate this binding data phase heteromerism in conjunction with combinations of attributes; And
(g) making this binding data phase heteromerism of this microprocessor judges is more than or equal to this data stroke count, is this Candidate Key to set this first combinations of attributes.
4. Candidate Key acquisition method according to claim 1 is characterized in that, this step (a) also produces one second combinations of attributes, and this Candidate Key acquisition method also comprises the following step:
(h) make this microprocessor that this first combinations of attributes and this second combinations of attributes are carried out one and logical operation, to produce an operation result; And
(i) make this operation result of this microprocessor judges be not equal to this first combinations of attributes.
5. Candidate Key capture device comprises:
One storage element, in order to storing a tables of data, this tables of data is loaded with a data stroke count of this tables of data, a plurality of attribute, respectively a data phase heteromerism and the data type of this attribute respectively of this attribute; And
One microprocessor, itself and this storage element is electric connection, and in order to:
According to respectively data type and these attributes of this attribute, produce one first combinations of attributes, this first combinations of attributes comprises at least one selected attribute, this at least one selected attribute be these attributes one of them;
A product of data phase heteromerism of judging at least one selected attribute of this first combinations of attributes is more than or equal to this data stroke count;
Number of attributes according to this at least one selected attribute of this first combinations of attributes produces a judged result; And
According to this judged result, setting this first combinations of attributes is a Candidate Key.
6. Candidate Key capture device according to claim 5, it is characterized in that, this tables of data also is loaded with a respectively expression figure place of this attribute, and this microprocessor also in order to according to these expression figure places, this data stroke count, these data types and these attributes, produces this first combinations of attributes.
7. Candidate Key capture device according to claim 5 is characterized in that, this first combinations of attributes comprises a plurality of selected attributes, this microprocessor also in order to:
According to this judged result, in conjunction with these selected attributes, to produce one in conjunction with combinations of attributes;
In conjunction with combinations of attributes and this tables of data, calculate this binding data phase heteromerism according to this in conjunction with combinations of attributes; And
Judge that this binding data phase heteromerism is more than or equal to this data stroke count, be this Candidate Key to set this first combinations of attributes.
8. Candidate Key capture device according to claim 5 is characterized in that, this microprocessor also in order to:
According to respectively data type and these attributes of this attribute, produce one second combinations of attributes;
This first combinations of attributes and this second combinations of attributes are carried out one and logical operation, to produce an operation result; And
Judge that this operation result is not equal to this first combinations of attributes.
CN200910222294.1A 2009-11-18 2009-11-18 Candidate key capture device and candidate key capture method Expired - Fee Related CN102063434B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN200910222294.1A CN102063434B (en) 2009-11-18 2009-11-18 Candidate key capture device and candidate key capture method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200910222294.1A CN102063434B (en) 2009-11-18 2009-11-18 Candidate key capture device and candidate key capture method

Publications (2)

Publication Number Publication Date
CN102063434A true CN102063434A (en) 2011-05-18
CN102063434B CN102063434B (en) 2013-03-27

Family

ID=43998714

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200910222294.1A Expired - Fee Related CN102063434B (en) 2009-11-18 2009-11-18 Candidate key capture device and candidate key capture method

Country Status (1)

Country Link
CN (1) CN102063434B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112446043A (en) * 2019-08-30 2021-03-05 中国移动通信有限公司研究院 Method for determining category candidate key and electronic equipment

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5826259A (en) * 1990-05-21 1998-10-20 Financial Systems Technology Pty. Ltd. Easily expandable data processing system and method
CN1270363A (en) * 1999-04-09 2000-10-18 英业达股份有限公司 Database management method
US20020169793A1 (en) * 2001-04-10 2002-11-14 Latanya Sweeney Systems and methods for deidentifying entries in a data source
CN1885289A (en) * 2005-06-23 2006-12-27 华硕电脑股份有限公司 Data search method and relative apparatus and computer readable medium

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5826259A (en) * 1990-05-21 1998-10-20 Financial Systems Technology Pty. Ltd. Easily expandable data processing system and method
CN1270363A (en) * 1999-04-09 2000-10-18 英业达股份有限公司 Database management method
US20020169793A1 (en) * 2001-04-10 2002-11-14 Latanya Sweeney Systems and methods for deidentifying entries in a data source
CN1885289A (en) * 2005-06-23 2006-12-27 华硕电脑股份有限公司 Data search method and relative apparatus and computer readable medium

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112446043A (en) * 2019-08-30 2021-03-05 中国移动通信有限公司研究院 Method for determining category candidate key and electronic equipment

Also Published As

Publication number Publication date
CN102063434B (en) 2013-03-27

Similar Documents

Publication Publication Date Title
CN101208695B (en) Managing metadata for graph-based computations
CN103810527B (en) Data manipulation execution, data quality metric and data element coupling method and system
CN110019486A (en) Collecting method, device, equipment and storage medium
US20110161132A1 (en) Method and system for extracting process sequences
CN106104592A (en) Map band key entity attributes
CN103955577B (en) Computer automatic design method for mechanical equipment
CN107622103A (en) Manage data query
CN102880780A (en) Systems and methods for creating intuitive context for analysis data
CN109684616A (en) Dynamic statement formula assembles the method and system made a report on
KR100457375B1 (en) Method for fast searching and displaying of patent genealogical status from a patent database
CN104298736A (en) Method and device for aggregating and connecting data as well as database system
CN104021156A (en) Method for rapidly collecting multi-layer fact data based on SQL statements
CN103077192A (en) Data processing method and system thereof
CN107729330B (en) Method and apparatus for acquiring data set
CN112214557B (en) Data matching classification method and device
CN102707938A (en) Table-form software specification manufacturing and supporting method and device
CN111221698A (en) Task data acquisition method and device
CN111913962A (en) Multi-dimensional annual detailed fund planning system and method
CN102063434B (en) Candidate key capture device and candidate key capture method
CN105573984B (en) The recognition methods of socio-economic indicator and device
TW200417884A (en) System and method for automatically classifying bill of material
JP5367112B2 (en) Data analysis support device and data analysis support processing program
WO2004038582A1 (en) Data processing method and data processing program
CN103761188A (en) Automated testing method for electronic file management system
CN108009787A (en) A kind of Audit data comparative analysis management system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130327

CF01 Termination of patent right due to non-payment of annual fee