CN113590538B - Laboratory data management platform - Google Patents

Laboratory data management platform Download PDF

Info

Publication number
CN113590538B
CN113590538B CN202110787097.5A CN202110787097A CN113590538B CN 113590538 B CN113590538 B CN 113590538B CN 202110787097 A CN202110787097 A CN 202110787097A CN 113590538 B CN113590538 B CN 113590538B
Authority
CN
China
Prior art keywords
file
data processing
storage module
processing module
data
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.)
Active
Application number
CN202110787097.5A
Other languages
Chinese (zh)
Other versions
CN113590538A (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.)
Hunan Construction Engineering Quality Inspection Center Co ltd
Original Assignee
Hunan Construction Engineering Quality Inspection Center Co ltd
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 Hunan Construction Engineering Quality Inspection Center Co ltd filed Critical Hunan Construction Engineering Quality Inspection Center Co ltd
Priority to CN202110787097.5A priority Critical patent/CN113590538B/en
Publication of CN113590538A publication Critical patent/CN113590538A/en
Application granted granted Critical
Publication of CN113590538B publication Critical patent/CN113590538B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/14Details of searching files based on file metadata
    • G06F16/148File search processing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/14Details of searching files based on file metadata
    • G06F16/156Query results presentation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0639Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • G06Q10/06395Quality analysis or management

Abstract

The invention relates to a laboratory data management platform which comprises a database, a data processing module and a data interaction module, wherein the database comprises a first storage module, a second storage module and a third storage module. According to the invention, when vocabulary retrieval is carried out, the data processing module calculates the criticality between the file and the search vocabulary, the criticality is calculated according to the number of the files containing the search vocabulary, the size of the files containing the search vocabulary, the file entry time and the access frequency of the files, the file display accuracy during retrieval is ensured, the problem that only one mode can be selected for sorting the retrieved related files in the conventional file retrieval is avoided, the criticality value is intelligently calculated through multiple parameters, and the files are sorted and displayed according to the criticality value is solved, so that the retrieval efficiency is increased.

Description

