CN1353374A - Method based on Internet for organizing and managing information - Google Patents
Method based on Internet for organizing and managing information Download PDFInfo
- Publication number
- CN1353374A CN1353374A CN 00133447 CN00133447A CN1353374A CN 1353374 A CN1353374 A CN 1353374A CN 00133447 CN00133447 CN 00133447 CN 00133447 A CN00133447 A CN 00133447A CN 1353374 A CN1353374 A CN 1353374A
- Authority
- CN
- China
- Prior art keywords
- node
- relation
- tree
- shaped graph
- information
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 230000008520 organization Effects 0.000 claims description 9
- 238000004891 communication Methods 0.000 claims description 3
- 238000012217 deletion Methods 0.000 claims description 3
- 230000037430 deletion Effects 0.000 claims description 3
- 230000014509 gene expression Effects 0.000 description 18
- 238000010586 diagram Methods 0.000 description 14
- 238000007726 management method Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 8
- 238000009795 derivation Methods 0.000 description 6
- 230000007246 mechanism Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 4
- 230000008676 import Effects 0.000 description 4
- 235000014510 cooky Nutrition 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 210000000056 organ Anatomy 0.000 description 2
- 238000012550 audit Methods 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008602 contraction Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000013508 migration Methods 0.000 description 1
- 230000005012 migration Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A method for organizing and managing information for Internet features that the information, the relation between the information and the operator and user of the information are defined as node, relation and user, and a tree-shaped relation graph is created to reflect the derivative, layer and membership between node, relation and user. A method for providing the flow to create and manage the said tree-shaped relation graph.
Description
The present invention relates to a kind of method that is used for the organization and management information of the Internet, relate more specifically to a kind of derivative strucure of showing information in the Internet and hierarchical structure and be subordinate to the tree-shaped graph of a relation of structure, and the method for foundations, management, the tree-shaped graph of a relation of renewal is provided.
Along with the fast development of the Internet, the information on the Internet is explosive growth.How to organize, manage, retrieve these information and become a great problem.Undertaken by all kinds of portal websites mostly carrying out information retrieval on the Internet at present.Portal website adopts various search techniques to be made into search engine, and the various information of removal search are set up various Info Links on the net.
Portal website adopts certain criteria for classification, search engine was collected various information classify.Such as some famous websites information is divided into following a few class: Arts and Humanities, business ﹠ economy, news ﹠ media, recreation ﹠ sports, computer and the Internet, reference, education, amusement, science, social science, government and politics, healthy and medicine, society and culture etc.
Along with being on the increase of network information, the content ratio that search engine can index constantly descends, and a lot of information become the isolated island of information owing to do not collected by portal website.And the information organization form and the information classification method of each portal website are not quite similar, and have caused the completeness of client's search information and accuracy rate all unsatisfactory.
Because information adopts the mode of classification to organize, each information source, each website all are embodied as independently individual in portal website, relation to each other and organize situation unclear.That is to say that in some cases, the classification of this information and expression form are not too suitable.Such as government somewhere, requirement is made government affairs public and online working, wish and he and he subordinate's mechanism can be appeared on the net with form of websites independently respectively, but can express membership between each mechanism clear, expressly, at this time, the form of traditional information search and information classification statement just seems not too effective.
Simultaneously, each information source mainly searches by the interviewee of portal website, and portal website mainly passes through search engine active searching information, and each information source oneself is initiatively set up with portal website and linked relatively difficulty.Further, wish oneself to be root node certain information source website, convey that oneself is relevant, but be not again that the website that belongs to same classification associates, even in portal website, explain out with very vivid mode such as dendrogram, also do not have the website to realize this function at present.Further again, each the node website on this dendrogram, wish other and oneself have relation, but the website that does not belong to same classification also can freely be linked on this dendrogram, this function does not also realize on the net at present.
As above analysis, based on the Internet present case, an object of the present invention is to propose the method for information organization and management new on a kind of the Internet, it is different from the existing method of coming organizational information by classification in the Internet, it takes the mode of a kind of similar " tree " to organize information on the Internet, and come the derivative strucure and the hierarchical structure of concrete exhibition information by a kind of tree-shaped graph of a relation, thereby each is inter-agency in the world that reflects reality, derivation between all departments of mechanism, level and the relation that is subordinate to, as between the government organs and government organs inside, between each branch office and each branch office inside in the transregional company, the relation of between the every profession and trade association and employer's organization inside.
Another object of the present invention is by certain method and step, make each node that constitutes tree-shaped graph of a relation have self-reproduction and the ability of deriving, each discrete message can incorporate tree-shaped graph of a relation easily and further derive, thereby the node in the tree-shaped graph of a relation is promptly increased.
A further object of the present invention is by certain method and step, the information that makes the node administration person of each node of tree-shaped graph of a relation can manage this node easily.
A further object of the present invention is by certain method and step, the user who makes the keeper of each node of tree-shaped graph of a relation can increase easily, manage, delete this node.
To make the present invention and its specific characteristic and advantage become more obvious by the detailed description of doing below in conjunction with accompanying drawing.
Fig. 1 is a synoptic diagram of the present invention.
Fig. 2 is certain transregional company's institutional framework synoptic diagram.
Fig. 3 is first kind of synoptic diagram of certain tree-shaped graph of a relation of transregional company.
Fig. 4 is second kind of synoptic diagram of certain tree-shaped graph of a relation of transregional company.
Fig. 5 is the third synoptic diagram of certain tree-shaped graph of a relation of transregional company.
Fig. 6 is a node relationships icon synoptic diagram.
Fig. 7 is the process flow diagram that the visitor generates new user.
Fig. 8 is the process flow diagram that node administration person generates new node.
Fig. 9 is the process flow diagram that the visitor generates new node.
Figure 10 is the process flow diagram of node administration person's deletion of node.
As shown in Figure 1, the present invention represents the information on the Internet, derivation, level and the relation that is subordinate to, management of information person and user between the information respectively with node, relation and user.Each node is represented the set of an information, and it can be a column of a website, a website or a part of information content of a column.The particular content of each node varies, and this and relation of the present invention are little.Node is tied by relation, and each concerns that representative information gathers the contact of certain between the node just, as derivation, level or membership.Situation, hierarchical relationship each other and membership are each other organized in the derivation that relation can be explained between the website, also can explain under the website derivation between each column and organize situation, hierarchical relationship each other and membership each other, even can also explain under the column derivation between the each several part content and organize situation, hierarchical relationship each other and membership each other.User among the figure represent this node registering and and the visitor of node binding, the user is divided into node administration person and domestic consumer.The user can carry out the operation that right with it adapts, as visits information, the renewal of this node and safeguard the information of this node.
By the information on the Internet is divided into node one by one, by various relations individual node is connected then, the visitor has formed a kind of brand-new internet information organization and management pattern by the information that the user who becomes node utilized, managed these nodes.
Information on the internet must show on computers in some way.The present invention has designed a kind of tree-shaped graph of a relation, is used for showing the information according to after the present invention's processing.
The present invention is the tree-shaped once graph of a relation of example brief description with certain transregional company temporarily.Certainly, the present invention just with transregional company as an illustrative, with reference to this example, the present invention can be applied in a lot of occasion and situation.
Certain general headquarters of transregional company wishes to carry out information exhibition, online working on the net, also wishes that each branch office of subordinate also carries out network information displaying and online working simultaneously.Each branch office sets up website separately respectively, upgrades the data of oneself respectively.General headquarters of transregional company wish that also each website of subordinate and oneself can occur with an integral body, can correctly reflect the membership credentials of each branch office on the net, make the visitor can be clear that whole corporate facility full figure.Simultaneously, each branch office of the subordinate of main office also can come in the affiliated institutions of oneself at any time as a node link, forms a detailed orderly mechanism's full figure with expansion capacity.Each employee of transregional company inside signs in to corresponding website, can get in touch with certain department of certain branch office, branch office inside even certain employee of department inside.
The portion of tissue structural scheme of mechanism of this transregional company's reality is seen Fig. 2.
Fig. 3 is the synoptic diagram of this multinational tree-shaped graph of a relation.As shown in Figure 3, general headquarters of transregional company and affiliated institutions all are the set of information, and therefore as a node of tree-shaped graph of a relation, the membership between them shows with relation, and the user of each node can sign in to node corresponding by login interface.Each node in the tree-shaped graph of a relation is with an icon representation as the house, (this is a synoptic diagram, this icon can be changed into other icon), the and then name of this node behind the icon.The visitor can enter node corresponding with the name of click node icon or node correspondence, browses every information that this node provides, and carries out and the corresponding various operations of identity.Among the figure, the icon of U.S. branch office is different with the icon of other node, and this is because this node types is different with other node.Though the content of other node is independently of one another, is stored on the server at tree-shaped graph of a relation place, is called internal node.And U.S. branch office before the tree-shaped graph of a relation of this transregional company is set up with regard in the website of having set up oneself on the Internet.In order not carry out the duplication of labour, U.S. branch office can set up the node of another kind of type on tree-shaped graph of a relation: external node.The content stores of external node has independent domain name and the link of oneself in other server, just an internet website independently.At this moment, as long as with this website and node binding and set up link and can form a new external node.The visitor clicks the icon of external node, the internet website that visit is corresponding.Owing to possess this function, we can be incorporated into the website that has existed in the Internet in the tree-shaped graph of a relation.
A node derives a new node, and this node becomes the father node of new node, and new node becomes the child node of father node.If father node has several child nodes, child node is called the brotgher of node mutually.
In Fig. 3,
For concerning icon, can represent various relations easily.The concrete implication of graph of a relation target will be described in detail below.
The user account login node corresponding of this multinational employee by distributing, if the user is endowed certain administration authority, he can manage accordingly according to authority, as operation, inspection running log, the more operations such as content of new node of Maintenance Point.
Introduce each element that constitutes tree-shaped graph of a relation in detail below in conjunction with Fig. 3:
● node
A node of the tree-shaped graph of a relation of icon 1 expression, color is blue.If picture is a red color, represent that then the visitor is just visiting this node, is referred to as present node.Certainly, also can adopt the node and the present node of other picture or the tree-shaped graph of a relation of other color showing, this is a synoptic diagram.
Icon 5 is also represented a node of tree-shaped graph of a relation, is a website that constitutes tree-shaped graph of a relation, and color is blue.If picture is a red color, then represent present node.The node of this node and icon 1 representative has tangible difference.The content stores of the node of icon 1 representative is internal node in generating, handling in the computing machine of tree-shaped graph of a relation.And this node is an independent website, and its content stores in a certain computing machine, is external node in the Internet.Tree-shaped graph of a relation has been set up one with this website and has been linked, and clicking this icon is addressable this website.
● relation
Exist in the icon+,-, represent that current child node also has subordinate's child node.Subordinate's child node of the current child node of+expression is hidden and is not shown, subordinate's child node of the current child node of-expression shows on tree-shaped graph of a relation.
Following mask body is introduced each graph of a relation target implication:
Expression expression father node is except when preceding child node also has one or more child nodes outward, and current child node also has subordinate's child node, but these subordinate's child nodes are all hidden on tree-shaped graph of a relation and do not shown.Icon 10 as Fig. 4, expression general headquarters of transregional company are except when beyond the Asia-Pacific general headquarters of preceding child node, also have child node European Area general headquarters, and the Asia-Pacific general headquarters of current child node also have subordinate child node Japan branch office, Hong Kong branch office, China's Mainland branch office, but these three subordinate's child nodes are not presented on the tree-shaped graph of a relation.
When the user clicks
, as the icon 10 of Fig. 3, then tree-shaped graph of a relation becomes the appearance of Fig. 4.When the user clicks
, as the icon 10 of Fig. 4, then tree-shaped graph of a relation becomes the appearance of Fig. 3.The difference of these two icons is whether subordinate's child node of the current child node that icon links shows.
When the user clicks
, as the icon 14 of Fig. 3, then tree-shaped graph of a relation becomes the appearance of Fig. 4.When the user clicks
, as the icon 14 of Fig. 4, then tree-shaped graph of a relation becomes the appearance of Fig. 3.The difference of these two icons is whether subordinate's child node of the current child node that icon links shows.
By using top method for expressing, all nodes can be shown.If but the number of node is many especially, it is very big that the operand of so this method and storage demand will become.Tree-shaped graph of a relation also provides another display mode.In this display mode, tree-shaped graph of a relation only shows father node, the present node of present node, the child node of present node.Tree-shaped graph of a relation provides and gets back to highest father node, shows these two shortcuts of whole nodes simultaneously.
For the transregional company in the example, tree-shaped graph of a relation such as Fig. 5 of adopting the second way to show.Present node is Asia-Pacific general headquarters, and father node is general headquarters of transregional company, and child node is Japanese branch office, Hong Kong branch office, China's Mainland branch office.The meaning of icon 10 expressions illustrates general headquarters of transregional company except when also have child node outside the Asia-Pacific general headquarters of preceding child node as first kind of method for expressing, that is to say that Asia-Pacific general headquarters also have the brotgher of node, but does not show.In the icon 10-the current child node of expression has subordinate's child node, and subordinate's child node all displays on tree-shaped graph of a relation.The meaning of icon 12,13 and first kind of mode are identical.
According to above said principle, in conjunction with actual conditions, can design various tree-shaped graphs of a relation, in order to the most reasonably to reflect the relation between the ensemble of communication.
Realize that on computers tree-shaped graph of a relation adopts this data structure of tree.The storage list of tree is shown with a variety of, commonly used has generalized list to represent, that parents represent, left children-right side brother represents etc. is several.Take what method representation can, as long as can realize the operations set.
Want the node of access tree, must carry out traversal of tree.So-called traversal is deferred to certain order exactly, visits all nodes in the tree all over, makes that each node is once accessed, and only once accessed.Traversal of tree has two kinds of depth-first and breadth Firsts.Depth-first is divided into preorder traversal and postorder traversal again.Adopt different traversal modes, tree-shaped graph of a relation will present different appearance, but be the same in essence.Specific algorithm realizes and programmes to be implemented in the general data structure document have.By the data structure of tree, the derived relation between each node, hierarchical relationship, membership will be very easy to realize.
In the data structure of tree, need not only to store that conventional being used for set up, the parameters of management, traverse tree, also should store display message.For each visitor, the node that he opens is different, and its operation is different, for example, click different+,-, this moment tree-shaped graph of a relation will present different profile.Therefore, corresponding to each visitor, must its corresponding tree-shaped graph of a relation display status information of storage.The expansion and the contraction information of each node of display status information outstanding feature if this node does not have subordinate's child node, then need not be provided with this parameter.Node launches, and is meant if this node has subordinate's child node, and shows its subordinate's child node, and the graph of a relation before this node indicates-.Node shrinks, and is meant if this node has subordinate's child node, does not show its subordinate's child node, and the graph of a relation before this node indicates+.When program pass arrives certain node, if this node shrinks at present, then show this node, do not show its child node simultaneously, the brotgher of node that jumps to this node continues traversal.If this node launches, then show this node, show its all next stage child nodes simultaneously, and begin to continue traversal from first of next stage child node.
Each node (except that root node), the show state of acquiescence is for shrinking.If the visitor clicks tree-shaped graph of a relation, changed the show state of certain node in the tree-shaped graph of a relation, then this node ID will be stored in the cookie variable in the client browser, carry out corresponding display operation by each node ID of retrieving in this cookie variable when showing tree-shaped graph of a relation.
As mentioned above, the display message of the data structure of tree a memory node, the whole content information of not storing each node, the contained content information of the display message of node and node is a separate storage.The display message of node is taked the tree structure storage, and general relation data library storage is adopted in the storage of the contained content of node.
Internal node, its information stores is in the computing machine at tree-shaped graph of a relation place; External node, its information stores oneself are more complete internet websites in other server on the Internet, only store the descriptor and the network address of this node in the computing machine at tree-shaped graph of a relation place.Certainly, the person in charge of this node also can transfer this node to internal node, and this operation is consistent with the operation of adding new node in tree-shaped graph of a relation.
Each node in the tree-shaped graph of a relation is all bound node administration person's number of the account.
Certain node of Accessor Access can be imported the personal information of oneself, user account, password to be applied for by the accreditation process of this node, applies to become the user of this node.Node administration person is by checking visitor's personal information, approval or rejection visitor's application.If node administration person ratifies application, user's generator program will generate new user.Idiographic flow is seen Fig. 7.
The node administration person of each node can initiatively add the user of this node.Node administration person inputs new user's personal information, user account and password, generates new user by user's generator program.
The node administration person of each node can delete the existing subscriber of this node by user's delete program according to actual conditions.
The user of each node can login and enter node corresponding by logging program, finishes the operation that every and own authority conforms to.The user can revise the log-on message of oneself by the log-on message update routine.
The node administration person of each node can constantly be derived from downstream site as required, and initiatively Lower Establishment or the mechanism chain relevant with oneself with oneself taps into tree-shaped graph of a relation.Simultaneously, the domestic consumer of certain node can set up the column of oneself website or website according to the situation of oneself, and its link is entered graph of a relation, after certain audit, will go out to represent the node of this partial content in the tree-shaped graph of a relation.Superior node need add certain Lower Establishment tree-shaped graph of a relation, and the website of Lower Establishment or also not foundation of column at this moment, superior node can generate downstream site easily, and can select to inherit the version and the partial information of own node.
The keeper who introduces node in detail below in conjunction with Fig. 8 generates the flow process of new node.
Certain node administration person, such as manager signs in to node node, can add subordinate's child node to present node.At first, node administration person generates the node administration person's of next stage child node number of the account and password, such as manager1 and password1, if the keeper's of next stage child node number of the account Already in the node, is then omitted this step.Add child node to be generated then such as the part of nodes information of node1, operation node generator program, this node node1 will appear in the tree-shaped graph of a relation.The people that keeper manager gives predetermined management node node1 with keeper's number of the account manager1 and the password password1 of newly-generated node node1, this moment, this people became the keeper of node node1, it can sign in to node node1 by feat of keeper's number of the account manager1 and password1, management whole node node1.In like manner, manager1 also can put the keeper that node1 adds next stage node and next stage node for this section.
Node administration person also can increase an external node, this node is a website that has existed on the Internet, the content of this website will not advanced the server at tree-shaped graph of a relation place by migration, and only the icon of this website is added into tree-shaped graph of a relation, with this node and the binding of this website, set up the address link on the internet.
Node administration person at first generates the keeper's of next stage child node number of the account and password, such as manager1 and password1, add this child node then such as the part of nodes information of node1, node type is set to external node then, operation node generator program, this node node1 will appear in the tree-shaped graph of a relation then.Accessor Access's node node1 is with the website that has existed that directly enters on the Internet.The keeper of this node node1 also can add the downstream site of this node, no matter this downstream site is internal node or an external node newly-generated in the tree-shaped graph of a relation.
As mentioned above, this is a kind of method that enlarges tree-shaped graph of a relation.Also have another kind of method to can be used to add new node.Introduce the flow process that the visitor generates new node in detail below in conjunction with Fig. 9.
When the visitor sees tree-shaped graph of a relation, he can add the node of oneself in tree-shaped graph of a relation.At first the visitor must determine him node as whose child node, such as node.The visitor enters the node node, imports some personal information, as number of the account and password, applies to become the node administration person of the child node of node.If the visitor has been the user of node, then this step is omitted.The visitor imports child node to be generated such as some information of node1 then, keeper's approval of wait node node.After the keeper of node node agrees the child node of node node1 as this node, automated system operation node generator program can be seen node node1 in organization chart.At this moment, the visitor can rely on its number of the account of applying for and the newly-generated node node1 of password login in node node, manages the node of oneself.If the keeper of node node disagrees with the child node of node node1 as this node, the visitor must re-enter the information of personal information and child node to be generated, and application is added child node node1 and become the node administration person of node node1.If node node1 is granted, the keeper of this node also can add the downstream site of this node.
The visitor also can add a website that has existed in the tree-shaped graph of a relation in the Internet, form an external node.The visitor clicks this node icon, will directly be linked to the node that has existed in the Internet.
At first the visitor must determine him node as whose child node, such as node.The visitor enters the node node, imports some personal information, as number of the account and password, applies to become the node administration person of the child node of node.The visitor imports child node to be generated such as some information of node1 then, and the selection node types is an external node, keeper's approval of wait node node.After the keeper of node node agrees the child node of node node1 as this node, in organization chart, can see node node1.At this moment, the visitor can rely on its number of the account of applying for and the newly-generated node1 of password login in node node, manages the node of oneself.If the keeper of node node disagrees with the child node of node node1 as this node, the visitor must re-enter the information of personal information and child node, and application is added child node node1 and become the node administration person of node node1.If node node1 is granted, the keeper of this node also can add the downstream site of this node.
Under the original state, tree-shaped graph of a relation has a root node.Be assigned a system manager (power user) and node administration person's number of the account on the root node.The node administration person of root node has the management function similar with other node administration persons.
The system manager of root node has the highest weight limit of whole tree-shaped graph of a relation, can manage whole tree-shaped graph of a relation.
In order to manage tree-shaped graph of a relation, the node administration person of each node has the right to delete its child node.Process flow diagram such as Figure 10.Node administration person need could delete the child node of oneself then by system manager's affirmation, can reduce faulty operation like this.Each node administration person can only delete the next stage child node that is being close to oneself, can not stride the child node of level deletion child node.
The system manager only manages tree-shaped graph of a relation, does not participate in the management of each node and renewal, the maintenance of nodal information, has guaranteed the independence of each node administration like this.
Though above invention has been described with reference to specific example, but this can not make detailed explanation undoubtedly to all possible application or feature, in fact concerning those of ordinary skill in the art, on basis of the present invention, can make a variety of other improvement and variations.
Claims (4)
1. method that is used for the organization and management information of the Internet may further comprise the steps:
The ensemble of communication of the Internet is divided into node one by one;
Set up various contacts according to the various relations between the ensemble of communication;
Set up tree-shaped graph of a relation according to various relations, tree-shaped graph of a relation is made of node, relation and user's three elements, and node is used and concerned icon representation with node icon and the unique sign of name, relation;
Increase the user of the node in the tree-shaped graph of a relation;
Delete the user of the node in the tree-shaped graph of a relation;
Revise the user's of the node in the tree-shaped graph of a relation information;
Increase the node in the tree-shaped graph of a relation;
Delete the node in the tree-shaped graph of a relation;
Revise the information of the node in the tree-shaped graph of a relation.
2. the method for claim 1, comprising the following step:
Click the icon that concerns of tree-shaped graph of a relation, this current child node that concerns that icon links changes display state, and its subordinate's child node shows or become by demonstration and do not show by not showing to become;
Click the node icon in the tree-shaped graph of a relation, the node icon variable color, clicked node becomes present node;
3. the method for claim 1, comprising the following step:
The node visit person fills in personal information, applies to become node users;
Node administration person examines visitor's personal information, ratifies or veto this visitor's application;
Node administration person initiatively adds new node users;
Node administration person initiatively deletes new node users;
Node users is revised the personal information of oneself.
4. as claim 1 or 3 described methods, comprising the following step:
Node administration person is the newly-increased next stage node of this node, and a user who has existed at this node is appointed as the person in charge of newly-increased next stage node;
Subordinate's child node of newly-increased this node of the user applies of node;
Node administration person examines the request of the newly-increased subordinate child node of node users, agrees or veto user's request;
Node administration person is responsible for its downstream site of application deletion to system;
The application that system is responsible for approval or rejection node administration person deletes its downstream site;
Node administration person revises the information of this node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 00133447 CN1353374A (en) | 2000-11-07 | 2000-11-07 | Method based on Internet for organizing and managing information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 00133447 CN1353374A (en) | 2000-11-07 | 2000-11-07 | Method based on Internet for organizing and managing information |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1353374A true CN1353374A (en) | 2002-06-12 |
Family
ID=4595723
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 00133447 Pending CN1353374A (en) | 2000-11-07 | 2000-11-07 | Method based on Internet for organizing and managing information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1353374A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101236550B (en) * | 2007-02-01 | 2010-09-01 | 阿里巴巴集团控股有限公司 | Method and system for processing tree -type structure data |
| CN103324763A (en) * | 2013-07-18 | 2013-09-25 | 北京金和软件股份有限公司 | Presenting method for tree-form data structure of mobile phone terminal |
| CN104331491A (en) * | 2014-11-14 | 2015-02-04 | 北京久其软件股份有限公司 | Method and device for displaying organization |
-
2000
- 2000-11-07 CN CN 00133447 patent/CN1353374A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101236550B (en) * | 2007-02-01 | 2010-09-01 | 阿里巴巴集团控股有限公司 | Method and system for processing tree -type structure data |
| CN103324763A (en) * | 2013-07-18 | 2013-09-25 | 北京金和软件股份有限公司 | Presenting method for tree-form data structure of mobile phone terminal |
| CN104331491A (en) * | 2014-11-14 | 2015-02-04 | 北京久其软件股份有限公司 | Method and device for displaying organization |
| CN104331491B (en) * | 2014-11-14 | 2018-01-05 | 北京久其软件股份有限公司 | The methods of exhibiting and device of a kind of organization |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11341263B2 (en) | Efficient data query and utilization through a semantic storage model | |
| US20210303529A1 (en) | Hierarchical structured data organization system | |
| CN104685467B (en) | It is represented graphically programmed attribute | |
| US9183220B2 (en) | Hierarchical structured data organization system | |
| Cole et al. | Document retrieval for e-mail search and discovery using formal concept analysis | |
| US10042898B2 (en) | Weighted metalabels for enhanced search in hierarchical abstract data organization systems | |
| KR100882582B1 (en) | System and method for research information service based on semantic web | |
| US20120239658A1 (en) | Hierarchical structured abstract data organization system | |
| US8825701B2 (en) | Method and system of management of queries for crowd searching | |
| CN108027818A (en) | Inquiry based on figure | |
| US20040015486A1 (en) | System and method for storing and retrieving data | |
| CN1755675A (en) | System and method for unified navigation | |
| CN105007314B (en) | Towards the big data processing system of magnanimity readers ' reading data | |
| US20150058363A1 (en) | Cloud-based enterprise content management system | |
| US11928083B2 (en) | Determining collaboration recommendations from file path information | |
| Marchenkov et al. | Smart museum of everyday life history in Petrozavodsk State University: Software design and implementation of the semantic layer | |
| Abdel Azez et al. | Optimizing join in HIVE star schema using key/facts indexing | |
| CN1353374A (en) | Method based on Internet for organizing and managing information | |
| Xhafa et al. | Using bi-clustering algorithm for analyzing online users activity in a virtual campus | |
| CN1532718A (en) | Method and device for setting information access autority in computer network | |
| CN112136121A (en) | Recommending secure content | |
| Signore | The semantic web and cultural heritage: Ontologies and technologies help in accessing museum information | |
| US9633028B2 (en) | Collaborative and personalized storage and search in hierarchical abstract data organization systems | |
| Kim | Web-based research collaboration service: Crowd lifelog research case study | |
| Bozzon et al. | Extending search to crowds: A model-driven approach |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| ASS | Succession or assignment of patent right |
Owner name: ZHONG MIN Free format text: FORMER OWNER: MAO YUANQING Effective date: 20021108 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20021108 Applicant after: Zhong Min Applicant before: Mao Yuanqing |
|
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |