CN105243081B - A kind of file system directory structures method for organizing based on formal notion - Google Patents

A kind of file system directory structures method for organizing based on formal notion Download PDF

Info

Publication number
CN105243081B
CN105243081B CN201510562426.0A CN201510562426A CN105243081B CN 105243081 B CN105243081 B CN 105243081B CN 201510562426 A CN201510562426 A CN 201510562426A CN 105243081 B CN105243081 B CN 105243081B
Authority
CN
China
Prior art keywords
concept
file
lattice
father
label
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.)
Expired - Fee Related
Application number
CN201510562426.0A
Other languages
Chinese (zh)
Other versions
CN105243081A (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.)
Henan University
Original Assignee
Henan University
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 Henan University filed Critical Henan University
Priority to CN201510562426.0A priority Critical patent/CN105243081B/en
Publication of CN105243081A publication Critical patent/CN105243081A/en
Application granted granted Critical
Publication of CN105243081B publication Critical patent/CN105243081B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/13—File access structures, e.g. distributed indices

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a kind of file system directory structures method for organizing based on formal notion, including following steps：A：It transform traditional file systemses tree directory structure as lattice structure based on concept；B：File operation is mapped as the operation of concept lattice, the dynamic change of bibliographic structure is realized；C：Realize passing through access of the mulitpath to a certain file, it is to avoid the multistage backtracking under system tree directory structure mode；The present invention transform the lattice structure based on concept as by by traditional file systemses tree directory structure, then file operation is mapped as the operation of concept lattice, realize the dynamic change of bibliographic structure, and then realize passing through access of the mulitpath to a certain file, it is to avoid the multistage backtracking under system tree directory structure mode.The present invention combine traditional file systemses catalogue and form concept analysis technology well, it is possible to achieve the dynamic change of file system directory structures and to file in itself by mulitpath inquire about.

Description

A kind of file system directory structures method for organizing based on formal notion
Technical field
The present invention relates to power distribution cabinet installation instrument research and development technology field, more particularly to a kind of file based on formal notion System directory structures method for organizing.
Background technology
The change of bibliographic structure experienced single level directory structure, second-level directory structure, tree directory structure, acyclic graph mesh Directory structures.Tree directory structure is the single level directory structure and second-level directory structure for improving, and it uses scope most at present Extensively.Directory tree results from UNIX operating system just as an inverted tree, widely used by modern operating system. In tree type contents structure, from root to any data file, only one unique path.The file of lower floor is more arrived, Access efficiency is lower, when catalogue scale increase to a certain extent when, the efficiency of file system can be had a strong impact on.For this Problem, at present correlative study both at home and abroad is mainly concentrated in by transforming directory index structure, so as to improve directory tree Recall precision.Erez etc. propose it is a kind of in virtual file system pellucidly by some big contents segmentations into the side of multiple small catalogues Method, to solve the problems, such as order bibliographic structure when large-scale catalogue is processed.Phillips proposed one kind similar to B+ in 2001 The H trees of tree, for solving the bottleneck when big catalogue is processed.Wu Weimin etc. enters to the specific directory index B+ tree constructions on disk Go analysis, proposed the concept of the big catalogue of three-level, and summarize the dynamic change of bibliographic structure under file operation on this basis Rule.Chen Huajun etc. according to bibliographic structure be typically from root to leaf hierarchical access the characteristics of, propose a kind of to be based on relation data The nodal hierarchy storage method in storehouse, the method improves node by the hash values and child node collection of memory node absolute path Search and Multi-layer technology speed.
The natural extending of tree directory structure is exactly acyclic graph bibliographic structure, and its one file of permission or catalogue can be more Individual parent directory occupies project, but does not constitute loop, and in MULTLCS and unix system, this frame mode is called link (link).It is to be realized by two kinds of on-link mode (OLM)s to file-sharing：One kind is to allow directory entry to be linked to any expression file On the node of catalogue, another kind is only to allow directory entry to be linked on the leaf node for representing ordinary file.First way is represented The all files that linked catalogue and subdirectory are included can be shared.All users that share these files can set up certainly Oneself subdirectory, and link share directory.Advantage of this is that be easy to share, but problem is to limit very little, to control and Maintenance causes difficulty, in addition because improper use and caused by loop link, produce directory management chaotic.UNIX substantially takes second On-link mode (OLM) is planted, i.e., only allows to link ordinary file.So as to the file of identical file, i.e., can be accessed by several paths Can have several " alias ".Although this mode limits shared scope, but more reliable, and is easily managed.With reference to acyclic graph Bibliographic structure, and the research to form concept analysis and concept lattice correlation theory, propose to replace traditional tree-like with lattice structure Bibliographic structure.
Since the eighties in 20th century Darmstadt, Germany University of Science and Technology Wille with form concept analysis (Formal Concept Analysis, FCA) after reconstruct case theory (Lattice Theory), form concept analysis are related to concept lattice It is theoretical to start little by little by the extensive of international academic community as the important method and means of data analysis research field with technology Concern.The nineties in 20th century, Ganter and Wille exist《Applied LatticeTheory: FormalConceptAnalysis》Clearly proposed in one text:In application aspect, it is such that FCA is not as other data analysing methods Given information is greatly reduced, few " great parameter " can only be obtained；Conversely, the concept lattice for being built by Formal Context will not It is artificial to reduce complexity, and contain all of data details.Form concept analysis theory in ontology research, soft project, know Knowing the fields such as discovery, Web semantic retrievals has the application of correlation, and these applications are by by form concept analysis and concept case theory Advantage and form concept analysis and concept lattice in terms of generalities knowledge is presented with treatment positioned in Formal Context concept, The advantage of the relationship of the concepts is disclosed, has new breakthrough to ability domain knowledge on concept.And by form concept analysis and concept Case theory is applied in file system directory structures, is also based on two big advantages of form concept analysis and concept case theory. The background knowledge to FCA is described below below：
It is a triple K=(G, M, I) to define 1 Formal Context, and wherein G is object set, and M is attribute set, and I is x Binary crelation between ∈ G and M.For object x ∈ G, attribute m ∈ a M, then xIm means that object x has attribute m.
Object set of the definition 2 in Formal ContextAnd property setBetween be defined as follows two mappings, make
If a two tuple C=(A, B) meet A=g (B) and B=f (A), then two tuples (A, B) are referred to as a shape Formula concept (abbreviation concept).Wherein A is referred to as the extension of concept C, and B is the intension of referred to as concept C.
If defining 3 (A1,B1)、(A2,B2) be certain Formal Context K=(G, M, I) two concepts, andThen Claim (A1,B1) it is (A2,B2) sub- concept, (A2,B2) it is (A1,B1) father's concept, and be denoted as (A1,B1)≤(A2,B2), relation≤ It is known as " sequence level " (referred to as " sequence ") of concept.All concepts of (G, M, I) are collectively referred to as concept lattice with the collection that this sequence is constituted, It is denoted as L (G, M, I).
And the definition of tree directory structure is：DOS sets up a mesh on each disk in disk initialization, automatically Record, this catalogue is exactly the root of the disk.Under the root directory, can be with storage system or the file of user, it is also possible to build again Found some catalogues.The catalogue set up under root is referred to as the subdirectory of root.Under each subdirectory, equally can both deposit File, it is also possible to the subdirectory of md, as the subprime directory of subdirectory.The so structure of catalogue, actually one Individual hierarchical structure, hierarchical structure is commonly known as tree structure in computer science.I.e. disk directory structure can regard one as Individual tree structure.Each tree has a root node, the i.e. root of disk；There is the file on many leafy nodes, i.e. disk, because There is no subordinate's node again for file.Node between leaf and tree root is all the subdirectory of different stage.
Lattice with tree common ground be：In content, both it is made up of node and relation；In structure, both belong to level Structure.Both differences are：In lattice in addition to root node and tip node, remaining node can have the father node of multiple, And set in addition to root node, remaining node all only one of which father nodes, and tree does not have tip node.Therefore existing lattice With the irrealizable a plurality of searching route of identical file of tree and bibliographic structure dynamic change, it may appear that multistage backtracking, influence Efficiency.
The content of the invention
It is an object of the invention to provide a kind of file system directory structures method for organizing based on formal notion, disclosure satisfy that While traditional file systemses user's use habit, the irrealizable a plurality of retrieval road of identical file of directory tree institute can be realized The characteristics of footpath and bibliographic structure dynamic change.
The technical solution adopted by the present invention is：
A kind of file system directory structures method for organizing based on formal notion, including following steps：
A：It transform traditional file systemses tree directory structure as lattice structure based on concept；Will in described step A Traditional file systemses tree directory structure transform the lattice structure based on concept as includes following several steps：
A1：The concept of file in abandoning tradition tree directory structure, operation of labelling is carried out to file；
A2：Using filename as object, using label as attribute, and Formal Context K is created；
A3：Using the technique construction file system concept lattice of form concept analysis, the formalization of file system is realized；
A4：The structure of file and its label is analyzed and presented based on file system concept lattice, between announcement label Hierarchical relationship and incidence relation.
B：File operation is mapped as the operation of concept lattice, the dynamic change of bibliographic structure is realized；Described file operation Operation including add file or label, deletes the operation of file or label, and the attribute of existing file or label is entered Row modification；The method that the dynamic change of bibliographic structure is realized in described step B, using following steps：
B1：File operation is operated to concept lattice and is mapped, add file correspondence adds object a and its correspondence in concept lattice Attribute set f (a), wherein f to obtain attribute set operation, i.e., to sequence is added in concept lattice even (a, f (a)), real concept The incremental construction of lattice；The corresponding operation of file is deleted to be mapped as deleting a method of object a, real concept lattice in concept lattice Dynamic renewal；
B2：Addition tag operational correspondence adds attribute b and its corresponding object set g (b), g therein in concept lattice Be that object set operation is obtained according to attribute, i.e., to added in concept lattice sequence it is even (g (b), b), the gradual structure of real concept lattice Make；The corresponding operation of label is deleted to be mapped as deleting a method of attribute b, the dynamic renewal of real concept lattice in concept lattice；
B3：More new file-label relational operation correspondence is added in concept lattice or deletes object-relation on attributes, i.e., first The selected attribute b that object a possesses is searched in concept lattice, is then realized to form related to object a and attribute b in concept lattice Concept is updated.
C：Realize passing through access of the mulitpath to a certain file, it is to avoid the multistage under system tree directory structure mode is returned Trace back；The method that a certain file can be inquired about by mulitpath is realized in the step C, using following steps：
C1：File system concept lattice is obtained according to file-label relation；
C2：To be layered by intension set sizes in file system concept lattice；
Then, by the property set B of each node in every layer and its parent attribute collection BFDifference set Bx is sought, and by difference set Property element as current layer Lx on tree-likeization path node,
Meanwhile, the object set AC of the object set A of each node in every layer and its child node is sought into difference set Ax, and by difference set Each object in Ax as Lx leaf node.
File system directory structures method for organizing based on formal notion according to claim 1, it is characterised in that： Add file operation is mapped as adding the method that object (a, f (a)) is operated in concept lattice in the step B1, using following step Suddenly：
B11：As add file g during user is to file system, a series of labels f (g) are selected in existing label as g Attribute；
B12：According to all concepts in intension gesture ascending order access concept lattice：Assuming that current accessed is to S (A, B), S is judged to treat More new ideas still produce sub- concept, if S is concept to be updated, S are updated to (A ∪ { g }, B)；If S is to produce sub- concept, Then product concept N (A ∪ { g }, B ∩ f (g)), while search direct father's concept F of N, then sets up the set membership of F and N, N and The set membership of S.
Tag operational is added in the step B2 to be mapped as adding attribute (g (b), the b) method of operation, use in concept lattice Following steps：
B21：When label m is added during user is to file system, a series of files g (m) that selection is associated are used as m's Object；
B22：According to all concepts in intension gesture ascending order access concept lattice, it is assumed that current accessed to S (A, B), S is judged to treat More new ideas still produce sub- concept：If S is concept to be updated, S is updated to (A, B ∪ { m })；If S is to produce sub- concept, Then product concept N (A ∩ g (m), B ∪ { m }), while search the direct sub- concept C of N, then set up the set membership of N and C, S with The set membership of N.
File operation is deleted in the step B1 to be mapped as deleting the method that object (a, f (a)) is operated in concept lattice, is used Following steps：
B01：To concept S (A, B) of each object set comprising a, S is updated to N (A- { a }, B-f (a))；
B02：Judge A-a whether beOr be the S object set of sub- concept；
B03：If meeting above-mentioned condition, the concept N (A- { a }, B-f (a)) after updating is redundancy concept, and continues to sentence Disconnected father and son concept F and C with the presence or absence of S, meets S for its key；
B04：If meeting S for key, N and its dependence edge are deleted, set up the set membership of F and C；If S is not It is key, then only deletes N and its dependence edge.
Deleted in the step B2 tag operational be mapped as deleting in concept lattice attribute (g (b), the b) method of operation, Using following steps：
B91：To concept S (A, B) of each attribute set comprising b, S is updated to N (A-g (b), B-b)；
B92：Judge B-b whether beOr the property set of S certain father's concept；
B93：If meeting above-mentioned condition, the concept N (A-g (b), B-b) after updating is redundancy concept, judges whether to deposit In father and son the concept F and C of S, S is met for its key；
B94：If meeting S for key, N and its dependence edge are deleted, set up the set membership of F and C；If S is not It is key, then only deletes N and its dependence edge.
On the basis of the algorithm of the step B1 and B3, a kind of method for finding direct father's concept is proposed, using following steps：
J1：Assuming that newly-generated concept is N, all father's concept F (A for accessing current concepts S (A, B) are obtainedF,BF), if Do not existWherein f (g) is the intension set of N, then set up the set membership of F and N, N and S, and by the mark of F Position 1；
J2：The attribute number count of S (A, B) is obtained, concept L of all properties number from count-1 to 0 is successively accessed (AL,BL), judge whether to meet
J3：If metThe all sub- concept flag bit of L is then accessed, if being 1 in the absence of flag bit Sub- concept, then set up the set membership of L and N, N and S, by L mark positions 1.If there is the sub- concept that flag bit is 1, only L is marked Will position 1, other operations are not done.
On the basis of the algorithm of the step B1 and B3, the method for finding directly sub- concept, using following steps：
Assuming that newly-generated concept is N, all sub- concept C (A for accessing current concepts S (A, B) and S are obtainedC,BC), if Do not existWherein g (m) is the extensional set of N, then set up the set membership of N and C, S and N, and by the mark of C Position 1.
The object number count of S (A, B) is obtained, concept L (A of all object numbers from count-1 to 0 is successively accessedL, BL), judge whether to meet
If metThen access all father's concept flag bits of L.If general in the absence of the father that flag bit is 1 Read, then set up the set membership of N and L, S and N, while by L mark positions 1.If there is father's concept that flag bit is 1, only by L Mark position 1, other operations are not done.
Judge in the step B concept whether be key method, using following steps：
BB1：Current concepts S (A, B) are accessed, if his father's concept set is combined into empty or sub- concept set and is combined into sky, it is judged It is not key, continues to access next concept；
BB1：If father's concept set of S (A, B) is not sky with sub- concept set, then：(1) obtain current concepts S (A, B father concept F (A)F,BF)；(2) the sub- concept C (A of current concepts S (A, B) are accessed one by oneC,BC), obtain current sub- concept C (AC,BC) father concept set Fc, make F'(AF',BF') it is the node set of removal S (A, B) in Fc；If F'(AF',BF') in deposit In nodes X, condition is met：Nodes X is the child node of node Y, and wherein Y is F (AF,BF) any node；If nodes X is present, S (A, B) is not key；Otherwise S (A, B) is key.
The operation of add file-label relation is mapped as adding object-relation on attributes behaviour in concept lattice in the step B3 The method of work, comprises the following steps that：
B301：Obtain file-label relation sequence to be added occasionally (a, b), the concept in notion of traversal lattice finds all full Sufficient a ∈ A1, b ∈ B2Father and son's concept to [(A1,B1),(A2,B2)]；
B302：By to each father and son's concept to [(A1,B1),(A2,B2)] product concept N (A2∪{a},B1∪{b})；Its In
If A1=A2∪ { a }, and B2=B1∪ { b }, then replace [(A with N1,B1),(A2,B2)]；
If A1=A2∪ { a }, and B2≠B1∪ { b }, then replace (A with N1,B1)；
If A1≠A2∪ { a }, and B2=B1∪ { b }, then replace (A with N2,B2)；
If A1≠A2∪ { a }, and B2≠B1∪ { b }, then set up (A1,B1) with the set membership of N, N and (A2,B2) father Subrelation, deletes (A1,B1) and (A2,B2) set membership.
The operation that file-label relation is deleted in the step B3 is mapped as deleting object-relation on attributes behaviour in concept lattice The method of work, comprises the following steps that：
B311：Obtain file-label relation (a, b) to be deleted, notion of traversal finds and all meets a ∈ A, b ∈ B's Concept S (A, B)；
B312：To each S (A, B), by (a, b) and S (A, B) product concepts to [(A, B- { b }), (A- { a }, B)], together When obtain S (A, B) all father's concept F and sub- concept C；Wherein：
Property set if there is F is B- { b }, and there is the object set of C is A- { a }, then delete the concept pair of generation [(A, B- { b }), (A- { a }, B)], sets up the set membership of F and C, deletes S and its dependence edge；
If there is F property set be B- { b }, and in the absence of C object set be A- { a }, then delete (A, B- { b }), build Vertical F and the set membership of (A- { a }, B), set up the set membership of (A- { a }, B) and C, delete S and its dependence edge；
It is B- { b } if there is no the property set of F, and there is the object set of C for A- { a }, then delete (A- { a }, B), builds Vertical F and the set membership of (A, B- { b }), set up the set membership of (A, B- { b }) and C, delete S and its dependence edge；
It is B- { b } if there is no the property set of F, and is A- { a } in the absence of the object set of C, then sets up F and (A, B- { b }) set membership, set up the set membership of (A, B- { b }) and (A- { a }, B), set up the set membership of (A- { a }, B) and C, Delete S and its dependence edge.
The present invention transform the lattice structure based on concept as by by traditional file systemses tree directory structure, then by text Part operation is mapped as the operation of concept lattice, realizes the dynamic change of bibliographic structure, and then realize by mulitpath to a certain text The access of part, it is to avoid the multistage backtracking under system tree directory structure mode.The present invention combines traditional file systemses well Catalogue and form concept analysis technology, it is possible to achieve the dynamic change of file system directory structures and to file in itself by many Paths are inquired about.
Brief description of the drawings
Fig. 1 is flow chart of the invention.
Specific embodiment
As shown in figure 1, the present invention is a kind of file system directory structures method for organizing based on formal notion, including it is following Several steps：
A：It transform traditional file systemses tree directory structure as lattice structure based on concept；Will in described step A Traditional file systemses tree directory structure transform the lattice structure based on concept as includes following several steps：
A1：The concept of file in abandoning tradition tree directory structure, operation of labelling is carried out to file；
A2：Using filename as object, using label as attribute, and Formal Context K is created；
A3：Using the technique construction file system concept lattice of form concept analysis, the formalization of file system is realized；
A4：The structure of file and its label is analyzed and presented based on file system concept lattice, between announcement label Hierarchical relationship and incidence relation.
B：File operation is mapped as the operation of concept lattice, the dynamic change of bibliographic structure is realized；Described file operation Operation including add file or label, deletes the operation of file or label, and the attribute of existing file or label is entered Row modification；The method that the dynamic change of bibliographic structure is realized in described step B, using following steps：
B1：File operation is operated to concept lattice and is mapped, add file correspondence adds object a and its correspondence in concept lattice Attribute set f (a), wherein f to obtain attribute set operation, i.e., to sequence is added in concept lattice even (a, f (a)), real concept The incremental construction of lattice；The corresponding operation of file is deleted to be mapped as deleting a method of object a, real concept lattice in concept lattice Dynamic renewal；Add file operation is mapped as adding the method that object (a, f (a)) is operated in concept lattice in the step B1, Using following steps：
B11：As add file g during user is to file system, a series of labels f (g) are selected in existing label as g Attribute；
B12：According to all concepts in intension gesture ascending order access concept lattice：Assuming that current accessed is to S (A, B), S is judged to treat More new ideas still produce sub- concept, if S is concept to be updated, S are updated to (A ∪ { g }, B)；If S is to produce sub- concept, Then product concept N (A ∪ { g }, B ∩ f (g)), while search direct father's concept F of N, then sets up the set membership of F and N, N and The set membership of S.
File operation is deleted in the step B1 to be mapped as deleting the method that object (a, f (a)) is operated in concept lattice, is used Following steps：
B01：To concept S (A, B) of each object set comprising a, S is updated to N (A- { a }, B-f (a))；
B02：Judge A-a whether beOr be the S object set of sub- concept；
B03：If meeting above-mentioned condition, the concept N (A- { a }, B-f (a)) after updating is redundancy concept, and continues to sentence Disconnected father and son concept F and C with the presence or absence of S, meets S for its key；
B04：If meeting S for key, N and its dependence edge are deleted, set up the set membership of F and C；If S is not It is key, then only deletes N and its dependence edge.
B2：Addition tag operational correspondence adds attribute b and its corresponding object set g (b), g therein in concept lattice Be that object set operation is obtained according to attribute, i.e., to added in concept lattice sequence it is even (g (b), b), the gradual structure of real concept lattice Make；The corresponding operation of label is deleted to be mapped as deleting a method of attribute b, the dynamic renewal of real concept lattice in concept lattice；
Tag operational is added in the step B2 to be mapped as adding attribute (g (b), the b) method of operation, use in concept lattice Following steps：
B21：When label m is added during user is to file system, a series of files g (m) that selection is associated are used as m's Object；
B22：According to all concepts in intension gesture ascending order access concept lattice, it is assumed that current accessed to S (A, B), S is judged to treat More new ideas still produce sub- concept：If S is concept to be updated, S is updated to (A, B ∪ { m })；If S is to produce sub- concept, Then product concept N (A ∩ g (m), B ∪ { m }), while search the direct sub- concept C of N, then set up the set membership of N and C, S with The set membership of N.
Deleted in the step B2 tag operational be mapped as deleting in concept lattice attribute (g (b), the b) method of operation, Using following steps：
B91：To concept S (A, B) of each attribute set comprising b, S is updated to N (A-g (b), B-b)；
B92：Judge B-b whether beOr the property set of S certain father's concept；
B93：If meeting above-mentioned condition, the concept N (A-g (b), B-b) after updating is redundancy concept, judges whether to deposit In father and son the concept F and C of S, S is met for its key；
B94：If meeting S for key, N and its dependence edge are deleted, set up the set membership of F and C；If S is not It is key, then only deletes N and its dependence edge.
B3：More new file-label relational operation correspondence is added in concept lattice or deletes object-relation on attributes, i.e., first The selected attribute b that object a possesses is searched in concept lattice, is then realized to form related to object a and attribute b in concept lattice Concept is updated.
The operation of add file-label relation is mapped as adding object-relation on attributes behaviour in concept lattice in the step B3 The method of work, comprises the following steps that：
B301：Obtain file-label relation sequence to be added occasionally (a, b), the concept in notion of traversal lattice finds all full Sufficient a ∈ A1, b ∈ B2Father and son's concept to [(A1,B1),(A2,B2)]；
B302：By to each father and son's concept to [(A1,B1),(A2,B2)] product concept N (A2∪{a},B1∪{b})；Its In
If A1=A2∪ { a }, and B2=B1∪ { b }, then replace [(A with N1,B1),(A2,B2)]；
If A1=A2∪ { a }, and B2≠B1∪ { b }, then replace (A with N1,B1)；
If A1≠A2∪ { a }, and B2=B1∪ { b }, then replace (A with N2,B2)；
If A1≠A2∪ { a }, and B2≠B1∪ { b }, then set up (A1,B1) with the set membership of N, N and (A2,B2) father Subrelation, deletes (A1,B1) and (A2,B2) set membership.
The operation that file-label relation is deleted in the step B3 is mapped as deleting object-relation on attributes behaviour in concept lattice The method of work, comprises the following steps that：
B311：Obtain file-label relation (a, b) to be deleted, notion of traversal finds and all meets a ∈ A, b ∈ B's Concept S (A, B)；
B312：For each S (A, B), by (a, b) and S (A, B) product concepts to [(A, B- { b }), (A- { a }, B)], Obtain all father's concept F and sub- concept C of S (A, B)；Wherein：
Property set if there is F is B- { b }, and there is the object set of C is A- { a }, then delete the concept pair of generation [(A, B- { b }), (A- { a }, B)], sets up the set membership of F and C, deletes S and its dependence edge；
If there is F property set be B- { b }, and in the absence of C object set be A- { a }, then delete (A, B- { b }), build Vertical F and the set membership of (A- { a }, B), set up the set membership of (A- { a }, B) and C, delete S and its dependence edge；
It is B- { b } if there is no the property set of F, and there is the object set of C for A- { a }, then delete (A- { a }, B), builds Vertical F and the set membership of (A, B- { b }), set up the set membership of (A, B- { b }) and C, delete S and its dependence edge；
It is B- { b } if there is no the property set of F, and is A- { a } in the absence of the object set of C, then sets up F and (A, B- { b }) set membership, set up the set membership of (A, B- { b }) and (A- { a }, B), set up the set membership of (A- { a }, B) and C, Delete S and its dependence edge.
Judge in the step B concept whether be key method, using following steps：
BB1：Current concepts S (A, B) are accessed, if his father's concept set is combined into empty or sub- concept set and is combined into sky, it is judged It is not key, continues to access next concept；
BB1：If father's concept set of S (A, B) is not sky with sub- concept set, then：(1) obtain current concepts S (A, B father concept F (A)F,BF)；(2) the sub- concept C (A of current concepts S (A, B) are accessed one by oneC,BC), obtain current sub- concept C (AC,BC) father concept set Fc, make F'(AF',BF') it is the node set of removal S (A, B) in Fc；If F'(AF',BF') in deposit In nodes X, condition is met：Nodes X is the child node of node Y, and wherein Y is F (AF,BF) any node；If nodes X is present, S (A, B) is not key；Otherwise S (A, B) is key.
C：Realize passing through access of the mulitpath to a certain file, it is to avoid the multistage under system tree directory structure mode is returned Trace back；The method that a certain file can be inquired about by mulitpath is realized in the step C, using following steps：
C1：File system concept lattice is obtained according to file-label relation；
C2：To be layered by intension set sizes in file system concept lattice；
Then, by the property set B of each node in every layer and its parent attribute collection BFDifference set Bx is sought, and by difference set Property element as current layer Lx on tree-likeization path node,
Meanwhile, the object set AC of the object set A of each node in every layer and its child node is sought into difference set Ax, and by difference set Each object in Ax as Lx leaf node.
On the basis of the algorithm of the step B1 and B3, a kind of method for finding direct father's concept is proposed, using following steps：
J1：Assuming that newly-generated concept is N, all father's concept F (A for accessing current concepts S (A, B) are obtainedF,BF), if Do not existWherein f (g) is the intension set of N, then set up the set membership of F and N, N and S, and by the mark of F Position 1；
J2：The attribute number count of S (A, B) is obtained, concept L of all properties number from count-1 to 0 is successively accessed (AL,BL), judge whether to meet
J3：If metThe all sub- concept flag bit of L is then accessed, if being 1 in the absence of flag bit Sub- concept, then set up the set membership of L and N, N and S, by L mark positions 1.If there is the sub- concept that flag bit is 1, only L is marked Will position 1, other operations are not done.
On the basis of the algorithm of the step B2 and B3, the method for finding directly sub- concept, using following steps：
Assuming that newly-generated concept is N, all sub- concept C (A for accessing current concepts S (A, B) and S are obtainedC,BC), if Do not existWherein g (m) is the extensional set of N, then set up the set membership of N and C, S and N, and by the mark of C Position 1.
The object number count of S (A, B) is obtained, concept L (A of all object numbers from count-1 to 0 is successively accessedL, BL), judge whether to meet
If metThen access all father's concept flag bits of L.If general in the absence of the father that flag bit is 1 Read, then set up the set membership of N and L, S and N, while by L mark positions 1.If there is father's concept that flag bit is 1, only by L Mark position 1, other operations are not done.
Specifically, the following example to be programmed in specific implementation process is described in detail：During normal operating：
The scheme of newly-built user file object
1st, the concept lattice that initialization files object and file attribute are constituted
When an object and its corresponding property set is inserted, file attribute can not be sky.And be by file object and category Property composition concept set flag bit, initial value is 0.
2nd, each concept is accessed according to intension ascending order
Assuming that the file object for being currently needed for insertion is g, the property set corresponding to it is f (g), is denoted as (g, f (g)).Root Concept in concept lattice is accessed successively according to the principle of intension (property set i.e. corresponding to object).Assuming that the current concept for traversing It is S=(A, B) to be inserted into object for (g, f (g)).It can be seen from incremental construction algorithm：
If meeting B ∩ f (g)=B, S is known as concept to be updated, and S is updated to (A ∪ { g }, B), i.e. S={ (A ∪ { g }, B) | B ∩ f (g)=B }, then access next concept.
If meeting B ∩ f (g) ≠ B, S is known as and produces sub- concept, and if there is no certain father's concept of S (AF,BF) causeThen generation new ideas N=(A ∪ { g }, B ∩ f (g)).Need this when to find newborn general Father's concept and sub- concept of thought, from concept lattice property, the sub- concept of newborn concept is the sub- concept S of generation.Look for his father general Read, if F*=(AF*,BF*) be S=(A, B) all direct father's concept set, to any concept F=(A in F*F,BF)：
If a) property set of N includes BF, then this concept is set to father's concept of N, and the set membership of F and S is deleted, will The mark position 1 of F.If the property set of N does not include BF, then its mark invariant position.
B) the property set number count of newborn concept N is obtained, because the property set number of his father's concept is necessarily smaller than count.Access attribute number is the concept set L*=(A of count-1L*,BL*), each concept L=(A in traversal setL, BL), check the property set of N whether comprising BL：If comprising, and a certain sub- concept flag bit of this concept is 1, then by the mark of L Position 1；If comprising, but all sub- concept flag bit of L is not 1, then L is set into father's concept of N and by its mark position 1；If do not included, its flag bit is not changed.
Principle then according to intension ascending order continues to access next concept, until all of concept is all accessed.
2nd, the scheme of new tab
1st, the concept lattice that initialization files object and file attribute are constituted
When an object and its corresponding property set is inserted, file attribute can not be sky.And be by file object and category Property composition concept set flag bit, initial value is 0.
2nd, each concept is accessed according to intension ascending order
Assuming that the label for being currently needed for insertion is m, the object set corresponding to it is g (m), be denoted as (g (m), m).According to interior The principle for containing gesture ascending order is accessed concept in concept lattice successively, if the current concept for traversing is S=(A, B), is inserted into object For (g (m), m).It can be seen from incremental construction algorithm：
If meeting A ∩ g (m)=A, S is known as concept to be updated, and S is updated to (A, B ∪ { m }), i.e. S= (A, B ∪ { m }) | A ∩ g (m)=A }, then access next concept.
If meeting A ∩ g (m) ≠ A, S is known as and produces sub- concept, and if there is no certain sub- concept of S (AC,BC) causeThen generation new ideas N=(A ∩ g (m), B ∪ { m }).Need this when to find newborn general Father's concept and sub- concept of thought, from concept lattice property, father's concept of newborn concept is the sub- concept S of generation.Look for its son general Read, if C*=(AC,BC) be S=(A, B) it is all directly sub- concepts set, to any concept C=(A in C*C,BC)：
If c) object set of N really includes AC, then this concept is set to the sub- concept of N, and the set membership of S and C is deleted, By the mark position 1 of C.If the property set of N does not include BC, then its mark invariant position.
D) the property set number count of newborn concept N is obtained, because the object set number of its sub- concept is necessarily smaller than count.Access attribute number is the concept set L*=(A of count-1L*,BL*), each concept L=(A in traversal setL, BL), check the object set of N whether comprising BL：If comprising, and a certain father's concept flag bit of this concept is 1, then by the mark of L Position 1；If comprising, but all father's concept flag bits of L are not 1, then L is set into the sub- concept of N and by its mark position 1；If do not included, its flag bit is not changed.
Principle then according to intension ascending order continues to access next concept, until all of concept is all accessed.
3rd, the scheme of file object is deleted
Define 1：For concept (A1,B1),(A2,B2), meet (A1,B1) ＞ (A2,B2), if only existing unique one Concept (Ax,Bx) cause (A1,B1) ＞ (Ax,Bx) ＞ (A2,B2), then (Ax,Bx) it is (A1,B1),(A2,B2) on exclusive path Key.
1. file object and its all labels that user wants to delete are obtained, is designated as (a, f (a)).
2. all S (A, B) are searched according to intension gesture ascending order, meet a ∈ A.
3. accessed since the minimum S of intension gesture, obtain all sub- concept C (A of current SC,BC)。
4. S is updated to (A- { a }, B-f (a)), and judge A- { a } whether beOr be AC。
If a) A- { a } isOr AC, then the S after updating is redundancy concept, it is necessary to judge whether S is its certain a pair of father and son Concept (A1,B1),(A2,B2) between key.
If i. S is (A1,B1),(A2,B2) between key, then delete concept S and its pass with other concepts System, sets up (A1,B1),(A2,B2) between set membership.
If ii. S is not (A1,B1),(A2,B2) between key, then delete concept S and its with other concepts Relation
If b)And A- { a } ≠ AC, then next S (A, B) is accessed, perform step 4.
5. all S are accessed and finished, and are terminated.
Four, delete the scheme of file label
1. file label and its all objects that user wants to delete are obtained, be designated as (g (b), b).
2. all S (A, B) are searched according to intension gesture ascending order, meet b ∈ B.
3. accessed since the minimum S of intension gesture, obtain all sub- concept C (A of current SC,BC)。
4. S is updated to (A-g (b), B- { b }), and judge B- { b } whether beOr be BC。
If a) B- { b } isOr BC, then the S after updating is redundancy concept, it is necessary to judge whether S is its certain a pair of father and son Concept (A1,B1),(A2,B2) between key.
If i. S is (A1,B1),(A2,B2) between key, then delete concept S and its pass with other concepts System, sets up (A1,B1),(A2,B2) between set membership.
If ii. S is not (A1,B1),(A2,B2) between key, then delete concept S and its with other concepts Relation
If b)And B- { b } ≠ BC, then next S (A, B) is accessed, perform step 4.
5. all S are accessed and finished, and are terminated.
5th, the scheme of add file object-label relation
Assuming that there is file object a and its corresponding label b, user will carry out deletion action, that is, delete relation (a, B), specific embodiment is as follows：
1st, the maintenance position of concept lattice is determined：Such father and son's concept is found to [(AF,BF),(AC,BC)], wherein AFComprising A, BCComprising b；The father and son's concept found to every a pair is to performing step 2-4：
2nd, new ideas are generated：Product concept (AC∪{a},BF∪{b})；
3rd, the renewal of father and son's concept centering concept：
If a) AF=AC∪ { a }, BF∪ { b }=BC, then by product concept (AC∪{a},BF∪ { b }) replace father and son's concept pair [(AF,BF),(AC,BC)]；
If b) AF=AC∪ { a } sets up, BF∪ { b }=BCIt is invalid, then by generation node (AC∪{a},BF∪ { b }) replace Father's concept (AF,BF)；
If c) AF=AC∪ { a } is invalid, BF∪ { b }=BCSet up, then by generation node (AC∪{a},BF∪ { b }) replace Sub- concept (AC,BC)；
If d) AF=AC∪ { a } is invalid, BF∪ { b }=BCIt is invalid, add the concept of generation.
4th, the relation of father and son's concept pair and adjacent father and son's concept pair is changed：
For father and son's concept group { [(A1F,B1F),(A1,B1)],[(A2F,B2F),(A2,B2)], meet A1F、A2FComprising a, B1、B2Comprising b, when increasing object-attribute to (a, b), product concept (A1∪{a},B1F∪{b})、(A2∪{a},B2F∪ { b }), the update mode of father and son's concept group is as follows：
A) father and son's concept group is updated to (A1∪{a},B1F∪{b})、(A2∪{a},B2F∪ { b }), then set up (A1∪{a}, B1F∪ { b }) and (A2∪{a},B2F∪ { b }) direct set membership.
If b) (A1,B1) it is updated to (A1∪{a},B1F∪ { b }) and (A2,B2) it is updated to (A2∪{a},B2F∪ { b }), or Person (A1F,B1F) it is updated to (A1∪{a},B1F∪ { b }) and (A2F,B2F) it is updated to (A2∪{a},B2F∪ { b }), then father and son's concept The connected mode of four concepts is constant in group.
If c) [(A1F,B1F),(A1,B1)] it is updated to [(A1∪{a},B1F∪{b}),(A1,B1)], [(A2F,B2F), (A2,B2)] it is updated to [(A2F,B2F),(A2∪{a},B2F∪ { b })], then four connected modes of concept during father and son's concept is rolled into a ball It is constant.
If d) [(A1F,B1F),(A1,B1)] it is updated to [(A1F,B1F),(A1∪{a},B1F∪ { b })], [(A2F,B2F), (A2,B2)] it is updated to [(A2∪{a},B2F∪{b}),(A2,B2)], then delete (A1F,B1F) and (A2∪{a},B2F∪ { b }) Direct set membership, sets up (A1∪{a},B1F∪ { b }) and (A2∪{a},B2F∪ { b }) direct set membership.
If e) [(A1F,B1F),(A1,B1)] it is updated to [(A1∪{a},B1F∪{b}),(A1,B1)] or [(A1F,B1F), (A1∪{a},B1F∪ { b })], [(A2F,B2F),(A2,B2)] it is updated to (A2∪{a},B2F∪ { b }), then (A2∪{a},B2F∪ { b }) substitution (A2,B2) position, and delete (A1F,B1F) and (A2F,B2F) direct set membership.
If f) [(A1F,B1F),(A1,B1)] it is updated to (A1∪{a},B1F∪ { b }), [(A2F,B2F),(A2,B2)] by more It is newly [(A2∪{a},B2F∪ { b }), (A2,B2)] or [(A2F,B2F),(A2∪{a},B2F∪ { b })], then (A1∪{a},B1F∪ { b }) substitution (A1F,B1F) position, and delete (A1,B1) and (A2,B2) direct set membership.
If g) [(A1F,B1F),(A1,B1)] in concept not by (A1∪{a},B1F∪ { b }) update, then set up (A1F,B1F) With (A1∪{a},B1F∪ { b }) direct set membership, set up (A1∪{a},B1F∪ { b }) and (A1,B1) direct father and son close System.
If [(A2F,B2F),(A2,B2)] also not by (A2∪{a},B2F∪ { b }) update, then set up (A2F,B2F) and (A2∪ {a},B2F∪ { b }) direct set membership, set up (A2∪{a},B2F∪ { b }) and (A2,B2) direct set membership, finally Set up (A1∪{a},B1F∪ { b }) and (A2∪{a},B2F∪ { b }) direct set membership.
If h) [(A1F,B1F),(A1,B1)] in concept not by (A1∪{a},B1F∪ { b }) update, then set up (A1F,B1F) With (A1∪{a},B1F∪ { b }) direct set membership, set up (A1∪{a},B1F∪ { b }) and (A1,B1) direct father and son close System.
If [(A2F,B2F),(A2,B2)] it is updated to [(A2∪{a},B2F∪{b}),(A2,B2)], then delete (A1F,B1F) With (A2F,B2F) direct set membership, and set up (A1∪{a},B1F∪ { b }) and (A2F,B2F) direct set membership；If [(A2F,B2F),(A2,B2)] it is updated to [(A2F,B2F),(A2∪{a},B2F∪ { b })], then do not adjust conceptual relation.
If i) [(A2F,B2F),(A2,B2)] also not by (A2∪{a},B2F∪ { b }) update, then set up (A2F,B2F) and (A2∪ {a},B2F∪ { b }) direct set membership, then set up (A2∪{a},B2F∪ { b }) and (A2,B2) direct set membership.
If [(A1F,B1F),(A1,B1)] it is updated to [(A1F,B1F),(A1∪{a},B1F∪ { b })], then delete (A1,B1) with (A2,B2) direct set membership, while set up (A1∪{a},B1F∪ { b }) and (A2∪{a},B2F∪ { b }) direct father and son close System；If [(A1F,B1F),(A1,B1)] it is updated to [(A1∪{a},B1F∪{b}),(A1,B1)], then do not adjust conceptual relation.
6th, the scheme of file object-label relation is deleted
Assuming that there is file object a and its corresponding label b, user will carry out deletion action, that is, delete relation (a, B), specific embodiment is as follows：
1st, the maintenance position of concept lattice is determined：Such concept (A, B) is found, wherein a belongs to A, and b belongs to B；It is assumed that (AF, BF) be (A, B) father's concept, (Ac,Bc) be (A, B) a sub- concept.
2nd, generation father and son's concept is to [(A, B- { b }), (A- { a }, B)].
3rd, father and son's concept pair is updated：Judge and perform one of action.
Action 1：If the attribute of (A, B- { b }) and concept (AF,BF) attribute differ, and the extension of (A- { a }, B) with (Ac,Bc) extension differ, then simultaneously retain generation father's concept and sub- concept；
Action 2：If the attribute of (A, B- { b }) and concept (AF,BF) attribute it is identical, then delete the father's concept for having generated, Only retain sub- concept (A- { a }, B)；If the extension of (A- { a }, B) and (Ac,Bc) extension it is identical, then delete the son for having generated Concept, only retains father's concept (A, B- { b })；
Action 3：If the attribute of (A, B- { b }) and concept (AF,BF) attribute it is identical, and the extension of (A- { a }, B) with (Ac,Bc) extension it is identical, then simultaneously delete generation father's concept and sub- concept；
4th, the relation between the father and son's concept pair set up after updating：
If step 3 execution action 1,：If father and son's concept is to being connected to father and son's concept pair, the company of foundation between father's concept Connect, connection is set up between sub- concept；
If step 3 execution action 2,：For currently processed father and son's concept pair, if the father and son's concept centering pointed to (A, B- { b }) is deleted in step 3, then set up the connection of the father's concept for pointing to (A, B- { b })；If the father and son's concept centering pointed to (A, B- { b }) step 3 be deleted, then set up point to (A, B- { b }) sub- concept connection；
If step 3 execution action 3, father's concept of (A, B) and sub- concept set up connection；
Step 5, algorithm terminate, and return.

