CN117371413A - Organization information viewing method and system - Google Patents

Organization information viewing method and system Download PDF

Info

Publication number
CN117371413A
CN117371413A CN202311668673.XA CN202311668673A CN117371413A CN 117371413 A CN117371413 A CN 117371413A CN 202311668673 A CN202311668673 A CN 202311668673A CN 117371413 A CN117371413 A CN 117371413A
Authority
CN
China
Prior art keywords
node
information
column
displaying
child
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202311668673.XA
Other languages
Chinese (zh)
Other versions
CN117371413B (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.)
Shenzhen Do3think Technology Co ltd
Original Assignee
Shenzhen Do3think Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Do3think Technology Co ltd filed Critical Shenzhen Do3think Technology Co ltd
Priority to CN202311668673.XA priority Critical patent/CN117371413B/en
Publication of CN117371413A publication Critical patent/CN117371413A/en
Application granted granted Critical
Publication of CN117371413B publication Critical patent/CN117371413B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

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

Abstract

The application relates to a method and a system for checking organization information, which relate to the technical field of data processing, and the method comprises the following steps: displaying an information form in response to the information viewing instruction; the information table comprises a plurality of rows and a plurality of columns; the columns comprise a first column, a second column, a third column and a fourth column; the first column is used for displaying information identifiers; the second column is used for displaying titles; the third column is used for displaying creator; the fourth column is used for displaying content; different information is sequentially arranged in the rows from near to far according to time; when one piece of information in the information table is checked, searching a father node of the checked information and circularly searching the father node of the father node until the top root node; the child and reference nodes of each node are displayed starting from the topmost root node to generate a strongly associated view of the information being viewed.

Description

