CN1581163A - Inquiring method of operation system member storehouse - Google Patents
Inquiring method of operation system member storehouse Download PDFInfo
- Publication number
- CN1581163A CN1581163A CN 200410009106 CN200410009106A CN1581163A CN 1581163 A CN1581163 A CN 1581163A CN 200410009106 CN200410009106 CN 200410009106 CN 200410009106 A CN200410009106 A CN 200410009106A CN 1581163 A CN1581163 A CN 1581163A
- Authority
- CN
- China
- Prior art keywords
- component
- relation
- annexation
- operating system
- subgraph
- 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
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides an operation system member library inquiry method. Said method includes the following steps: in the course of adding some member into member data base, according to the descriptive information of member, in said member library adding the information of connection relationship of said member and other member; member library system utilizes the connection relationship information between members, user member as node and uses the connection relationship between members as side to draw out member relationship graph; when the member library is inquired by user, defining the type of member connection relationship, and dividing the member relationship graph into several member relationship subgraphs by member library system, in the subgraph positioning and inputting node of member, inquiring subgraph all over and can find out the target member which has defined relationship with inputted member information.
Description
Technical field
The invention belongs to computer software component base field, be specifically related to a kind of operating system component library inquiry method.
Background technology
Along with the increasing of software repeated usage dynamics, the software component library system more and more is subject to people's attention, and the classification of component base is the key factor that concerns software repeated usage efficient with retrieval.Traditional component base system only provides a kind of descriptor from the similar key word of member to search the search method of member, and this method can inquire member by key word (term) in conjunction with the coupling of key word synonym dictionary.But at present in the operating system component storehouse, all members are at the different specific part of operating system, different component parts as an operating system, relation is tight especially between the member, as in using member assembling software systems process, in order to make system have some new function, when adding a new member, need to judge this member whether with existing system in other members exist and conflict, simultaneously, in the software repeated usage process, a lot of members are independently to work, and it service (being provided by function) must be provided could correctly be re-used.Therefore there is the defective that member is separate, can't directly inquire about associated member by member in the component base system at present.
Invention/utility model content
The present invention has overcome the defective of aforesaid operations component of a system library inquiry method, a kind of operating system component library inquiry method based on relation is provided, can realize directly inquiring member with its certain specific annexation of existence, make all members be linked as integral body by certain member.
Technology contents of the present invention: a kind of operating system component library inquiry method, step comprises:
1, adds in the process of component base at certain member,, in component base, add the information of the annexation of this member and other member according to the descriptor of this member;
2, the component base system is node according to the connection relation information between the member with the member, and the annexation between the member as the limit, is drawn out component relation figure;
3, during user inquiring, the node of location input link in component relation figure, according to the ergodic algorithm of breadth-first, figure travels through to component relation, searches the target member that has certain annexation with input link.
Annexation between the member is divided into following type: dependence, superseded relation, conflict relationship, version relationship, relation of inclusion, realization relation.
When user inquiring, the user specifies the annexation type of member, the component base system is divided into the component relation subgraph according to relationship type with component relation figure, after the component relation subgraph is traveled through, finds the target member that has the appointment annexation with input link.
In the process of traversal member dependence subgraph, calculate the dependence weighted value of each node that traverses and input link, sort according to the big young pathbreaker's target member that relies on weighted value.
The ratio that target member is offered the function sum that function sum that input link uses and input link need import is as weighted value, the weight span be [0,1).
As travel through the component relation subgraph when not being member dependence subgraph, directly carry out breadth first traversal.。
Add in the process of component base at certain member, the automatic resolution component descriptor of component base system, and in component base, add the record of the annexation of this member and other member.
Add in the process of component base at certain member, component library management person initiatively adds the record of the annexation of this member and other member in component base.
Technique effect of the present invention: in component base, directly inquire member with its certain specific annexation of existence by certain member, can improve the multiplexing efficient of software, for can not directly multiplexing member, can directly in component base, find the member that service is provided for known members by querying method provided by the invention, remove the loaded down with trivial details work that own programming realizes the required import feature of known members from.In addition, in relationship type of the present invention, also include conflict relationship, eliminate relation etc., when increasing new function, can know which member can not coexist, help the stability of the system that realizes by conflict relationship; By the relation of eliminating know add new function after, which function of system may lose efficacy.These can both provide useful reference information to the developer.
Description of drawings
Below in conjunction with accompanying drawing, the present invention/utility model is made detailed description.
Fig. 1 is the component relation synoptic diagram;
Fig. 2 is the dependence subgraph of member;
Fig. 3 is the version relationship subgraph of member;
Fig. 4 is the conflict relationship subgraph of member;
Fig. 5 is the out-of-date subgraph that concerns that makes of member.
Embodiment
Member is made or is revised by the field related personnel and obtains, so when making a member, can provide the information of a lot of these members usually, these information are component description information.By descriptor, can determine which member this member can have relation with, and the type of relation.Add in the process of component base at certain member, add member and can also can adopt method for distinguishing with one of two kinds of following methods.
1, component information is used based on the language of XML and is described, when a new member joins in the system, component Library Management System is resolved the new descriptor that adds member automatically according to the XML language format, the information that provides according to descriptor, existing member in component base of system scan, if have member and the member that has just added to have relation, then in component base, add the record of a this relation: source component mark symbol, target member identifier, relationship type, weight (optional).
2, the system manager can manual appointment.If the system manager thinks that this member has certain annexation with existing certain (a bit) member in the component base, then can in component base, add the record of a this relation by hand: source component mark symbol, target member identifier, relationship type, weight (optional).The system manager can also revise the weight of relation.
The operating system component storehouse mainly comprises source code and binary level member, therefore is defined as follows several annexation types:
1, dependence: the source member is if correct operation, some interface that must rely on some other members provides certain (a bit) service to it, and target member comprises one or more members of certain (a bit) service of source member that can be exactly, and weight (weight) can be arranged in this relation.The weight value is calculated by the ratio that target member can offer the function sum that function sum that the source member uses and source member need import, the span of weight be [0,1).Can embody degree of dependence between the member by weight.Such as: source member A need import 10 functions, and in all functions that certain member B is provided, has 5 can allow member A use, and then the weights of dependence are 0.5 between member A and the B.
2, the relation of eliminating: be used for defining the relation that newly-increased member is eliminated existing member, the source member adds in the system, with target member and when being stored in the component base, preferentially selects the source member.
3, conflict relationship: the conflict between the definition member, source member and target member can not be present in the goal systems simultaneously.
4, version relationship: the function that source member and target member are realized is identical, and the difference of minority is embodied in member realization itself, and interface remains unchanged, and can think the different editions of same member.
5, relation of inclusion: have whole-part relations between the member, be presented as that member comprises.Can comprise in specific implementation and quote, also can be to comprise entity itself.
6, realize relation: member has been realized the defined interface of another member (being likely an abstract member), described function.Be present between the member entity of different levels, also be a kind of refining (Refinement) relation more.
May there be multiple relation simultaneously between two members.
Component Library Management System is node according to the connection relation information between the member with the member, and the annexation between the member as the limit, is drawn out component relation figure, and this component relation figure represents the annexation between the member.
Component relation figure be a following figure G=(C, L) C is the set of all members in the component base here, L is the set of existing all relations between the member.Fig. 1 is exactly the example of a component relation figure.
Among the superincumbent component relation figure, exist 6 kinds of limits according to the type that concerns, in fact, we are in retrieval, therefore used just wherein a kind of relation can divide maximum 6 sub-component relation figure to top component relation figure according to 6 kinds of relations.The user is in inquiry, the member of specified relationship type and an inquiry usefulness, component Library Management System are read the record of all this relations by the relationship type of appointment from component base, according to these recorded informations, in internal memory, construct corresponding component relation subgraph with traditional method.In retrieval, can reduce the time of retrieval like this.With reference to figure 2, Fig. 3, Fig. 4, Fig. 5, be several subgraphs of component relation figure shown in Figure 1.
Carrying out member at corresponding component relation subgraph searches, the component node of input when at first in the component relation subgraph, navigating to inquiry, ergodic algorithm according to breadth-first, the component relation subgraph is traveled through, consider multilayer relies on weight to the multiplexing helpful and dependence of user situation, we concern the different component retrieval method of employing on the subgraph on the dependence subgraph with other 5 kinds.
If dependence, in the process of traversal component relation subgraph, calculate the dependence weight of each node and input link according to formula, all nodes that traverse are sorted from big to small according to the dependence weight, and return the result of ordering.For dependence, the degree of dependence is expressed by relying on weight w eight.Clearly, if weights are big more, the dependence between source member and the target member is just strong more, also shows source member and target member in multiplexing, and the possibility that is used simultaneously is big more.The dependence subgraph can be expressed as a weighted graph, just each limit of dependence subgraph can have one [0,1) between value.In the design searching algorithm, can to the width that figure carries out multilayer first traversal be arranged according to the limit, can not only find out with certain member has direct dependence member, also can find out the member (if having such member) that indirect dependence is arranged with this member.These members that rely on indirectly also may play effect to wanting multiplexing member.To these members, also provide a dependence weight relevant with the source member.The computing formula of weight is as follows:
Here, this member, weight are found at that one deck of traversal in the n surface
iIt is the weight of the connection that traverses of i layer.
Such as: between member A and the member B dependence is arranged, and the weight of dependence is 0.6.Between member B and the member C dependence is arranged also, and the weight that dependence is used to is 0.5.Search according to dependence when the user uses member, and the level of retrieval be set to be not less than 2 layers the time after, member C also can appear among the result, by top formula, we can obtain member C's and member A between the dependence weight:
If be non-dependence,, directly do the degree of depth and be 1 layer breadth first traversal for remaining 5 subgraph; Promptly directly locate the node of the member correspondence of appointment, find and its connected node according to its limit then, these nodes are used as the result return.
Claims (8)
1, a kind of operating system component library inquiry method, step comprises:
(1) adds in the process of component base at certain member,, in component base, add the information of the annexation of this member and other member according to the descriptor of this member;
(2) the component base system utilizes the connection relation information between the member, is node with the member, and the annexation between the member as the limit, is drawn out component relation figure;
(3) during user inquiring, the node of location input link in component relation figure, according to the ergodic algorithm of breadth-first, figure travels through to component relation, searches the target member that has annexation with input link.
2, operating system component library inquiry method as claimed in claim 1, it is characterized in that: the annexation type between the member is divided into: dependence, superseded relation, conflict relationship, version relationship, relation of inclusion, realization relation.
3, operating system component library inquiry method as claimed in claim 1 or 2, it is characterized in that: when user inquiring, the user specifies the annexation type of member, the component base system is divided into the component relation subgraph according to relationship type with component relation figure, after the component relation subgraph is traveled through, find the target member that has the appointment annexation with input link.
4, operating system component library inquiry method as claimed in claim 3, it is characterized in that: in the process of traversal member dependence subgraph, calculate the dependence weighted value of each node that traverses and input link, the member that traverses according to the big young pathbreaker who relies on weighted value sorts.
5, operating system component library inquiry method as claimed in claim 3 is characterized in that: when not being member dependence subgraph as traversal component relation subgraph, directly carry out the degree of depth and be 1 layer breadth first traversal.
6, operating system component library inquiry method as claimed in claim 4, it is characterized in that: target member can be offered the ratio of the function sum of input link use and the function sum that input link need import as weighted value, the weight span be [0,1).
7, operating system component library inquiry method as claimed in claim 1, it is characterized in that: add in the process of component base at certain member, the component base system resolves this component description information automatically, and adds the record of the annexation of this member and other member in component base.
8, operating system component library inquiry method as claimed in claim 1 is characterized in that: add in the process of component base at certain member, component library management person initiatively adds the record of the annexation of this member and other member in component base.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200410009106 CN1285048C (en) | 2004-05-20 | 2004-05-20 | Inquiring method of operation system member storehouse |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200410009106 CN1285048C (en) | 2004-05-20 | 2004-05-20 | Inquiring method of operation system member storehouse |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1581163A true CN1581163A (en) | 2005-02-16 |
| CN1285048C CN1285048C (en) | 2006-11-15 |
Family
ID=34581619
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200410009106 Expired - Fee Related CN1285048C (en) | 2004-05-20 | 2004-05-20 | Inquiring method of operation system member storehouse |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1285048C (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1333336C (en) * | 2006-06-23 | 2007-08-22 | 清华大学 | Method for unified management of component library supporting heterogeneous component |
| CN101075914B (en) * | 2007-04-29 | 2011-05-11 | 中兴通讯股份有限公司 | RACF system and equipment with dynamic discovery function in NGN |
| CN102314638A (en) * | 2010-06-30 | 2012-01-11 | 国际商业机器公司 | Be used for the historical method and system of managerial meeting |
| CN101710279B (en) * | 2009-12-01 | 2013-07-31 | 中国建设银行股份有限公司 | Method and device for managing software module in IT system |
| US8687941B2 (en) | 2010-10-29 | 2014-04-01 | International Business Machines Corporation | Automatic static video summarization |
| US8914452B2 (en) | 2012-05-31 | 2014-12-16 | International Business Machines Corporation | Automatically generating a personalized digest of meetings |
| CN104572125A (en) * | 2015-01-28 | 2015-04-29 | 中国农业银行股份有限公司 | Methods and devices for drawing and storing entity relation diagrams |
| CN111158676A (en) * | 2019-12-31 | 2020-05-15 | 山东蚁动网络科技有限公司 | Component relevance analysis method, equipment and medium based on variable propagation technology |
| CN111611419A (en) * | 2019-02-26 | 2020-09-01 | 阿里巴巴集团控股有限公司 | Sub-graph identification method and device |
-
2004
- 2004-05-20 CN CN 200410009106 patent/CN1285048C/en not_active Expired - Fee Related
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1333336C (en) * | 2006-06-23 | 2007-08-22 | 清华大学 | Method for unified management of component library supporting heterogeneous component |
| CN101075914B (en) * | 2007-04-29 | 2011-05-11 | 中兴通讯股份有限公司 | RACF system and equipment with dynamic discovery function in NGN |
| CN101710279B (en) * | 2009-12-01 | 2013-07-31 | 中国建设银行股份有限公司 | Method and device for managing software module in IT system |
| US9342625B2 (en) | 2010-06-30 | 2016-05-17 | International Business Machines Corporation | Management of a history of a meeting |
| US8786597B2 (en) | 2010-06-30 | 2014-07-22 | International Business Machines Corporation | Management of a history of a meeting |
| US8988427B2 (en) | 2010-06-30 | 2015-03-24 | International Business Machines Corporation | Management of a history of a meeting |
| CN102314638A (en) * | 2010-06-30 | 2012-01-11 | 国际商业机器公司 | Be used for the historical method and system of managerial meeting |
| US8687941B2 (en) | 2010-10-29 | 2014-04-01 | International Business Machines Corporation | Automatic static video summarization |
| US8914452B2 (en) | 2012-05-31 | 2014-12-16 | International Business Machines Corporation | Automatically generating a personalized digest of meetings |
| CN104572125A (en) * | 2015-01-28 | 2015-04-29 | 中国农业银行股份有限公司 | Methods and devices for drawing and storing entity relation diagrams |
| CN104572125B (en) * | 2015-01-28 | 2018-10-16 | 中国农业银行股份有限公司 | Method for drafting, storage method, drawing apparatus and the storage device of entity relationship diagram |
| CN111611419A (en) * | 2019-02-26 | 2020-09-01 | 阿里巴巴集团控股有限公司 | Sub-graph identification method and device |
| CN111611419B (en) * | 2019-02-26 | 2023-06-20 | 阿里巴巴集团控股有限公司 | Sub-graph identification method and device |
| CN111158676A (en) * | 2019-12-31 | 2020-05-15 | 山东蚁动网络科技有限公司 | Component relevance analysis method, equipment and medium based on variable propagation technology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1285048C (en) | 2006-11-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Fernandez et al. | Optimizing regular path expressions using graph schemas | |
| US5544355A (en) | Method and apparatus for query optimization in a relational database system having foreign functions | |
| Anyanwu et al. | ρ-queries: enabling querying for semantic associations on the semantic web | |
| US7693820B2 (en) | Use of materialized transient views in query optimization | |
| Anyanwu et al. | Sparq2l: towards support for subgraph extraction queries in rdf databases | |
| US7769769B2 (en) | Methods and transformations for transforming metadata model | |
| US7716167B2 (en) | System and method for automatically building an OLAP model in a relational database | |
| US7650357B2 (en) | Translation of object queries involving inheritence | |
| US7162469B2 (en) | Querying an object for properties | |
| US7136873B2 (en) | Dynamic filtering in a database system | |
| EP1387297A2 (en) | Translation of object property joins to relational database joins | |
| US20040019599A1 (en) | Result set formatting and processing | |
| US20110055199A1 (en) | Join order optimization in a query optimizer for queries with outer and/or semi joins | |
| EP1081610A2 (en) | Methods for transforming metadata models | |
| CN1285048C (en) | Inquiring method of operation system member storehouse | |
| Bruno | Automated Physical Database Design and Tuning | |
| CN101458692A (en) | Strategic material industry knowledge base platform and construct method thereof | |
| CN115544088A (en) | Address information query method and device, electronic equipment and storage medium | |
| Medina et al. | Evaluation of indexing strategies for possibilistic queries based on indexing techniques available in traditional RDBMS | |
| CN115391424A (en) | Database query processing method, storage medium and computer equipment | |
| May et al. | Index vs. navigation in XPath evaluation | |
| Liu et al. | A schemaguide for accelerating the view adaptation process | |
| CN110659350B (en) | Semantic search system and search method based on domain ontology | |
| CN106980695B (en) | Component retrieval method in power field and storage method thereof | |
| CA2318302C (en) | Methods and transformations for transforming metadata model |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20061115 Termination date: 20130520 |