Laboratory data management platform
Technical Field
The invention relates to the technical field of data management, in particular to a laboratory data management platform.
Background
At present, quality systems are mostly established and operated by detection laboratories in China according to the regulations of relevant file standards such as 'universal requirements for qualification and qualification evaluation of detection and detection institutions for detection and detection institutions' RB/T214-2017 and/or 'acceptance criteria for detection and calibration laboratory' CNAS-CL01-2018, wherein the quality systems relate to management requirements in various quality technical aspects, a large number of quality technical data records can be generated in the operation process, and the generation, application and management of the records are very important for laboratories. The traditional detection laboratory manually records the system operation data in a paper material for storage, and has the defects of low efficiency, easy loss, difficult retrieval and the like; novel detection laboratory realizes the electronization of data storage gradually, the file of preventing loses, however, current laboratory data management platform often is simple to data storage, when carrying out file retrieval, often can only sort the file of retrieval according to single options such as time, size, download volume, and the retrieval is intelligent inadequately, leads to retrieval inefficiency.
Disclosure of Invention
Therefore, the invention provides a laboratory data management platform which is used for solving the problem of low retrieval efficiency caused by insufficient intelligence in the retrieval process in the prior art.
To achieve the above objects, the present invention provides a laboratory data management platform, comprising,
the database is used for storing laboratory data and comprises a first storage module, a second storage module and a third storage module, wherein the first storage module is used for permanently storing the data, the second storage module is used for temporarily storing the data, and the third storage module is used for storing key data;
the data processing module is respectively connected with the first storage module, the second storage module and the third storage module;
the data interaction module is connected with the data processing module, and a user can read and interact data through the data interaction module;
when the data management platform is used for content retrieval, a user inputs retrieval words through the data interaction module, the data processing module records that the number of the input words is N, and the data processing module retrieves according to the input words;
when vocabulary retrieval is carried out, the data processing module calculates the criticality between the files and the searched vocabulary, and sequences the retrieved files according to the criticality, and the data interaction module displays the retrieved files;
calculating the criticality according to the number of the searched words, the size of the file containing the searched words, the file entry time and the access frequency of the file;
when the data interaction module displays the retrieved file, different display proportions are set for the first storage module, the second storage module and the third storage module.
Further, when the number of the input search vocabulary is 1, the data processing module records that the input search vocabulary is A, the data processing module compares A with the data in the first storage module, the second storage module and the third storage module respectively,
when the data processing module compares A with the first storage module, and when a file B1 containing a search vocabulary A is stored in the first storage module, the data processing module calculates the criticality E1 of the search vocabulary A in the file B1, wherein E1 is F/H × G × L, F is the number of times of occurrence of the vocabulary A in the file B1, H is a compensation parameter evaluated by the file size of the file B1 to the criticality E1, G is a compensation parameter evaluated by the access amount of the file B1 to the criticality E1, and L is a compensation parameter evaluated by the data entry time to the criticality E1.
Furthermore, a first evaluation parameter B1 of the file size of the file B1 and a second evaluation parameter B2 of the file size are set in the data processing module; the data processing module compares the data file size B of the file B1 with the file size first rating parameter B1 and the file size second rating parameter B2,
when b is not more than b1, the data processing module sets H to H1;
when b is greater than b1 and less than or equal to b2, the data processing module sets H to H2;
when b > b2, the data processing module sets H to H3.
Furthermore, a first preset access amount evaluation parameter m1 and a second preset access amount evaluation parameter m2 are also arranged in the data processing module, the data processing module counts the access amount m of the file B1, the data processing module compares the access amount m with a first preset access amount evaluation parameter m1 and a second preset access amount evaluation parameter m2,
when m is less than or equal to m1, the data processing module sets G to be G1;
when m is more than m1 and less than or equal to m2, the data processing module sets G to be G2;
when m > m2, the data processing module sets G to G3.
Furthermore, a first preset data entry time evaluation parameter t1 and a second preset data entry time evaluation parameter t2 are also arranged in the data processing module, the data processing module counts the entry time t of the data of the file B1, the data processing module compares the entry time t of the data of the file B1 with the first preset data entry time evaluation parameter t1 and the second preset data entry time evaluation parameter t2,
when t is less than or equal to t1, the data processing module sets L to be L1;
when t is more than t1 and less than or equal to t2, the data processing module sets L to be L2;
when t > t2, the data processing module sets L to L3.
Further, when a plurality of files B1, B2, and B3 … containing the search vocabulary a are stored in the first storage module, the data processing module calculates the criticality E1, E2, and E3 … of each file, and the data processing module sorts the files B1, B2, and B3 containing the search vocabulary a in the first storage module from large to small according to the criticality, so as to facilitate file display.
When the files C1, C2 and C3 … containing the retrieval vocabulary A in the second storage module or the files D1, D2 and D3 containing the retrieval vocabulary A in the third storage module, the data processing module calculates the criticalities P1, P2 and P3 of the files C1, C2 and C3 in the second storage module and the criticalities Q1, Q2 and Q3 of the files D1, D2 and D3 in the third storage module about the retrieval vocabulary A according to the method of calculating the criticalities E1, E2 and E3 by the first storage module; and the data processing module sequences the criticality from large to small so as to facilitate file display.
Further, the data processing module displays files containing the retrieval vocabulary A in the first storage module, the second storage module and the third storage module, wherein each display Z files comprise Z1 files in the first storage module, Z2 files in the second storage module and Z3 files in the third storage module.
Further, when the number N of the input search vocabulary is greater than 1, the data processing module records that the first input search vocabulary is a1, the second input search vocabulary is a2, the nth input search vocabulary is An, the data processing module compares a1, a2, An with the first storage module, and when the file B1 stored in the first storage module contains a search vocabulary a1 or a2 or An, the data processing module calculates the degree of criticality E1 of the search vocabulary in the file B1, E1 ═ F1/H + F2/H + … Fn/H) × R × G × L (F1/H + F … Fn/H) of the search vocabulary in the file B1, where F1 is the number of occurrences of the vocabulary a1 in the file B1, F2 is the number of occurrences of the vocabulary a2 in the file B1, Fn is the number of occurrences of the vocabulary An in the file B1, and R is the number of occurrences of the search vocabulary in the file B1 as E1 compensation parameters.
Further, when only one of the search terms a1, a2 or An exists in the document B1, R is R, and R is a base value of the compensation parameter R;
when the file B1 contains i search words in the search words A1, A2 or An, i is more than or equal to 2,
R=r+(i-1)/n。
further, when a plurality of files B1, B2 and B3 … containing retrieval words A1, A2 or An are stored in the first storage module, the data processing module respectively calculates criticality E1, E2 and E3 … of each file, and the data processing module sorts the criticality from large to small so as to display the files;
when the files C1, C2 and C3 … containing the retrieval words A1 or A2 or An in the second storage module or the files D1, D2 and D3 containing the retrieval words A1 or A2 or An in the third storage module, the data processing module calculates the criticalities P1, P2 and P3 of the files C1, C2 and C3 related to the retrieval words A1 or A2 or An in the second storage module and the criticalities Q1, Q2 and Q3 of the files D1, D2 and D3 related to the retrieval words A1 or A2 or An in the third storage module according to the method of calculating the criticalities E1, E2 and E3 by the first storage module.
Compared with the prior art, the method has the advantages that when the data management platform is used for content retrieval, a user inputs retrieval words through the data interaction module, the data processing module records that the number of the input words is N, and the data processing module retrieves according to the input words; when vocabulary retrieval is carried out, the data processing module calculates the criticality between the files and the searched vocabulary, and sequences the retrieved files according to the criticality, and the data interaction module displays the retrieved files; calculating the criticality according to the number of the searched words, the size of the file containing the searched words, the file entry time and the access frequency of the file; the method has the advantages that the files are displayed according to the criticality, meanwhile, the criticality is calculated through multiple parameters, the accuracy of file display during retrieval is guaranteed, the problem that the retrieved related files are often sorted in one mode only in the conventional file retrieval is solved, the criticality value is intelligently calculated through multiple parameters, the files are sorted and displayed according to the criticality value, and the retrieval efficiency is improved.
Furthermore, when only one input retrieval word is available, if the file contains a keyword, the criticality between the file and the keyword is calculated, wherein the criticality calculation comprises the adjustment of the criticality value according to the occurrence frequency of the word A in the file B1, the size of the B1 file, the B1 access amount and the B1 data entry time, so that the problem that the conventional file retrieval can only select one mode to sort the retrieved related files is solved, the criticality value is intelligently calculated through multiple parameters, and the files are sorted and displayed according to the criticality value, and the retrieval efficiency is improved.
Particularly, a first evaluation parameter B1 of the file size of the file B1 and a second evaluation parameter B2 of the file size are set in the data processing module; the data processing module compares the data file size B of the file B1 with a first file size evaluation parameter B1 and a second file size evaluation parameter B2, the criticality of the file is adjusted by judging the size of the file, and when the whole file is large, the occurrence frequency of keywords is more, the situation is reasonable, therefore, the compensation parameter H is set for evaluating the criticality E1 according to the size of the file, when the criticality of a certain file is calculated, the occurrence frequency of the file is divided by the compensation parameter H, the compensation parameter H in different files is different, the compensation parameter H selected for the file is large, and when the criticality of the certain file is calculated, the occurrence frequency of the keywords is large, the key value of the file is increased mistakenly, the calculation accuracy of the key value is guaranteed, and the retrieval efficiency is increased.
Particularly, a first preset access amount evaluation parameter m1 and a second preset access amount evaluation parameter m2 are further arranged in the data processing module, the data processing module counts the access amount m of the file B1, the data processing module compares the access amount m with the first preset access amount evaluation parameter m1 and the second preset access amount evaluation parameter m2, when the criticality is calculated, the criticality is adjusted according to the access amount of a file, when the access amount of the file is large, the file is required with a high probability, so that when the access amount is large, the access amount is increased to evaluate the value of the compensation parameter of the criticality E1, the accuracy of calculation of the criticality value is guaranteed, and the retrieval efficiency is increased.
Particularly, a first preset data entry time evaluation parameter t1 and a second preset data entry time evaluation parameter t2 are further arranged in the data processing module, the data processing module counts the entry time t of data of a file B1, the data processing module compares the entry time t of the data of the file B1 with the first preset data entry time evaluation parameter t1 and the second preset data entry time evaluation parameter t2, when the criticality is calculated, the criticality of the file is scored according to the data entry time, when the entry time is short, the data entry time is increased to evaluate a compensation parameter of the criticality E1, and the situation that the entry time is short, the access amount is small, and the wrong underestimation criticality score is caused is prevented; the accuracy of calculating the criticality value is guaranteed, and the retrieval efficiency is improved.
Further, the data processing module displays the files containing the search vocabulary a in the first storage module, the second storage module and the third storage module, wherein each Z-number of displayed files includes Z1 files in the first storage module, Z2 files in the second storage module and Z3 files in the third storage module, and when displaying the files, the files in the first storage module, the second storage module and the third storage module are displayed according to a certain proportion, wherein the first storage module is a permanent storage module, and the amount of the files contained in the first storage module is the largest, so that the first storage module is given the largest display proportion of the files, the third storage module is used for storing important data, the value of the file data in the third storage module is higher, but the number base number of the files contained in the third storage module is smaller than that in the first storage module, therefore, the file display proportion given to the third storage module is smaller than that of the first storage module, the second storage module is used for storing temporary data, the data volume in the second storage module is smaller, meanwhile, as the temporary data storage module, a part of data stored by the second storage module is experiment stage data, and the reference is lower, so that the file display proportion given to the second storage module is minimum, the displayed file is ensured to meet the requirements of a searcher, and the retrieval efficiency is accelerated.
Further, when the number N of the input search words is greater than 1, the data processing module records that the first input search word is a1, the second input search word is a2, the nth input search word is An, the data processing module compares a1, a2 and An with the first storage module, when the file B1 stored in the first storage module contains a search word a1 or a2 or An, the data processing module calculates the key degree E1, E1 ═ F1/H + F2/H + … Fn/H) xrxg × L of the search word in the file B1, when a plurality of keywords are searched simultaneously, if the file contains one or more keywords, the key degree between the file and the keywords is calculated, and the number of times of each keyword appears is compared with the file size evaluation compensation parameter H E1 in the calculation process, and calculating the overall criticality, and setting the number of the retrieval words appearing in the file B1 to compensate the parameter R for the criticality E1, so that the accuracy of calculating the criticality is ensured, and the retrieval efficiency is accelerated.
In particular, when only one of the search terms a1, a2 or An is stored in the document B1, R is R, and R is a base value of the compensation parameter R; when the file B1 contains i search terms in the search terms A1, A2 or An, i is more than or equal to 2, and R is R + (i-1)/n; when the file only contains one keyword, the integral relevance of the file and the searched keyword is low, the probability that the file meets the requirements of a search user is low, so that when a plurality of keyword searches are carried out, but only one word in the file meets the searched word, the compensation parameter R is calculated only according to the basic value, when the file contains more than one searched word, the probability that the file meets the requirements of the search user is gradually increased, the compensation parameter R value is increased, the calculated keyword value E1 is increased, and the search efficiency is accelerated.
Drawings
Fig. 1 is a schematic structural diagram of a laboratory data management platform according to the present invention.
Detailed Description
In order that the objects and advantages of the invention will be more clearly understood, the invention is further described below with reference to examples; it should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Preferred embodiments of the present invention are described below with reference to the accompanying drawings. It should be understood by those skilled in the art that these embodiments are only for explaining the technical principle of the present invention, and do not limit the scope of the present invention.
It should be noted that in the description of the present invention, the terms of direction or positional relationship indicated by the terms "upper", "lower", "left", "right", "inner", "outer", etc. are based on the directions or positional relationships shown in the drawings, which are only for convenience of description, and do not indicate or imply that the device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and thus, should not be construed as limiting the present invention.
Furthermore, it should be noted that, in the description of the present invention, unless otherwise explicitly specified or limited, the terms "mounted," "connected," and "connected" are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations.
Referring to fig. 1, a schematic structural diagram of a laboratory data management platform according to the present invention is shown.
The invention discloses a laboratory data management platform, which comprises,
the database 1 is used for storing laboratory data, and the database 1 comprises a first storage module 11, a second storage module 12 and a third storage module 13, wherein the first storage module 11 is used for permanently storing the data, the second storage module 12 is used for temporarily storing the data, and the third storage module 13 is used for storing important data;
a data processing module 2, which is connected to the first storage module 11, the second storage module 12 and the third storage module 13 respectively;
the data interaction module 3 is connected with the data processing module 2, and a user can read and interact data through the data interaction module 3;
when the data management platform is used for content retrieval, a user inputs retrieval words through the data interaction module 3, the data processing module 2 records the number of the input words as N, and the data processing module 2 retrieves according to the input words.
Further, when the number N of the input search vocabulary is 1, the data processing module 2 records the input search vocabulary as a, the data processing module 2 compares a with the data in the first storage module 11, the second storage module 12 and the third storage module 13 respectively,
when the data processing module 2 compares a with the first storage module 11, and when the file B1 in the first storage module 11 contains the search vocabulary a, the data processing module 2 calculates a criticality E1 of the search vocabulary a in the file B1, where E1 is F/H × G × L, where F is the number of occurrences of the vocabulary a in the file B1, H is a compensation parameter for evaluating the criticality E1 by the file size of the file B1, G is a compensation parameter for evaluating the criticality E1 by the access amount of the file B1, and L is a compensation parameter for evaluating the criticality E1 by the data entry time.
When only one input retrieval word is available, if the file contains the keyword, the criticality between the file and the keyword is calculated, the criticality calculation comprises the adjustment of the criticality value according to the occurrence frequency of the word A in the file B1, the size of the B1 file, the B1 access amount and the B1 data entry time, the situation that the searched related files are often sorted in one mode in the conventional file retrieval is avoided, the criticality value is intelligently calculated through multiple parameters, the files are sorted and displayed according to the criticality value, and the retrieval efficiency is improved.
Specifically, the data processing module 2 is provided with a file B1, a first file size evaluation parameter B1 and a second file size evaluation parameter B2; the data processing module 2 compares the data file size B of the file B1 with the file size first rating parameter B1 and the file size second rating parameter B2,
when b is not more than b1, the data processing module 2 sets H to H1;
when b1 is more than b and less than or equal to b2, the data processing module 2 sets H to H2;
when b > b2, the data processing module 2 sets H to H3;
in this embodiment, b1 is 200KB, b2 is 400KB, h1 is 0.5, h2 is 0.7, and h3 is 1.0.
The criticality of the file is adjusted by judging the size of the file, and when the whole file is large, the phenomenon is reasonable when the number of times of occurrence of the keywords is large, so that the compensation parameter H is evaluated by setting the size of the file to the criticality E1, when the criticality of a certain file is calculated, the compensation parameter H is divided by the number of times of occurrence of the file, the compensation parameter H in different files is different, the large selected compensation parameter H of the file is also large, and the situation that when the criticality of a certain file is calculated, the number of times of occurrence of the keywords is large and the key value of the file is mistakenly pulled up is ensured, the calculation accuracy of the key value is ensured, and the retrieval efficiency is increased.
Specifically, the data processing module 2 is further provided with a first preset access amount evaluation parameter m1 and a second preset access amount evaluation parameter m2, the data processing module 2 counts the access amount m of the file B1, the data processing module 2 compares the access amount m with the first preset access amount evaluation parameter m1 and the second preset access amount evaluation parameter m2,
when m is less than or equal to m1, the data processing module 2 sets G to G1;
when m is more than m1 and less than or equal to m2, the data processing module 2 sets G to be G2;
when m > m2, the data processing module 2 sets G to G3;
in this embodiment, m1 is 50, m2 is 100, g1 is 1.1, g2 is 1.2, and g3 is 1.3.
When the criticality is calculated, the criticality is adjusted according to the access number of a file, and when the access number of the file is large, the probability that the file is required is high, so that when the access number is large, the access number is increased to evaluate the value of the compensation parameter of the criticality E1, the calculation accuracy of the criticality value is guaranteed, and the retrieval efficiency is increased.
The data processing module 2 is also internally provided with a first preset data entry time evaluation parameter t1 and a second preset data entry time evaluation parameter t2, the data processing module 2 counts the entry time t of the data of the file B1, the data processing module 2 compares the entry time t of the data of the file B1 with the first preset data entry time evaluation parameter t1 and the second preset data entry time evaluation parameter t2,
when t is less than or equal to t1, the data processing module 2 sets L to be L1;
when t is more than t1 and less than or equal to t2, the data processing module 2 sets L to be L2;
when t > t2, the data processing module 2 sets L to L3.
In this embodiment, t1 ═ 2day, t2 ═ 7day, l1 ═ 1.5, l2 ═ 1.3, and l3 ═ 1.
When the criticality is calculated, the criticality of the file is scored according to the data entry time, wherein when the entry time is short, the data entry time is increased to evaluate compensation parameters for the criticality E1, so that the condition that the criticality scoring is mistakenly underestimated due to small access amount caused by short data entry time is prevented; the accuracy of calculating the criticality value is guaranteed, and the retrieval efficiency is improved.
Specifically, when the first storage module 11 stores a plurality of files B1, B2, and B3 … containing the search vocabulary a, the data processing module 2 calculates the criticality E1, E2, and E3 … of each file, and the data processing module 2 sorts the files B1, B2, and B3 containing the search vocabulary a in the first storage module 11 from large to small according to the criticality, so as to facilitate file display.
When the files C1, C2, C3 … containing the search vocabulary a in the second storage module 12 or the files D1, D2, D3 containing the search vocabulary a in the third storage module 13, the data processing module 2 calculates the criticalities P1, P2, P3 of the files C1, C2, C3 about the search vocabulary a in the second storage module 12 and the criticalities Q1, Q2, Q3 of the files D1, D2, D3 about the search vocabulary a in the third storage module 13 according to the method of calculating the criticalities E1, E2, E3 in the first storage module 11; and the data processing module 2 sorts the criticality from large to small so as to facilitate file display.
Specifically, the data processing module 2 displays the files containing the search vocabulary a in the first storage module 11, the second storage module 12 and the third storage module 13, wherein each display Z files includes Z1 files in the first storage module 11, Z2 files in the second storage module 12 and Z3 files in the third storage module 13;
in the present embodiment, Z is 10, Z1 is 6, Z2 is 1, and Z3 is 3.
When displaying files, the files in the first storage module 11, the second storage module 12 and the third storage module 13 are displayed according to a certain proportion, wherein the first storage module 11 is used as a permanent storage module, the amount of the files contained in the permanent storage module is the largest, so that the first storage module 11 is endowed with the largest file display proportion, the third storage module 13 is used for storing important data, the value of the file data in the third storage module is higher, but the base number of the files contained in the third storage module is considered to be smaller than that of the files contained in the third storage module compared with the first storage module, so that the file display proportion endowed to the third storage module 13 is smaller than that of the first storage module 11, the second storage module 12 is used for storing temporary data, the amount of the data in the second storage module is smaller, and meanwhile, as a temporary data storage module, a part of the data stored in the second storage module 12 is experiment performance stage data, the referential is low, so the file display proportion endowed to the second storage module 12 is minimum, the displayed file is ensured to meet the requirements of a searcher, and the searching efficiency is accelerated.
Further, when the number N of the input search vocabulary is greater than 1, the data processing module 2 records that the first input search vocabulary is a1, the second input search vocabulary is a2, the nth input search vocabulary is An, the data processing module 2 compares a1, a2, An with the first storage module 11, and when the file B1 stored in the first storage module 11 contains a search vocabulary a1 or a2 or An, the data processing module 2 calculates the key degree E1 of the search vocabulary in the file B1, where E1 is (F1/H + F2/H + … Fn/H) × R × G × L, where F1 is the number of occurrences of the vocabulary a1 in the file B1, F2 is the number of occurrences of the vocabulary a2 in the file B1, Fn is the number of occurrences of the vocabulary in the file B1, and R is the key degree compensation parameter for the number E1 of occurrences of the file B1.
When a plurality of keywords are searched simultaneously, if the file contains one or more keywords, the criticality between the file and the keywords is calculated, the number of times of occurrence of each keyword is compared with the file size versus criticality E1 evaluation compensation parameter H in the calculation process, the overall criticality is calculated, meanwhile, the number of search words appearing in the file B1 versus criticality E1 compensation parameter R is set, the accuracy of criticality calculation is guaranteed, and the search efficiency is accelerated.
Specifically, when only one of the search terms a1, a2 or An is stored in the file B1, R is R, and R is a base value of the compensation parameter R;
when the file B1 contains i search words in the search words A1, A2 or An, i is more than or equal to 2,
R=r+(i-1)/n;
in the present embodiment, r is 0.5.
When the file only contains one keyword, the integral relevance of the file and the searched keyword is low, the probability that the file meets the requirements of a search user is low, so that when a plurality of keyword searches are carried out, but only one word in the file meets the searched word, the compensation parameter R is calculated only according to the basic value, when the file contains more than one searched word, the probability that the file meets the requirements of the search user is gradually increased, the compensation parameter R value is increased, the calculated keyword value E1 is increased, and the search efficiency is accelerated.
Specifically, when a plurality of files B1, B2, and B3 … containing search words a1, a2, or An are stored in the first storage module 11, the data processing module 2 calculates criticalities E1, E2, and E3 … of the files, respectively, and the data processing module 2 sorts the criticalities from large to small so as to facilitate file display;
specifically, when the files C1, C2, C3 … containing the search vocabulary a1 or a2 or An in the second storage module 12 or the files D1, D2, D3 containing the search vocabulary a1 or a2 or An in the third storage module 13, the data processing module 2 calculates the criticalities P1, P2, P3 of the files C1, C2, C3 of the second storage module 12 with respect to the search vocabulary a1 or a2 or An according to the method of calculating the criticalities E1, E2, E3 by the first storage module 11, and the criticalities Q1, Q2, Q3 of the files D1, D2, D3 of the third storage module 13 with respect to the search vocabulary a1 or a2 or An.
The scheme adopts the micro Soft Office Excel spreadsheet Office software as a user operation interface, and object-oriented Application program development is carried out through Visual Basic for Application macro language, so that the Excel realizes the operations of adding, modifying, deleting and inquiring detection laboratory quality technical data by connecting with an SQL Server database, and the functions of authorized login, remote operation, collaborative editing, data sharing and the like can be realized by connecting with an FTP file Server to upload, download, delete and the like the detection laboratory quality technical files.
According to the scheme, a MicroSoft Office Excel spreadsheet is used as an operation frame, and through connecting a built SQL Server database and an FTP file Server, relevant data records and files of the laboratory quality detection technology are subjected to electronic and information management in a data + attachment mode.
According to the scheme, a MicroSoft Office Excel spreadsheet is used as an operation frame, and through connecting a built SQL Server database and an FTP file Server, the relevant data records and files of the quality detection laboratory technology are subjected to electronic and information management in a data + attachment mode.
So far, the technical solutions of the present invention have been described in connection with the preferred embodiments shown in the drawings, but it is apparent to those skilled in the art that the scope of the present invention is not limited to these specific embodiments. Equivalent changes or substitutions of related technical features can be made by those skilled in the art without departing from the principle of the invention, and the technical scheme after the changes or substitutions can fall into the protection scope of the invention.