Organization information viewing method and system
Technical Field
The present disclosure relates to the field of data processing technologies, and in particular, to a method and a system for viewing organization information.
Background
In current job environments, it is often necessary to write daily newspapers, weekly papers, etc. in order to effectively record and sort information and experience in the job. However, such information tends to be valid only within a specific time frame, and over time, they may become messy, inconvenient to retrieve, and result in an inability to efficiently utilize and share such information.
On the one hand, this information may be visible only to the person or upper level, and thus many useful information cannot be shared by colleagues, resulting in the possibility of re-solving in the face of the same problem. This not only does not effectively utilize the existing information, but may also result in waste of resources.
On the other hand, many companies may use project management tools to improve the efficiency of information sharing, saving, and retrieval. These tools improve our work efficiency to some extent, but each piece of information is attached to a specific item, and each item is independent from the other. This means that once the information is created, it is fixed in place and cannot be freely organized to focus on specific problems. The information of each item is like an island and cannot effectively manage similar or related information. This may result in the need to repeatedly create information or access other items through shared links, which may be cumbersome in practice.
In addition, some companies may use knowledge bases or problem management tools. However, these tools are similar to project management tools in that they tend to focus more on the management of information within a project, ignoring personal relevance, review of problem-related information, and fail to compromise other aspects of information. When a plurality of items are performed simultaneously, we need to switch different items to find the latest information, which may make the operation very troublesome.
Therefore, a new method is needed to effectively manage and utilize this information, improving our work efficiency and quality.
Disclosure of Invention
In order to at least partially solve the above problems, the present application provides a method and a system for viewing organization information.
In a first aspect, the present application provides an organization information viewing method that adopts the following technical scheme.
An organization information viewing method comprising:
displaying an information form in response to the information viewing instruction; the information table comprises a plurality of rows and a plurality of columns; the columns comprise a first column, a second column, a third column and a fourth column; the first column is used for displaying information identifiers; the second column is used for displaying titles; the third column is used for displaying creator; the fourth column is used for displaying content; different information is sequentially arranged in the rows from near to far according to time;
when one piece of information in the information table is checked, searching a father node of the checked information and circularly searching the father node of the father node until the top root node;
the child and reference nodes of each node are displayed starting from the topmost root node to generate a strongly associated view of the information being viewed.
Optionally, the method further comprises: creating a father-son relationship between the child node and the father node; the step of creating a parent-child relationship between a child node and a parent node by the parent node p1 and the child node c1 includes:
s21, judging whether p1 and c1 are located at the same node, if so, jumping to S22; if not, jumping to S23;
s22, disallowing creation;
s23, judging whether a father node exists in the P1; if not, allowing creation; if so, jumping to S24;
s24, acquiring a father node P2 of the P1;
s25, judging whether P2 and C1 are the same node; if yes, not allowing creation; if not, jumping to S26;
s26, p1=p2 is set, and the process goes to S23.
Optionally, the method further comprises: creating a reference relationship between one node and another node; the step of creating a reference relationship between node p1 and node c1 includes: judging whether p1 and c1 are positioned at the same node, if so, not allowing creation; if not, then creation is allowed.
Optionally, the searching the father node of the information to be checked and circularly searching the father node of the father node until the top root node comprises:
acquiring node of the checked information;
judging whether a node has a father node or not; if not, the node is the root node at the top layer; if yes, acquiring a parent node p of the node;
node=p is set and it is re-determined whether or not the node has a parent node.
Optionally, displaying the child node and the reference node of each node from the top-most root node includes:
acquiring a root node root of the checked information;
displaying root information of the root node;
and taking the root node root as a starting display child node and a reference node.
Optionally, in the process of displaying the child node and the reference node with the root node root as the start, the method for displaying the child node and the reference node by one node a includes:
s31, acquiring all child nodes of the node a; jump to S32;
s32, acquiring a next child node c; if there is a child node c, jump to S33; otherwise go to S34;
s33, displaying information of the node c; judging whether the node c is on the reference path or not and the node c is displayed before; if yes, return to S32; if not, recursively displaying the associated node of the node c and then jumping to S32;
s34, acquiring all the reference nodes of the node a; jump to S35;
s35, acquiring a next reference node r; if there is a reference node r, jump to S36; otherwise, exiting;
s36, judging whether the reference node r is displayed before; if yes, displaying information of the node r and jumping to S35; if not, the associated node of the node r is recursively displayed and then the process goes to S35.
Optionally, in the parent-child relationship, the child node has only one parent node; the parent node includes at least one child node.
In a second aspect, the present application provides an organization information viewing method that adopts the following technical scheme.
An organization information viewing system comprising:
a first processing module for: displaying an information form in response to the information viewing instruction; the information table comprises a plurality of rows and a plurality of columns; the columns comprise a first column, a second column, a third column and a fourth column; the first column is used for displaying information identifiers; the second column is used for displaying titles; the third column is used for displaying creator; the fourth column is used for displaying content; different information is sequentially arranged in the rows from near to far according to time;
a second processing module for: when one piece of information in the information table is checked, searching a father node of the checked information and circularly searching the father node of the father node until the top root node;
a third processing module for: the child and reference nodes of each node are displayed starting from the topmost root node to generate a strongly associated view of the information being viewed.
In a third aspect, the present application discloses an electronic device comprising a memory and a processor, the memory having stored thereon a computer program loaded by the processor and performing any of the methods described above.
In a fourth aspect, the present application discloses a computer readable storage medium storing a computer program capable of being loaded by a processor and performing any of the methods described above.
Drawings
FIG. 1 is a flow chart of an organization information viewing method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of an information table according to an embodiment of the present application;
FIG. 3 is a schematic diagram of parent-child relationships and reference relationships according to an embodiment of the present application;
FIG. 4 is a schematic diagram of a parent-child node establishing relationship according to an embodiment of the present application;
FIG. 5 is a schematic diagram of E information referring to the structure of the node composition information in FIGS. 3 and 4;
FIG. 6 is a schematic diagram of F information referring to the structure of the node composition information in FIGS. 3 and 4;
FIG. 7 is a flow chart for determining whether 2 pieces of information are allowed to make up a parent-child node relationship;
FIG. 8 is a flow chart showing the complete association information for a node c;
FIG. 9 is a flow chart showing node association information for a node;
FIG. 10 is a system block diagram of an organization information viewing system according to an embodiment of the present application;
in the figure, 201, a first processing module; 202. a second processing module; 203. a third processing module; 204. a fourth processing module; 205. and a fifth processing module.
Detailed Description
The present application is further described with reference to fig. 1-10 and the specific examples below:
the embodiment of the application discloses an organization information viewing method. Referring to fig. 1 and 2, as an embodiment of an organization information viewing method, an organization information viewing method includes the steps of:
step 101, displaying an information table in response to an information viewing instruction; the information table comprises a plurality of rows and a plurality of columns; the columns comprise a first column, a second column, a third column and a fourth column; the first column is used for displaying information identifiers; the second column is used for displaying titles; the third column is used for displaying creator; the fourth column is used for displaying content; different information is arranged in the rows in sequence from near to far according to time.
Specifically, the information is displayed in the form of a table. At this time, the latest information (newly added or modified) is at the forefront, and the updated information of all the items can be checked in the table in a unified manner without checking in the respective items. And during information retrieval, information meeting the conditions is also checked in the table.
Step 102, when one piece of information in the information table is checked, searching the father node of the checked information and circularly searching the father node of the father node until the top root node.
Step 103, starting from the top-most root node, displaying the child node and the reference node of each node to generate a strongly associated view of the information being viewed.
Specifically, in the application, free organization information is checked into any view, and different focus points are focused; the information in multiple items can be cited with each other, so that repetition is reduced; the information itself can be used as independent information, and all information can be checked on one interface without switching items.
Specifically, in connection with fig. 2 to 9, the information may establish an association relationship. Information A, B is a parent-child relationship, a is the parent node of B, and B is the child node of a. A parent node may have multiple child nodes, but a child node may have only one parent node. As in other project management systems, this relationship is strongly associative, and is used for affiliation, task partitioning, and the like. Information A, G is a reference relationship, a references G information, G is referenced by a. One piece of information may refer to a plurality of pieces of information, and one piece of information may also be referred to by a plurality of pieces of information. This relationship is weakly associated.
When the interface of fig. 2 looks up the relevant information of a piece of information, the father node of the node is searched, the father node of the father node is searched circularly until the father node reaches the top layer, and then the child node and the reference node of each node are displayed from the top layer, so that a strongly-associated view of the piece of information comes out. That is, a piece of information is consistent with a strong association graph of all its parent nodes, or its child nodes. As shown in fig. 3, the strong correlation diagram of the information A, B is consistent, and the display result is fig. 3.
As shown in fig. 5, information E refers to information B, C. As shown, all children of the reference node are also shown. The reference information is displayed from itself without displaying its parent node. Displaying all associated information referenced facilitates viewing information related to the piece of information. In the figure, after the information B can be selected, the strongly associated information is displayed, so that the related information of the referenced information can be queried.
This is a reference to the F information, as in fig. 6. As can be seen by comparing fig. 5, several pieces of information can be combined into different views.
This facilitates the association and viewing of already existing information for different purposes without the need for a strong association of duplicate information to a piece of information.
The copied information has the problems of time waste and energy waste, and the problems of synchronization and the like when the copied information is modified, and the problems can be avoided by referencing the association.
Referring to fig. 7, as a specific embodiment of an organization information viewing method, the method further includes: creating a father-son relationship between the child node and the father node; the step of creating a parent-child relationship between a child node and a parent node by the parent node p1 and the child node c1 includes:
s21, judging whether p1 and c1 are located at the same node, if so, jumping to S22; if not, jumping to S23;
s22, disallowing creation;
s23, judging whether a father node exists in the P1; if not, allowing creation; if so, jumping to S24;
s24, acquiring a father node P2 of the P1;
s25, judging whether P2 and C1 are the same node; if yes, not allowing creation; if not, jumping to S26;
s26, p1=p2 is set, and the process goes to S23.
Specifically, when creating an association, the parent-child association is strongly associated, requiring that all strongly associated information be displayed in one view. It is therefore necessary to judge that the hint cannot form a ring relationship when creating the parent-child relationship.
As a specific embodiment of the method for viewing organization information, the method further comprises: creating a reference relationship between one node and another node; the step of creating a reference relationship between node p1 and node c1 includes: judging whether p1 and c1 are positioned at the same node, if so, not allowing creation; if not, then creation is allowed.
Specifically, the reference relationship is weakly associated, any node can reference a non-self node, so that only 2 nodes are judged to be not the same node when being created, whether the ring relationship is formed is not judged, and the ring relationship is cut off and displayed only when being displayed.
As a specific implementation mode of the organization information viewing method, the searching the father node of the information to be viewed and circularly searching the father node of the father node until the top-most root node comprises the following steps:
acquiring node of the checked information;
judging whether a node has a father node or not; if not, the node is the root node at the top layer; if yes, acquiring a parent node p of the node;
node=p is set and it is re-determined whether or not the node has a parent node.
Referring to fig. 8, as one embodiment of an organization information viewing method, a child node and a reference node of each node are displayed starting from a topmost root node, including:
acquiring a root node root of the checked information;
displaying root information of the root node;
and taking the root node root as a starting display child node and a reference node.
Specifically, if all the information is displayed in an independent manner, as shown in fig. 2, all the information that is found may be sequentially displayed in the table.
Referring to fig. 9, as one embodiment of an organization information viewing method, in a process of displaying child nodes and reference nodes using a root node as a start, a method for displaying child nodes and reference nodes by a node a includes:
s31, acquiring all child nodes of the node a; jump to S32;
s32, acquiring a next child node c; if there is a child node c, jump to S33; otherwise go to S34;
s33, displaying information of the node c; judging whether the node c is on the reference path or not and the node c is displayed before; if yes, return to S32; if not, recursively displaying the associated node of the node c and then jumping to S32;
s34, acquiring all the reference nodes of the node a; jump to S35;
s35, acquiring a next reference node r; if there is a reference node r, jump to S36; otherwise, exiting;
s36, judging whether the reference node r is displayed before; if yes, displaying information of the node r and jumping to S35; if not, the associated node of the node r is recursively displayed and then the process goes to S35.
Specifically, a procedure of displaying information related to information to be displayed is as follows: firstly, acquiring a root node of information to be displayed; displaying root information of the root node; the child node and the reference node of the root node are displayed by taking the root node as an initial point; the parameter is false when the workflow is called, because the root node is not a reference node or an associated node of the reference node. (1) If the node does not have a father node, the node is the root node and returns to the node; (2) The node has a father node, and the father node p of the node is obtained; (3) set node=p; execution continues from (1).
As shown in fig. 9, this is a flow of displaying one node association information. The associated node of each node also recursively invokes the flow to complete the display of the associated information of the node. InRef indicates whether this node is on the reference path. The reference node and its associated nodes are all considered to be on the reference path. In the case of inref= =false, this indicates that the node is on a strongly correlated path, and the information at this time is not displayed with truncation. When inref= first parameter value true, it indicates that the node is on the weak association path, if the node has been displayed before, the node is displayed and then the association node is not displayed, so that the problem that the recursion cannot be ended when the parent-child association and the reference association form a ring can be prevented. So that as much of the associated information of a certain node as possible is displayed. The specific flow is as follows:
(1) Acquiring all child nodes of the node;
(2) Traversing the child node to obtain the next child node c;
(3) If child node c is already displayed in the view, f1=first parameter value true; otherwise f1=false;
(4) Displaying the child node c;
(5) If child node c is in the reference path and f1 is the first parameter value true, continuing execution from (2); if annular association exists on the reference path, the step can be completed to cut off;
(6) Recursively displaying the associated node of the child node c, wherein the InRef parameter value transmitted by the showRelation is the value InRef of whether the path of the child node c is a reference path or not;
(7) After the child node of the node is traversed, acquiring a reference node of the node;
(8) Traversing the reference node to acquire the next reference node r;
(9) F2=first parameter value true if the reference node r is already in the displayed view; otherwise f2=false;
(10) Displaying a reference node r;
(11) If f2 is the first parameter value true, continuing execution from (8); if node r has already been displayed, then the associated node of node r is not displayed. Because node r is now the reference node, it is on the reference path. If annular association exists on the reference path, the step can be completed to cut off;
(12) The associated node referencing node r is recursively displayed, at which point the showRelation incoming InRef parameter value is the first parameter value true, since node r is the referencing node, and the nodes from which it begins are all on the referencing path.
As one embodiment of an organization information viewing method, in the parent-child relationship, the child node has only one parent node; the parent node includes at least one child node.
The embodiment of the application also discloses an organization information viewing system. One embodiment of an organization information viewing system includes:
a first processing module 201, configured to: displaying an information form in response to the information viewing instruction; the information table comprises a plurality of rows and a plurality of columns; the columns comprise a first column, a second column, a third column and a fourth column; the first column is used for displaying information identifiers; the second column is used for displaying titles; the third column is used for displaying creator; the fourth column is used for displaying content; different information is sequentially arranged in the rows from near to far according to time;
a second processing module 202 for: when one piece of information in the information table is checked, searching a father node of the checked information and circularly searching the father node of the father node until the top root node;
a third processing module 203, configured to: the child and reference nodes of each node are displayed starting from the topmost root node to generate a strongly associated view of the information being viewed.
As one embodiment of an organization information viewing system, the system further comprises: a fourth processing module 204, the fourth processing module 204 being configured to: creating a father-son relationship between the child node and the father node; the step of creating a parent-child relationship between a child node and a parent node by the parent node p1 and the child node c1 includes:
s21, judging whether p1 and c1 are located at the same node, if so, jumping to S22; if not, jumping to S23;
s22, disallowing creation;
s23, judging whether a father node exists in the P1; if not, allowing creation; if so, jumping to S24;
s24, acquiring a father node P2 of the P1;
s25, judging whether P2 and C1 are the same node; if yes, not allowing creation; if not, jumping to S26;
s26, p1=p2 is set, and the process goes to S23.
As one embodiment of an organization information viewing system, the system further comprises: a fifth processing module 205, the fifth processing module 205 being configured to: creating a reference relationship between one node and another node; the step of creating a reference relationship between node p1 and node c1 includes: judging whether p1 and c1 are positioned at the same node, if so, not allowing creation; if not, then creation is allowed.
As one embodiment of an organization information viewing system, the searching the father node of the information to be viewed and circularly searching the father node of the father node until the top root node comprises:
acquiring node of the checked information;
judging whether a node has a father node or not; if not, the node is the root node at the top layer; if yes, acquiring a parent node p of the node;
node=p is set and it is re-determined whether or not the node has a parent node.
As one embodiment of an organization information viewing system, displaying child nodes and reference nodes of each node starting from a topmost root node includes:
acquiring a root node root of the checked information;
displaying root information of the root node;
and taking the root node root as a starting display child node and a reference node.
As one implementation mode of the organization information viewing system, in the process of displaying the child node and the reference node by taking the root node as the start, the method for displaying the child node and the reference node by one node a comprises the following steps:
s31, acquiring all child nodes of the node a; judging whether all child nodes are traversed or not in the acquisition process; if not, jumping to S32; if yes, jumping to S33;
s32, acquiring a next child node c;
s33, acquiring all the reference nodes of the node a; judging whether all the reference nodes are traversed or not in the acquisition process; if yes, jumping out; if not, jumping to S34;
s34, acquiring all the reference nodes of the node a;
s35, judging whether the reference node r is displayed before; if yes, displaying information of the node r and jumping to S33; if not, recursively displaying the associated node of the node r.
As one embodiment of an organization information viewing system, in the parent-child relationship, the child node has only one parent node; the parent node includes at least one child node.
The embodiment of the application also discloses electronic equipment.
Specifically, the apparatus includes a memory and a processor, and the memory stores thereon a computer program that can be loaded by the processor and execute any one of the organization information viewing methods described above.
The embodiment of the application also discloses a computer readable storage medium. Specifically, the computer-readable storage medium stores a computer program that can be loaded by a processor and that executes any one of the organization information viewing methods described above, the computer-readable storage medium including, for example: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
It should be noted that: the above embodiments are only for illustrating the present application and not for limiting the technical solutions described in the present application, and although the present application has been described in detail with reference to the above embodiments, it should be understood by those skilled in the art that the present application may be modified or substituted by equivalent ones, and all technical solutions and modifications thereof without departing from the spirit and scope of the present application should be covered in the scope of the claims of the present application.

Claims (10)

1. A method for viewing organization information, comprising:
displaying an information form in response to the information viewing instruction; the information table comprises a plurality of rows and a plurality of columns; the columns comprise a first column, a second column, a third column and a fourth column; the first column is used for displaying information identifiers; the second column is used for displaying titles; the third column is used for displaying creator; the fourth column is used for displaying content; different information is sequentially arranged in the rows from near to far according to time;
when one piece of information in the information table is checked, searching a father node of the checked information and circularly searching the father node of the father node until the top root node;
the child and reference nodes of each node are displayed starting from the topmost root node to generate a strongly associated view of the information being viewed.
2. The method of organizing information viewing according to claim 1, wherein the method further comprises: creating a father-son relationship between the child node and the father node; the step of creating a parent-child relationship between a child node and a parent node by the parent node p1 and the child node c1 includes:
s21, judging whether p1 and c1 are located at the same node, if so, jumping to S22; if not, jumping to S23;
s22, disallowing creation;
s23, judging whether a father node exists in the P1; if not, allowing creation; if so, jumping to S24;
s24, acquiring a father node P2 of the P1;
s25, judging whether P2 and C1 are the same node; if yes, not allowing creation; if not, jumping to S26;
s26, p1=p2 is set, and the process goes to S23.
3. The method of organizing information viewing according to claim 2, wherein the method further comprises: creating a reference relationship between one node and another node; the step of creating a reference relationship between node p1 and node c1 includes: judging whether p1 and c1 are positioned at the same node, if so, not allowing creation; if not, then creation is allowed.
4. A method of viewing organization information according to claim 3 wherein said finding a parent node of said information being viewed and looping through the parent nodes of the parent nodes to the topmost root node comprises:
acquiring node of the checked information;
judging whether a node has a father node or not; if not, the node is the root node at the top layer; if yes, acquiring a parent node p of the node;
node=p is set and it is re-determined whether or not the node has a parent node.
5. The method of organizing information viewing according to claim 4, wherein displaying child nodes and reference nodes of each node starting from a topmost root node comprises:
acquiring a root node root of the checked information;
displaying root information of the root node;
and taking the root node root as a starting display child node and a reference node.
6. The method for viewing organization information according to claim 5, wherein in the process of displaying the child node and the reference node with the root node root as the start, the method for displaying the child node and the reference node by one node a comprises:
s31, acquiring all child nodes of the node a; jump to S32;
s32, acquiring a next child node c; if there is a child node c, jump to S33; otherwise go to S34;
s33, displaying information of the node c; judging whether the node c is on the reference path or not and the node c is displayed before; if yes, return to S32; if not, recursively displaying the associated node of the node c and then jumping to S32;
s34, acquiring all the reference nodes of the node a; jump to S35;
s35, acquiring a next reference node r; if there is a reference node r, jump to S36; otherwise, exiting;
s36, judging whether the reference node r is displayed before; if yes, displaying information of the node r and jumping to S35; if not, the associated node of the node r is recursively displayed and then the process goes to S35.
7. The method of claim 6, wherein in said parent-child relationship, said child node has only one parent node; the parent node includes at least one child node.
8. An organization information viewing system, comprising:
a first processing module for: displaying an information form in response to the information viewing instruction; the information table comprises a plurality of rows and a plurality of columns; the columns comprise a first column, a second column, a third column and a fourth column; the first column is used for displaying information identifiers; the second column is used for displaying titles; the third column is used for displaying creator; the fourth column is used for displaying content; different information is sequentially arranged in the rows from near to far according to time;
a second processing module for: when one piece of information in the information table is checked, searching a father node of the checked information and circularly searching the father node of the father node until the top root node;
a third processing module for: the child and reference nodes of each node are displayed starting from the topmost root node to generate a strongly associated view of the information being viewed.
9. An electronic device comprising a memory and a processor, the memory having stored thereon a computer program to be loaded by the processor and to perform the method according to any of claims 1 to 7.
10. A computer readable storage medium, characterized in that a computer program is stored which can be loaded by a processor and which performs the method according to any of claims 1 to 7.
CN202311668673.XA 2023-12-07 2023-12-07 Organization information viewing method and system Active CN117371413B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311668673.XA CN117371413B (en) 2023-12-07 2023-12-07 Organization information viewing method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311668673.XA CN117371413B (en) 2023-12-07 2023-12-07 Organization information viewing method and system

Publications (2)

Publication Number Publication Date
CN117371413A true CN117371413A (en) 2024-01-09
CN117371413B CN117371413B (en) 2024-03-12

Family

ID=89402567

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311668673.XA Active CN117371413B (en) 2023-12-07 2023-12-07 Organization information viewing method and system

Country Status (1)

Country Link
CN (1) CN117371413B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090138500A1 (en) * 2007-10-12 2009-05-28 Yuan Zhiqiang Method of compact display combined with property-table-view for a complex relational data structure
CN114816408A (en) * 2022-05-31 2022-07-29 珠海金山数字网络科技有限公司 Information processing method and device
CN116010414A (en) * 2022-12-29 2023-04-25 苏州万店掌网络科技有限公司 Data storage method, device, equipment and storage medium

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090138500A1 (en) * 2007-10-12 2009-05-28 Yuan Zhiqiang Method of compact display combined with property-table-view for a complex relational data structure
CN114816408A (en) * 2022-05-31 2022-07-29 珠海金山数字网络科技有限公司 Information processing method and device
CN116010414A (en) * 2022-12-29 2023-04-25 苏州万店掌网络科技有限公司 Data storage method, device, equipment and storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
网页发布者: "前端树形Tree数据结构使用", pages 1 - 6, Retrieved from the Internet <URL:https://juejin.cn/post/7267887676913107005> *

