CN102902760B - Method for detecting demand conflict relation - Google Patents

Method for detecting demand conflict relation Download PDF

Info

Publication number
CN102902760B
CN102902760B CN201210360800.5A CN201210360800A CN102902760B CN 102902760 B CN102902760 B CN 102902760B CN 201210360800 A CN201210360800 A CN 201210360800A CN 102902760 B CN102902760 B CN 102902760B
Authority
CN
China
Prior art keywords
demand
conflict
data
type
relation
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
CN201210360800.5A
Other languages
Chinese (zh)
Other versions
CN102902760A (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.)
National University of Defense Technology
Original Assignee
National University of Defense Technology
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 National University of Defense Technology filed Critical National University of Defense Technology
Priority to CN201210360800.5A priority Critical patent/CN102902760B/en
Publication of CN102902760A publication Critical patent/CN102902760A/en
Application granted granted Critical
Publication of CN102902760B publication Critical patent/CN102902760B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a method for automatically detecting the demand conflict relation. The method comprises the following steps: establishing a demand database and a demand relation database; establishing a conflict relation matrix according to the conflict type; and traversing the conflict relation matrix to detect a demand conflict. According to the method for detecting the demand conflict relation, the demand conflict can be automatically detected and eliminated before a system design runs so that the problems of leakage detection and fault detection are avoided and the accuracy of conflict detection is improved.

Description

A kind of method that detects demand conflict relationship
Technical field
The present invention relates to field of computer technology, specially refer to a kind of method that detects demand conflict relationship in soft project.
Background technology
Soft project is very important content in field of computer technology.In the exploitation of large software, the application of soft project is almost ubiquitous.The cost of development of large software is high, and before the system of developing software, it is carried out to demand analysis is extremely important.Any adjustment of making after demand analysis stage all may bring high cost.
Between detection demand, whether having conflict is an important content.What is called exists to conflict and refers to the contradiction that various relations existence go against the objective laws or user retrains between needing, as there is level exploded relationship between the demand of descriptive system composition, between the demand of descriptive system function, there is level exploded relationship, representation function forms the relations of distribution of demand to system, the relations of distribution may cause system to form that module completes a subfunction and the submodule of this module completes father's function of this subfunction, and this situation is not with generally objective law or general knowledge conform to.
In prior art, detect and processing demands in the solution of conflict in, representative have 4 classes.The 1st class adopts classical logic or accurate classical logic as requirement representation form, and utilizes theorem proving technology to solve demand collision problem.First the 1st class methods are asserted logic by requirement description, describe thin to portraying object properties, then adopt theorem proving technology to carry out the detection of demand conflict, but its realization will be by means of theorem prover, testing process can be carried out automatically, difficult point is how demand is converted to asserted logic, and weak point is that theorem prover efficiency is generally lower.
The 2nd class adopts status change as Requirements Modeling principle, and utilizes the conflict of model testing technical finesse demand.The 2nd class methods are status change system by requirement representation, by whether there being conflict between detection system status change, judgement demand collision problem, difficult point how to be by demand undistorted be converted to system state transition, therefore the efficiency of this method is not high yet.
The 3rd class is usingd aims of systems as Requirements Modeling principle, and utilizes the semantic pattern of target and about the heuristic rule processing demands conflict of target.The target decomposition tree that the 3rd class methods are system by requirement representation, by heuristic rule, carry out difference detection, with target pattern, find the boundary condition that difference occurs, and by difference tupe and heuristic solving, but target detection and analysis tool need specialized designs.
The 4th class utilizes figure to be described demand, by the character of given some specific figure, or the semanteme of some specific pel etc., the conflict of Check processing demand.The 4th class methods represent demand by the form of associated diagram, by the inconsistency of cross reference between searching figure, detect with location requirement and conflict, by artificial treatment, realize clearing up demand inconsistency, this method is that between robotization detection and ease for use is compromise, weak point is that detection need to be to design according to concrete conflict, and these rules are user-defined or depend on business scope.
Therefore, in the urgent need to a kind of, can before system operation, automatically carry out demand conflict relationship detection method at present, can avoid test leakage and mistake to survey, improve the accuracy of demand collision detection.
Summary of the invention
For above-mentioned technical matters, the present invention proposes a kind of method of automatic detection demand conflict relationship, and it comprises: set up demand database and demand relation database; According to the type of conflict, set up conflict relationship matrix; And traveling through described conflict relationship matrix, detection demand is conflicted.
The method of automatic detection demand conflict relationship provided by the invention can detect and remove conflict by simple requirements conflict and Demand mapping conflict, improved the accuracy of demand collision detection, for follow-up exploitation provides important support and the assurance of correctness.
Accompanying drawing explanation
Fig. 1 is the method flow schematic diagram of a kind of automatic detection demand conflict relationship of the embodiment of the present invention;
Fig. 2 is the schematic flow sheet of the method simple requirements conflict of a kind of automatic detection demand conflict relationship of the embodiment of the present invention;
Fig. 3 is the schematic flow sheet of the method Demand mapping conflict of a kind of automatic detection demand conflict relationship of the embodiment of the present invention.
Embodiment
Thought of the present invention is, first, sets up demand database and demand relation database.From the requirement documents of natural language description, or the requirement documents of other types is directly set up demand database and demand relation database is easy, particularly by means of the help of the instruments such as document resolver.Stipulations document has extensively adopted XML form or other canonical forms, and therefore, this step cost is not high.
According to the type of conflict, set up conflict relationship matrix; Then according to different conflict types and conflict relationship matrix, by simple numerical value mode, travel through conflict relationship matrix, or the mode of calculating travels through conflict relationship matrix, find and meet numerical value or the relation of specified conditions, thereby realize the conflict of detection demand.
Along with the development of computer technology, the calculating of matrix and can be fast and realize efficiently.Particularly, for the appearance of the matrix processor of matrix operation, can greatly improve the ability of matrix operation especially.By above mode, the detection of the logical relation of reluctant complexity has been changed into the matrix operation that can automatically be processed and efficiently complete by computing machine.Expansion by computing power has replaced logical capability, by means of the ability that efficiently completes of calculating, thereby solves test problems in logic.
Below in conjunction with specific embodiment, and with reference to accompanying drawing, the present invention is described in more detail.
Consult shown in Fig. 1, the method flow schematic diagram for a kind of automatic detection demand conflict relationship of the embodiment of the present invention, comprising:
Stage one: the requirements specification document of natural language description is converted to the XML document of regularized logic description, data corresponding to described XML document are stored in storer, specific implementation process is as follows:
In one embodiment of the invention, this method reads the requirements specification document of the natural language description of Office Word and Text form, then can utilize document resolver to be converted into the XML document of regularized logic description.Data corresponding to described XML document are stored in storer, can adopt multiple different types of storer with different performance feature, for example internal hard drive, outside hard disk etc.The form of storage can adopt simple text or numeral, can be also the data of more complicated.In the present embodiment, employing is the structurized list data being formed by database.
Further illustrate particularly: set up demand database, according to retaining word, { information such as attribute field that RequirementTypeDef} extracts demand type, demand type declaration, comprises, deposit in demand type tables of data RequirementType; To every kind of demand type, set up a tables of data, for storing the demand data of the type, this literary name section is except demand title and sign, also comprise every kind of attribute corresponding field in the type requirement definition, according to retaining word, { Requirement} extracts all the type demand informations in document, and writes in demand data table Requirement.According to retaining word, { RequirementRelationDef} extracts demand relation type and related data, deposits in demand relation tables of data RequirementRelationType, and this table comprises and is related to title, is related to the fields such as explanation.According to retaining word, { RequirementRelation} extracts demand relation, and type and demand relation type deposit data in corresponding demand relation tables of data RequirementRelation according to demand.According to retaining word, { RequirementMappingDef} extracts Demand mapping type and related data, deposit in Demand mapping categorical data table RequirementMappingType, this table comprises the fields such as Demand mapping title, sign, source demand type, object demand type.According to retaining word, { RequirementMapping} extracts Demand mapping information, and shines upon according to demand and related needs type information, and Demand mapping data are deposited in Demand mapping tables of data RequirementMapping.
Stage two: transfer any class demand in the requirements specification document of natural language description described in storer, if there is two-way identical logical relation between two demands in described demand type, there is simple requirements conflict, travel through demand types all in described storer, carry out detection and the removal of simple requirements conflict.
In one embodiment of the invention, utilize processor to carry out the processing of simple requirements conflict in storer with the task object of database form storage, described in carry out simple requirements conflict processing be through direct simple requirements conflict analysis and simple requirements conflict analysis indirectly.Specific implementation process is as follows:
Consult shown in Fig. 2, schematic flow sheet for the method simple requirements conflict of a kind of automatic detection demand conflict relationship of the embodiment of the present invention, step 201: transfer the task object in database, choose arbitrarily the demand of a type, be designated as category-A type, create demand data set Table (A), the demand in Table (A) is numbered, be designated as Table (A)={ a i| i=1,2 ..., n a, n wherein anumber for category-A type demand.
Step 202: select arbitrarily a kind of demand relation r from database, traversal demand type A, sets up Table (A, r).
Step 203: judge whether to have demand relation r in demand type A, whether have table Table (A, r) in database.If existed, enter detection and the removal of simple requirements conflict, otherwise get back to step 202.
Step 204: carry out detection and the removal of simple requirements conflict.
In one embodiment of the invention, described simple requirements conflict comprises direct simple requirements conflict and simple requirements conflict indirectly.
Carry out detection and the removal of direct simple requirements conflict: according to Table (A, r), set up n a* n a2-D data chained list D (A, r), if a ito a jexist and be related to r, the element value of the capable j row of the i of D (A, r) is 1 so, otherwise value is 0.Matrix corresponding to note D (A, r) element value is according to D (A, r), set up n a* n a2-D data chained list DD (A, r), the element value of the capable j row of the i of DD (A, r) is dd r(i, j)=d r(i, j) * d r(j, i).If dd r(i, j)=1, so demand a iand a jbetween exist about being related to the direct simple requirements conflict of r.Meanwhile, to existing the demand of direct simple requirements conflict to remove, to all dd r(i, the j) of (i, j)=1 deletes (a from Table (A, r) i, a j) corresponding data recording.
Carry out detection and the removal of indirect simple requirements conflict: data link table D (A, r) element value is designated as to matrix D.Set up two n a* n a2-D data chained list DT (A, r) and DC (A, r).The value of DT (A, r) and DC (A, r) element is designated as respectively matrix F and C.The initial value of F is unit matrix, and the initial value of C is null matrix.Circulation n ainferior calculating F=F * D, C=C+F.According to the value of C, it is data link table DC (A, r) assignment.
Figure GDA0000398071110000051
"
Figure GDA0000398071110000052
" computing is the computing that matrix correspondence position element that ranks number is identical multiplies each other, the transposed matrix of D ' representing matrix D.According to the value of F, it is data link table DT (A, r) assignment.Ergodic data chained list DT (A, r), searches all elements that are greater than 0, and this element place demand corresponding to row and column exists indirect simple requirements conflict.Even the element of the i ' row of DT (A, r) and j ' row is not 0, so demand a i 'and a j 'between exist about being related to the indirect simple requirements conflict of r.Meanwhile, to existing the demand of indirect simple requirements conflict to remove, from tables of data Table (A, r), delete (a i, a j) corresponding data recording.
It should be noted that, in carrying out the detection of simple requirements conflict and removing, detection and the removal of direct simple requirements conflict and simple requirements conflict indirectly can be done simultaneously, detection and the removal of direct simple requirements conflict or simple requirements conflict indirectly can certainly be only done.
Stage three: transfer any two class demands in the storer that has carried out simple requirements conflict relationship, if there is unidirectional logical relationship between two described class demands, common factor between the requirements set of described two class demands is not empty set simultaneously, there is Demand mapping conflict, travel through demand types all in described storer, carry out detection and the removal of Demand mapping conflict.
In one embodiment of the invention, utilize processor the task object with the storage of database form in described storer to be carried out to the processing of Demand mapping conflict, specific implementation process is as follows:
Consult shown in Fig. 3, schematic flow sheet for the method Demand mapping conflict of a kind of automatic detection demand conflict relationship of the embodiment of the present invention, step 301: transfer the task object that has carried out simple requirements conflict in database, choose arbitrarily the demand of two types, be designated as A, B.Ergodic data storehouse, determines that the set of relation between A, B two class demands is designated as R (A) ∩ R (B), from demand type A to B, exists any one Demand mapping to be related to s.
The intersection of sets of step 302:A, two kinds of demand types of B does not integrate and enters step 303 as empty set, otherwise gets back to step 301.
Step 303: when R (A) ∩ R (B) is not empty set, get any one in R (A) ∩ R (B) and be related to r, the demand relation of setting up category-A demand is Table (A, r), the demand relation of setting up category-B demand is Table (B, r), and setting up that A, B two class Demand mappings close is Table (A, B, s).
Step 304: set up conflict relationship matrix: ergodic data table Table (A, B, s), sets up a n a* n b2-D data chained list D (A, B, s).2-D data chained list D (A, B, s) is conflict relationship matrix.If exist about being related to the Demand mapping (a of s i, b j), the element value of the capable j row of the i of D (A, B, s) is 1 so, is designated as f s(i, j)=1; Otherwise value is 0, i.e. f s(i, j)=0.
Step 305: carry out detection and the removal of Demand mapping conflict: due to the more complicated of Demand mapping conflict, taked for the traversal of conflict relationship matrix and the detection of Demand mapping conflict the method for utilizing formula to calculate.
The Demand mapping of selecting any one the data recording representative in Table (A, B, s), is made as
Figure GDA00003980711100000611
Figure GDA0000398071110000064
adopt following formula to calculate
Figure GDA00003980711100000612
corresponding conflict set
Figure GDA0000398071110000066
F i 0 , j 0 = C C [ i 0 , j 0 ] ⊗ CM = ^ ( f i 0 , j 0 ( i ′ , j ′ ) ) n A × n B ,
S i 0 , j 0 CM = { ( a i ′ , b j ′ ) | f i 0 , j 0 ( i ′ , j ′ ) = 1,1 ≤ i ′ ≤ n A , 1 ≤ j ′ ≤ n B } ,
Wherein, the element homography D that represents D (A, r) ai 0row,
Figure GDA0000398071110000069
the element homography D that represents D (B, r) bj 0oK, CM is matrix corresponding to D (A, B, s) value.
, detected Demand mapping conflict is removed meanwhile, from tables of data Table (A, B, s), delete conflict set
Figure GDA00003980711100000610
the data recording that all elements is corresponding.
It is pointed out that for processor carry out to be accelerated, data can also be copied to cache memory from storer, so that processor can quick access, cache memory is avoided the delay of processor in waiting for data handling procedure.Meanwhile, this method can run on a more than processor, also can run on one group or the better processor of a group processing power linking together Network Based.Processor can comprise any general processor and be stored in hardware module or the software module in storer.Meanwhile, the present invention can also will be passed through simple requirements conflict or present finally by the result that Demand mapping conflict is handled excessively respectively by output unit, and preferably, what described output unit adopted is LED display.
From description above, can find out, the method of a kind of automatic detection demand conflict relationship of the present invention, the detection that adopts simple requirements conflict and Demand mapping conflict to conflict to system has creatively been proposed, this method has realized detection and the removal of two kinds of conflicts to system, can greatly improve the efficiency that demand conflict is processed; The present invention has simultaneously realized a process that automatically detects and remove conflict, has overcome the problem that test leakage and mistake are surveyed, and has improved the accuracy detecting; And the environment that method of the present invention is implemented is flexible, no matter is to carry out in this locality or network collision detection.
Those of ordinary skill in the field are to be understood that: the foregoing is only specific embodiments of the invention; be not limited to the present invention; within the spirit and principles in the present invention all, any modification of making, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.

Claims (3)

1. a method that detects demand conflict relationship, it comprises:
Set up demand database and demand relation database; According to the type of conflict, set up conflict relationship matrix; And traveling through described conflict relationship matrix, detection demand is conflicted;
Wherein, according to the type of conflict, set up conflict relationship matrix, and the step that travels through the conflict of described conflict relationship matrix detection demand comprises: if there is two-way identical logical relation between two demands in the demand type of described demand database, have simple requirements conflict; Travel through demand types all in described demand database, carry out the detection of simple requirements conflict; Wherein said simple requirements conflict comprises direct simple requirements conflict and simple requirements conflict indirectly;
Wherein, for detection and the removal of direct simple requirements conflict, concrete step comprises:
1) transfer the task object in database, choose arbitrarily the demand A of a type, create demand data set Table (A), the demand in Table (A) is numbered, be designated as Table (A)={ a i| i=1,2 ..., n a, n wherein anumber for category-A type demand;
2) from database, select arbitrarily a kind of demand relation r, traversal demand type A, sets up Table (A, r); And
3) according to Table (A, r), set up n a* n a2-D data chained list D (A, r), if a ito a jexist and be related to r, the element value of the capable j row of the i of D (A, r) is 1 so, otherwise value is 0; Matrix corresponding to note D (A, r) element value is
Figure FDA0000425308480000011
according to D (A, r), set up n a* n a2-D data chained list DD (A, r), the element value of the capable j row of the i of DD (A, r) is dd r(i, j)=d r(i, j) * d r(j, i), DD (A, r) is described conflict relationship matrix;
Wherein, travel through described conflict relationship matrix, the step of detection demand conflict comprises:
If dd r(i, j)=1, so demand a iand a jbetween exist about being related to the direct simple requirements conflict of r;
Wherein, for the detection of indirect simple requirements conflict and the step of removal, comprise:
1) transfer the task object in database, choose arbitrarily the demand A of a type, create demand data set Table (A), the demand in Table (A) is numbered, be designated as Table (A)={ a i| i=1,2 ..., n a, n wherein anumber for category-A type demand;
2) from database, select arbitrarily a kind of demand relation r, traversal demand type A, sets up Table (A, r);
3) according to Table (A, r), set up n a* n a2-D data chained list D (A, r), if a ito a jexist and be related to r, the element value of the capable j row of the i of D (A, r) is 1 so, otherwise value is 0; Matrix corresponding to note D (A, r) element value is
Figure FDA0000425308480000021
according to D (A, r), set up n a* n a2-D data chained list DD (A, r), the element value of the capable j row of the i of DD (A, r) is dd r(i, j)=d r(i, j) * d r(j, i); And
4) data link table D (A, r) element value is designated as to matrix D, sets up two n a* n a2-D data chained list DT (A, r) and DC (A, r), the value of DT (A, r) and DC (A, r) element is designated as respectively matrix F and C, wherein the initial value of F is unit matrix, the initial value of C is null matrix; Circulation n ainferior calculating F=F * D, C=C+F, is data link table DC (A, r) assignment according to the value of C,
Figure FDA0000425308480000022
, wherein
Figure FDA0000425308480000023
computing is the computing that matrix correspondence position element that ranks number is identical multiplies each other, the transposed matrix of D ' representing matrix D; According to the value of F, be data link table DT (A, r) assignment, DT(A, r) be described conflict relationship matrix;
Wherein, travel through described conflict relationship matrix, the step of detection demand conflict comprises:
Ergodic data chained list DT (A, r), searches all elements that are greater than 0, and this element place demand corresponding to row and column exists indirect simple requirements conflict, and even the element of the i ' row of DT (A, r) and j ' row is not 0, so demand a i 'and a j 'between exist about being related to the indirect simple requirements conflict of r;
Complete after the detection and removal of simple requirements conflict relationship, for any two class demands, if there is unidirectional logical relationship between two described class demands, the common factor between the requirements set of described two class demands is not empty set simultaneously, has Demand mapping conflict; Travel through demand types all in described demand database, carry out the detection of Demand mapping conflict;
Wherein, for Demand mapping conflict, the step of setting up conflict relationship matrix according to the type of conflict comprises:
1) transferred the task object of simple requirements conflict;
2) choose arbitrarily demand A, the B of two types, between described A, B two class demands, the set of relation is designated as R (A) ∩ R (B), from demand type A to B, exists any one Demand mapping to be related to s;
3) get any one in R (A) ∩ R (B) and be related to r, the demand relation of setting up category-A demand is Table (A, r), the demand relation of setting up category-B demand is Table (B, r), and setting up that A, B two class Demand mappings close is Table (A, B, s);
4) ergodic data table Table (A, B, s), sets up a n a* n b2-D data chained list D (A, B, s), if exist about being related to the Demand mapping (a of s i, b j), the element value of the capable j row of the i of D (A, B, s) is 1 so, is designated as f s(i, j)=1; Otherwise value is 0, i.e. f s(i, j)=0;
Wherein, travel through described conflict relationship matrix, the step of detection demand conflict comprises:
The Demand mapping of selecting any one the data recording representative in Table (A, B, s), is made as
Figure FDA0000425308480000031
adopt following formula to calculate
Figure FDA0000425308480000032
corresponding conflict set
Figure FDA0000425308480000033
realize the detection of demand conflict:
Figure FDA0000425308480000034
Figure FDA0000425308480000035
Wherein,
Figure FDA0000425308480000036
the element homography D that represents D (A, r) ai 0row,
Figure FDA0000425308480000037
the element homography D that represents D (B, r) bj 0oK, CM is matrix corresponding to D (A, B, s) value.
2. method according to claim 1, wherein, the described step of setting up demand database and demand relation database comprises:
The requirements specification document of natural language description is converted to the XML document of regularized logic description, data corresponding to described XML document are stored in described demand database and demand relation database.
3. method according to claim 2, further comprises: for the XML document of described regularized logic description, { RequirementTypeDef} information extraction, deposits in demand type tables of data RequirementType type definition reservation word according to demand;
{ Requirement} extracts all the type demand informations in document, and writes in demand data table Requirement to retain according to demand word;
{ RequirementRelationDef} extracts demand relation type and related data to contextual definition reservation word, deposits in demand relation categorical data table RequirementRelationType according to demand;
Relation retains word { RequirementRelation} extracts demand relation, and type and demand relation type deposit data in demand relation tables of data RequirementRelation according to demand according to demand;
{ RequirementMappingDef} extracts Demand mapping type and related data to mapping relations reservation word, deposits in Demand mapping categorical data table RequirementMappingType according to demand; And
{ RequirementMapping} extracts Demand mapping information to mapping reservation word, and shines upon according to demand and related needs type information, and Demand mapping data are deposited in Demand mapping tables of data RequirementMapping according to demand.
CN201210360800.5A 2012-09-25 2012-09-25 Method for detecting demand conflict relation Active CN102902760B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210360800.5A CN102902760B (en) 2012-09-25 2012-09-25 Method for detecting demand conflict relation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210360800.5A CN102902760B (en) 2012-09-25 2012-09-25 Method for detecting demand conflict relation

Publications (2)

Publication Number Publication Date
CN102902760A CN102902760A (en) 2013-01-30
CN102902760B true CN102902760B (en) 2014-01-29

Family

ID=47574992

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210360800.5A Active CN102902760B (en) 2012-09-25 2012-09-25 Method for detecting demand conflict relation

Country Status (1)

Country Link
CN (1) CN102902760B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104111865A (en) * 2014-08-04 2014-10-22 浪潮通用软件有限公司 Method for controlling software function running conflict through database technology
CN113094937B (en) * 2021-06-08 2021-08-24 中国空气动力研究与发展中心计算空气动力研究所 Conflict detection method for wind tunnel group vacuum resources

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7263512B2 (en) * 2002-04-02 2007-08-28 Mcgoveran David O Accessing and updating views and relations in a relational database
CN100592315C (en) * 2008-08-29 2010-02-24 中国科学院软件研究所 XACML policy rule checking method

Also Published As

Publication number Publication date
CN102902760A (en) 2013-01-30

Similar Documents

Publication Publication Date Title
Rheinländer et al. SOFA: An extensible logical optimizer for UDF-heavy data flows
London et al. Implementing specification freedoms
CN103678589B (en) Database kernel query optimization method based on equivalence class
CA2659743A1 (en) Primenet data management system
CN104750681A (en) Method and device for processing mass data
CN104778236A (en) ETL (Extract-Transform-Load) realization method and system based on metadata
EP3387525B1 (en) Learning from input patterns in programing-by-example
CN109783484A (en) The construction method and system of the data service platform of knowledge based map
CN107491476A (en) A kind of data model translation and query analysis method suitable for a variety of big data management systems
CN103902582B (en) A kind of method and apparatus for reducing data warehouse data redundancy
Ip State reduction methods for automatic formal verification
US20110231418A1 (en) Graph transformation
CN102902760B (en) Method for detecting demand conflict relation
CN107943412A (en) A kind of subregion division, the method, apparatus and system for deleting data file in subregion
Kimelfeld Database principles in information extraction
Hao et al. Distilling relations using knowledge bases
US20110078158A1 (en) Automatic Taxonomy Enrichment
US9418137B2 (en) Database without structured query language
Akula A novel approach towards building a generic, portable and contextual nlidb system
CN107766545A (en) Scientific and technological data management method and device
CN107729518A (en) The text searching method and device of a kind of relevant database
Mancas et al. MatBase DFS detecting and classifying E-RD cycles algorithm
Unbehauen et al. SPARQL update queries over R2RML mapped data sources
Delemazure A Knowledge Base of Mathematical Results
Schneider et al. Interactive Relation Extraction in Main Memory Database Systems

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