Claims (8)

1. a kind of file system directory structures method for organizing based on formal notion, it is characterised in that：Including following steps：
A：It transform traditional file systemses tree directory structure as lattice structure based on concept；By tradition in described step A File system tree bibliographic structure transform the lattice structure based on concept as includes following several step A1-A4：
A1：The concept of file in abandoning tradition tree directory structure, operation of labelling is carried out to file；
A2：Using filename as object, using label as attribute, and Formal Context K is created；
A3：Using the technique construction file system concept lattice of form concept analysis, the formalization of file system is realized；
A4：The structure of file and its label is analyzed and presented based on file system concept lattice, the layer between label is disclosed Level relation and incidence relation；
B：File operation is mapped as the operation of concept lattice, the dynamic change of bibliographic structure is realized；Described file operation includes The operation of add file or label, deletes the operation of file or label, and the attribute of existing file or label is repaiied Change；The method that the dynamic change of bibliographic structure is realized in described step B, using following steps B1-B3：
B1：File operation is operated to concept lattice and is mapped, add file correspondence adds object a category corresponding with its in concept lattice Property set f (a), wherein f is to obtain attribute set operation, i.e., even (a, f (a)) to sequence is added in concept lattice, real concept lattice Incremental construction；The corresponding operation of file is deleted to be mapped as deleting a method of object a in concept lattice, real concept lattice it is dynamic State updates；
B2：Addition tag operational correspondence adds attribute b and its corresponding object set g (b) in concept lattice, and g therein is root According to attribute object set is obtained to operate, i.e., to added in concept lattice sequence it is even (g (b), b), the incremental construction of real concept lattice；Delete Except the corresponding operation of label is mapped as deleting a method of attribute b in concept lattice, the dynamic renewal of real concept lattice；
B3：More new file-label relational operation correspondence is added in concept lattice or deletes object-relation on attributes, i.e., first general Read and search in lattice the selected attribute b that object a possesses, then realize to formal notion related to object a and attribute b in concept lattice It is updated；
C：Realize passing through access of the mulitpath to a certain file, it is to avoid the multistage backtracking under tree directory structure mode；Institute The method for realizing that a certain file can be inquired about by mulitpath in step C is stated, using following steps C1-C2：
C1：File system concept lattice is obtained according to file-label relation；
C2：To be layered by intension set sizes in file system concept lattice；
Then, by the property set B of each node in every layer and its parent attribute collection BFSeek difference set Bx, and by the category in difference set Property element as current layer Lx on tree-likeization path node,
Meanwhile, by the object set A of each node in the every layer and object set A of its child nodeCDifference set Ax is sought, and by difference set Ax Each object as Lx leaf node.
2. the file system directory structures method for organizing based on formal notion according to claim 1, it is characterised in that：Institute Add file operation is mapped as adding the method that object (a, f (a)) is operated in concept lattice in stating step B1, using following steps：
B11：As add file g during user is to file system, a series of labels f (g) are selected in existing label as the category of g Property；
B12：According to all concepts in intension gesture ascending order access concept lattice：Assuming that current accessed is to S (A, B), judge S for be updated Concept still produces sub- concept, if S is concept to be updated, S is updated to (A ∪ { g }, B)；If S gives birth to produce sub- concept Into concept N (A ∪ { g }, B ∩ f (g)), while searching direct father's concept F of N, the set membership of F and N is then set up, N and S's Set membership.
3. the file system directory structures method for organizing based on formal notion according to claim 2, it is characterised in that：Institute Deletion file operation is mapped as deleting the method that object (a, f (a)) is operated in concept lattice in stating step B1, using following steps：
B01：To concept S (A, B) of each object set comprising a, S is updated to N (A- { a }, B-f (a))；
B02：Judge A-a whether beOr be the S object set of sub- concept；
B03：If meeting above-mentioned condition, the concept N (A- { a }, B-f (a)) after updating is redundancy concept, and continues judgement and be No father and son the concept F and C that there is S, to meet the key that S is the concept N (A- { a }, B-f (a)) after updating；
B04：If meeting S for key, N and its dependence edge are deleted, set up the set membership of F and C；If S is not to close Key concept, then only delete N and its dependence edge.
4. the file system directory structures method for organizing based on formal notion according to claim 3, it is characterised in that：Institute Addition tag operational is mapped as adding attribute (g (b), the b) method of operation, using following steps in concept lattice in stating step B2：
B21：When label m is added during user is to file system, a series of files g (m) that selection is associated are used as the right of m As；
B22：According to all concepts in intension gesture ascending order access concept lattice, it is assumed that current accessed to S (A, B), judge S for be updated Concept still produces sub- concept：If S is concept to be updated, S is updated to (A, B ∪ { m })；If S gives birth to produce sub- concept Into concept N (A ∩ g (m), B ∪ { m }), while search the direct sub- concept C of N, the set membership of N and C, S and N are then set up Set membership.
5. the file system directory structures method for organizing based on formal notion according to claim 4, it is characterised in that：Institute One tag operational of deletion is mapped as deleting attribute (g (b), the b) method of operation, using following step in concept lattice in stating step B2 Suddenly：
B91：To concept S (A, B) of each attribute set comprising b, S is updated to N (A-g (b), B-b)；
B92：Judge B-b whether beOr the property set of S certain father's concept；
B93：If meeting above-mentioned condition, the concept N (A-g (b), B-b) after updating is redundancy concept, judges whether S Father and son concept F and C, with meet S as update after concept N (A- { a }, B-f (a)) key；B94：If meeting S to close Key concept, then delete N and its dependence edge, sets up the set membership of F and C；If S is not key, N and its phase are only deleted Edge closing.
6. the file system directory structures method for organizing based on formal notion according to claim 5, it is characterised in that：Sentence Whether a concept of breaking is key, using following steps：
BB1：Current concepts S (A, B) are accessed, if his father's concept set is combined into empty or sub- concept set and is combined into sky, judges that it is not Key, continues to access next concept；
BB2：If father's concept set of S (A, B) is not sky with sub- concept set, then：(1) current concepts S (A, B) are obtained Father concept F (AF,BF)；(2) the sub- concept C (A of current concepts S (A, B) are accessed one by oneC,BC), obtain current sub- concept C (AC,BC) Father concept set Fc, make F'(AF',BF') it is the node set of removal S (A, B) in Fc；If nodes X is present, S (A, B) is no It is key；Otherwise S (A, B) is key；Wherein, nodes X is the child node of node Y, and wherein Y is F (AF,BF) appoint One node.
7. the file system directory structures method for organizing based on formal notion according to claim 6, it is characterised in that：Institute The operation for stating add file-label relation in step B3 is mapped as adding the method that object-relation on attributes is operated in concept lattice, tool Body step is as follows：
B301：Obtain file to be added-label relation sequence even (a, b), the concept in notion of traversal lattice finds and all meets a ∈A1, b ∈ B2Father and son's concept to [(A1,B1),(A2,B2)]；
B302：By to each father and son's concept to [(A1,B1),(A2,B2)] product concept N (A2∪{a},B1∪{b})；Wherein
If A1=A2∪ { a }, and B2=B1∪ { b }, then replace [(A with N1,B1),(A2,B2)]；
If A1=A2∪ { a }, and B2≠B1∪ { b }, then replace (A with N1,B1)；
If A1≠A2∪ { a }, and B2=B1∪ { b }, then replace (A with N2,B2)；
If A1≠A2∪ { a }, and B2≠B1∪ { b }, then set up (A1,B1) with the set membership of N, N and (A2,B2) father and son close System, deletes (A1,B1) and (A2,B2) set membership.
8. the file system directory structures method for organizing based on formal notion according to claim 7, it is characterised in that：Institute The operation for stating deletion file-label relation in step B3 is mapped as deleting the method that object-relation on attributes is operated in concept lattice, tool Body step is as follows：
B311：File-label relation (a, b) to be deleted is obtained, notion of traversal finds all concept S for meeting a ∈ A, b ∈ B (A,B)；
B312：To each S (A, B), by (a, b) and S (A, B) product concepts to [(A, B- { b }), (A- { a }, B)], while obtaining Take all father's concept F and sub- concept C of S (A, B)；Wherein：
Property set if there is F is B- { b }, and there is the object set of C is A- { a }, then delete the concept of generation to [(A, B- { b }), (A- { a }, B)], the set membership of F and C is set up, delete S and its dependence edge；
If there is F property set be B- { b }, and in the absence of C object set be A- { a }, then delete (A, B- { b }), set up F with The set membership of (A- { a }, B), sets up the set membership of (A- { a }, B) and C, deletes S and its dependence edge；
Be B- { b } if there is no the property set of F, and there is the object set of C for A- { a }, then delete (A- { a }, B), set up F with The set membership of (A, B- { b }), sets up the set membership of (A, B- { b }) and C, deletes S and its dependence edge；
It is B- { b } if there is no the property set of F, and is A- { a } in the absence of the object set of C, then sets up F and (A, B- { b }) Set membership, sets up the set membership of (A, B- { b }) and (A- { a }, B), sets up the set membership of (A- { a }, B) and C, deletes S And its dependence edge.
CN201510562426.0A 2015-09-07 2015-09-07 A kind of file system directory structures method for organizing based on formal notion Expired - Fee Related CN105243081B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510562426.0A CN105243081B (en) 2015-09-07 2015-09-07 A kind of file system directory structures method for organizing based on formal notion

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510562426.0A CN105243081B (en) 2015-09-07 2015-09-07 A kind of file system directory structures method for organizing based on formal notion

Publications (2)

Publication Number Publication Date
CN105243081A CN105243081A (en) 2016-01-13
CN105243081B true CN105243081B (en) 2017-06-16

Family

ID=55040730

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510562426.0A Expired - Fee Related CN105243081B (en) 2015-09-07 2015-09-07 A kind of file system directory structures method for organizing based on formal notion

Country Status (1)

Country Link
CN (1) CN105243081B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106227805A (en) * 2016-07-17 2016-12-14 河南理工大学 A kind of term definition method and system theoretical based on form concept analysis
CN107220305B (en) * 2017-05-10 2020-09-29 燕山大学 Incremental concept calculation method of college course system based on concept tree
WO2019075637A1 (en) * 2017-10-17 2019-04-25 深圳中兴力维技术有限公司 Method and device for detecting input/output request behavior, and storage medium
CN109189728B (en) * 2018-07-18 2022-08-12 深圳市网心科技有限公司 Intelligent hardware device, magnetic disk data processing method and storage medium
WO2021016842A1 (en) * 2019-07-30 2021-02-04 深圳光大同创新材料有限公司 Design method for tagged file-system
CN110609812A (en) * 2019-07-30 2019-12-24 深圳光大同创新材料有限公司 Design method of tagged file system
CN111339354B (en) * 2020-02-12 2022-08-19 燕山大学 Incremental concept tree-based video content structure representation method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2003900520A0 (en) * 2003-02-06 2003-02-20 Email Analysis Pty Ltd Information classification and retrieval using concept lattices

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Organizing UNIX directories as lattices;Carl Ponder;《ACM SIGOPS Operating Systems Review》;19971031;第31卷(第4期);72-77 *
采用二叉树结构生成概念格的算法;毛华 等;《计算机工程与应用》;20091121;第45卷(第33期);35-37 *

Also Published As

Publication number Publication date
CN105243081A (en) 2016-01-13

Similar Documents

Publication Publication Date Title
CN105243081B (en) A kind of file system directory structures method for organizing based on formal notion
CN104462582B (en) A kind of web data similarity detection method based on structure and content secondary filtration
CN104809190B (en) A kind of database access method of tree structure data
CN103412917B (en) The Database Systems of a kind of extendible polymorphic type FIELD Data coordinated management and management method
CN101595476B (en) System, method and computer program for client definition information architecture
CN102768674B (en) A kind of XML data based on path structure storage method
CN103116625A (en) Volume radio direction finde (RDF) data distribution type query processing method based on Hadoop
Xiao et al. SWEclat: a frequent itemset mining algorithm over streaming data using Spark Streaming
WO2017155464A1 (en) Method of facilitating distributed data search in a federated cloud and system thereof
Louhdi et al. Transformation rules for building owl ontologies from relational databases
Kachaoui et al. MQL2SQL: A proposal data transformation algorithm from mongoDB to RDBMS
CN104794196B (en) A kind of acquisition of tree structure data and update method
Shi et al. Flow-based influence graph visual summarization
Benites et al. Hierarchical interestingness measures for association rules with generalization on both antecedent and consequent sides
KR100612376B1 (en) A index system and method for xml documents using node-range of integration path
Zhou et al. An intersection cache based on frequent itemset mining in large scale search engines
Meguellati et al. A survey on balanced binary search trees methods
Rodríguez-González et al. Mining frequent similar patterns on mixed data
Endres The structure of preference orders
Demaine et al. Belga b-trees
Shan et al. A subgraph query method based on adjacent node features on large-scale label graphs
Bai et al. Querying multi-source heterogeneous fuzzy spatiotemporal data
Jensen et al. A hybrid XML-relational grid metadata catalog
CN112131434B (en) Extensible access control markup language strategy searching method based on matching tree
Cao et al. Privacy protection data mining algorithm in blockchain based on decision tree classification

Legal Events

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

Granted publication date: 20170616

Termination date: 20180907