Also Published As

Publication number Publication date
CN117371413B (en) 2024-03-12

Similar Documents

Publication Publication Date Title
CN108345485B (en) Identification method and device for interface view
US7769752B1 (en) Method and system for updating display of a hierarchy of categories for a document repository
CA2477733A1 (en) Efficiently storing indented threads in a threaded discussion application
US20050076018A1 (en) Sorting result buffer
CN107145538B (en) Table data query method, device and system
CN105373541A (en) Processing method and system for data operation request of database
WO2010008488A1 (en) Method and system for dynamically generating a search result
CN103942205A (en) Method, device and system for storing and reading catalogue index
CN117371413B (en) Organization information viewing method and system
BR102013016924A2 (en) Method and apparatus for prioritizing metadata
KR100899930B1 (en) System and Method for Generating Relating Data Class
CN116150093B (en) Method for realizing object storage enumeration of objects and electronic equipment
CN107239568A (en) Distributed index implementation method and device
CN110471764A (en) A kind of processing method and processing device of memory cleaning
CN110019357B (en) Database query script generation method and device
CN112100247B (en) Method and system for querying data by using ElasticSearch
CN115658270A (en) Workflow execution method, device, equipment and storage medium of visual system
CN112579456B (en) Web automatic testing method and device
US9020995B2 (en) Hybrid relational, directory, and content query facility
JP2005234945A (en) Concurrent execution control method and device
CN106775629B (en) Search file generation method and device
CN116340270B (en) Concurrent traversal enumeration method, device, equipment and storage medium
CN114428776B (en) Index partition management method and system for time series data
RU2006105196A (en) SYSTEMS AND METHODS FOR PAIRING APPLIED PROGRAMS WITH A STORAGE PLATFORM BASED ON ARTICLES
CN114238241B (en) Metadata processing method and computer system for financial data

Legal Events

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