Claims (8)

1. A laboratory data management platform is characterized by comprising,
the database is used for storing laboratory data and comprises a first storage module, a second storage module and a third storage module, wherein the first storage module is used for permanently storing the data, the second storage module is used for temporarily storing the data, and the third storage module is used for storing key data;
the data processing module is respectively connected with the first storage module, the second storage module and the third storage module;
the data interaction module is connected with the data processing module, and a user can read and interact data through the data interaction module;
when the data management platform is used for content retrieval, a user inputs retrieval words through the data interaction module, the data processing module records that the number of the input words is N, and the data processing module retrieves according to the input words;
when vocabulary retrieval is carried out, the data processing module calculates the criticality between the files and the searched vocabulary, and sequences the retrieved files according to the criticality, and the data interaction module displays the retrieved files;
calculating the criticality according to the number of the searched words, the size of the file containing the searched words, the file entry time and the access frequency of the file;
when the data interaction module displays the retrieved file, different display proportions are set for the first storage module, the second storage module and the third storage module;
when the number of the input retrieval words N =1, the data processing module records that the input retrieval words are A, the data processing module compares A with the data in the first storage module, the second storage module and the third storage module respectively,
when the data processing module compares A with the first storage module, and when a file B1 stored in the first storage module contains a retrieval vocabulary A, the data processing module calculates the criticality E1 of the retrieval vocabulary A in a file B1, E1= F/H × G × L, wherein F is the number of times of occurrence of vocabulary A in a file B1, H is a compensation parameter of file B1 file size to criticality E1, G is a compensation parameter of file B1 access amount to criticality E1, and L is a compensation parameter of data entry time to criticality E1;
when the number N of input search vocabularies is larger than 1, the data processing module records that a first input search vocabulary is A1, a second input search vocabulary is A2, An nth input search vocabulary is An, the data processing module compares A1, A2 and An with the first storage module, when a file B1 stored in the first storage module contains a search vocabulary A1 or A2 or An, the data processing module calculates the criticality E1 of the search vocabulary in the file B1, E1= (F1/H + F2/H + … Fn/H) × R × G × L, wherein F1 is the number of times of occurrence of a vocabulary A1 in the file B1, F2 is the number of times of occurrence of a vocabulary A2 in the file B1, Fn is the number of occurrence of times of the vocabulary A An in the file B1, and R is a compensation parameter for the number E1 of the search vocabulary of occurrence in the file B1.
2. The laboratory data management platform according to claim 1, wherein the data processing module is provided with a file B1 file size first evaluation parameter B1, a file size second evaluation parameter B2; the data processing module compares the data file size B of the file B1 with the file size first rating parameter B1 and the file size second rating parameter B2,
when b is not more than b1, the data processing module sets H to H1;
when b is greater than b1 and less than or equal to b2, the data processing module sets H to H2;
when b > b2, the data processing module sets H to H3.
3. The laboratory data management platform according to claim 2, wherein a first preset access amount evaluation parameter m1 and a second preset access amount evaluation parameter m2 are further provided in the data processing module, the data processing module counts the access amount m of the file B1, the data processing module compares the access amount m with the first preset access amount evaluation parameter m1 and the second preset access amount evaluation parameter m2,
when m is less than or equal to m1, the data processing module sets G to be G1;
when m is more than m1 and less than or equal to m2, the data processing module sets G to be G2;
when m > m2, the data processing module sets G to G3.
4. The laboratory data management platform according to claim 3, wherein said data processing module further comprises a first preset data entry time evaluation parameter t1 and a second preset data entry time evaluation parameter t2, said data processing module counts the time t of entry of the data of the file B1, said data processing module compares the time t of entry of the data of the file B1 with the first preset data entry time evaluation parameter t1 and the second preset data entry time evaluation parameter t2,
when t is less than or equal to t1, the data processing module sets L to be L1;
when t is more than t1 and less than or equal to t2, the data processing module sets L to be L2;
when t > t2, the data processing module sets L to L3.
5. The laboratory data management platform according to claim 4, wherein when a plurality of files B1, B2 and B3 … containing search vocabulary A exist in the first storage module, the data processing module calculates criticalities E1, E2 and E3 … of the files respectively, the data processing module sorts the files B1, B2 and B3 containing the search vocabulary A in the first storage module from large to small according to the criticalities so as to facilitate file display,
when the files C1, C2 and C3 … containing the retrieval vocabulary A in the second storage module or the files D1, D2 and D3 containing the retrieval vocabulary A in the third storage module, the data processing module calculates the criticalities P1, P2 and P3 of the files C1, C2 and C3 about the retrieval vocabulary A in the second storage module and the criticalities Q1, Q2 and Q3 of the files D1, D2 and D3 about the retrieval vocabulary A in the third storage module according to the method of calculating the criticalities E1, E2 and E3 by the first storage module; and the data processing module sequences the criticality from large to small so as to facilitate file display.
6. The laboratory data management platform of claim 5, wherein the data processing module displays the files in the first storage module, the second storage module, and the third storage module that contain the search vocabulary A, wherein each Z-number of displayed files comprises Z1 files in the first storage module, Z2 files in the second storage module, and Z3 files in the third storage module.
7. The laboratory data management platform according to claim 1, wherein when only one of the words a1, a2 or An is stored in the file B1, R = R, R is a basic value of the compensation parameter R;
when the file B1 contains i search words in the search words A1, A2 or An, i is more than or equal to 2,
R=r+(i-1)/n。
8. the laboratory data management platform according to claim 7, wherein when a plurality of files B1, B2 and B3 … containing search words a1, a2 and An are stored in the first storage module, the data processing module respectively calculates criticalities E1, E2 and E3 … of the files, and the data processing module sorts the criticalities from large to small for file display;
when the files C1, C2 and C3 … containing the retrieval words A1 or A2 or An in the second storage module or the files D1, D2 and D3 containing the retrieval words A1 or A2 or An in the third storage module, the data processing module calculates the criticalities P1, P2 and P3 of the files C1, C2 and C3 related to the retrieval words A1 or A2 or An in the second storage module and the criticalities Q1, Q2 and Q3 of the files D1, D2 and D3 related to the retrieval words A1 or A2 or An in the third storage module according to the method of calculating the criticalities E1, E2 and E3 by the first storage module.
CN202110787097.5A 2021-07-13 2021-07-13 Laboratory data management platform Active CN113590538B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110787097.5A CN113590538B (en) 2021-07-13 2021-07-13 Laboratory data management platform

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110787097.5A CN113590538B (en) 2021-07-13 2021-07-13 Laboratory data management platform

Publications (2)

Publication Number Publication Date
CN113590538A CN113590538A (en) 2021-11-02
CN113590538B true CN113590538B (en) 2022-05-06

Family

ID=78247572

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110787097.5A Active CN113590538B (en) 2021-07-13 2021-07-13 Laboratory data management platform

Country Status (1)

Country Link
CN (1) CN113590538B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105824872A (en) * 2015-01-27 2016-08-03 国际商业机器公司 Search-based detection, link, and acquisition of data

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2486490A (en) * 2010-12-17 2012-06-20 Royal Holloway & Bedford New College Method for structuring a network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105824872A (en) * 2015-01-27 2016-08-03 国际商业机器公司 Search-based detection, link, and acquisition of data

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
浅谈实验室仪器设备管理;宋芳等;《轻工标准与质量》;20200815;99-100 *

Also Published As

Publication number Publication date
CN113590538A (en) 2021-11-02

Similar Documents

Publication Publication Date Title
US6665661B1 (en) System and method for use in text analysis of documents and records
US7707204B2 (en) Factoid-based searching
EP1622053B1 (en) Phrase identification in an information retrieval system
US8290975B2 (en) Graph-based keyword expansion
EP1844391B1 (en) Multiple index based information retrieval system
EP1622055B1 (en) Phrase-based indexing in an information retrieval system
US20020174095A1 (en) Very-large-scale automatic categorizer for web content
CN111104794A (en) Text similarity matching method based on subject words
EP1585030A2 (en) Automatic Capitalization Through User Modeling
US20120197910A1 (en) Method and system for performing classified document research
US20050246324A1 (en) System and associated device, method, and computer program product for performing metadata-based searches
US9405784B2 (en) Ordered index
US7028045B2 (en) Compressing index files in information retrieval
JPWO2006134682A1 (en) Named entity extraction apparatus, method, and program
US20080288483A1 (en) Efficient retrieval algorithm by query term discrimination
EP1903457B1 (en) Computer-implemented method, computer program product and system for creating an index of a subset of data
US8090720B2 (en) Method for merging document clusters
US8589413B1 (en) Concept-based method and system for dynamically analyzing results from search engines
US20050021508A1 (en) Method and apparatus for calculating similarity among documents
CN108664509A (en) A kind of method, apparatus and server of extemporaneous inquiry
CN113590538B (en) Laboratory data management platform
CN115495457A (en) Data processing system, device and storage medium based on single machine vector database
CN111046195A (en) Intelligent cataloging method for mass media assets
GB2336699A (en) Automatic classification of text files
CN111259145A (en) Text retrieval classification method, system and storage medium based on intelligence data

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant