JP2002328829A - Data structure, server, information processor, control method of server, control method, program of information processor and computer readable recording medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To reflect changes on all pieces of related information even when link relation and entity of information itself between pieces of information are changed and to display common resources on a server on an information processor by tree so that a plurality of linked information are easily traced back from both directions of master and slave. SOLUTION: This data structure is characterized by structure that data structure to be stored in a storage device 31 on a server machine 3 capable of managing the shared resources by first layer structure to manage the link relation among the optional number of pieces of node information capable of being optionally linked with one another, second layer structure to manage whereabouts of the entity corresponding to the node information and third layer structure to manage the entity is referred based on client machines 1, 2, display data to display the data structure of the shared resources is generated by the server machine, the display data to be generated in the server machine 3 is acquired by the client machines 1, 2 and displays it by tree.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data structure in which a server device having a specific data structure and information processing communicate with each other via a predetermined communication medium to perform data processing, a server device, an information processing device, and control of the server device. The present invention relates to a method, a control method for an information processing apparatus, a program, and a computer-readable recording medium.

[0002]

2. Description of the Related Art Conventionally, in a network system in which a plurality of clients and a server can communicate via a predetermined protocol via a network, Japanese Patent Laid-Open Publication No. 20-200195 discloses an example of a system for managing a desired file as a shared file.
No. 00-268041 is disclosed.

More specifically, for example, a file utility capable of displaying a plurality of classification systems of shared document files when classifying and managing shared files by a directory uniquely determined as a classification category of a document, according to the classification system. The user ID corresponding to the classified viewpoint ID is received from the server, and the hierarchical relationship between the file ID and the classified ID is assembled and can be displayed on the display device on the client side.

Further, in the above-described system, as a user interface for searching for a file, for example, as disclosed in Japanese Patent Application Laid-Open No. 06-035657, when a browser display with a tree structure of a hypertext is performed, In addition, processing for displaying the real icon corresponding to the designated reference node together with the lower-level structure in the browser display area is performed.

[0005]

However, when a client searches for a shared file resource managed on a server via a network, not only does the file exist as an entity on the server, but the entity does not In some cases, the file exists on another server device on the network.
It is managed by RL.

Conventionally, when it is desired to register one piece of information in a plurality of different categories, it has been conventionally dealt with by duplicating the information or creating an information shortcut and registering the information in each category.

[0007] However, in the countermeasure of creating a copy of information and registering it in each category, since information cannot be centrally managed, when changing the information, all copies must be changed, which is inconvenient for the user. And the existence of multiple copies of information hinders effective use of memory resources. On the other hand, in the measure of creating a shortcut of information and registering it in each category, when viewed from each category, the appearance and operability of the original information and the shortcut are different, which is inconvenient for the user.

In such a shared file environment, simply managing file resources in a so-called one-way (one direction from upper to lower) hierarchical structure (for example, a simple tree structure) complicates a user's file search process. It has been pointed out that a file intended by a user (a file itself and a file related to the file (a file to be linked)) cannot be freely and quickly searched. .

More specifically, since the above-mentioned shortcuts and hyperlinks of WWW which are currently widely used are one-way links, when file management is performed using shortcuts and hyperlinks, arbitrary categories and information of arbitrary categories and information can be obtained. Although it is possible to search the hierarchy from the parent to the child, it is not possible to search from the child to the parent.

Also, when managing files or the like as a hierarchical structure, a tree can be displayed from the parent toward the child, but the structure of the prenatal information cannot be displayed as a tree from the child to the parent. Also, based on a certain category or information, the relevance of a certain category or information cannot be bird's-eye view, and a search that emphasizes the relevance of information cannot be performed.

In the file search process, the user interface for visually and clearly indicating the storage location of the actual file to the user is not an individual user interface but an Internet search that can be operated by a so-called personal computer. Search processing by browsing software called a frequently used browser is required.

However, in the above-described management of the shared file resource, the structure of the shared file resource that the user wants to search cannot be dynamically changed, and the deeper the hierarchy, the more the shared file to be searched becomes. Before arriving, it is necessary to endlessly perform complicated click operations while looking at the browser display, and it has been pointed out that the shared file intended by the user cannot be searched efficiently, easily, and clearly. ing.

The present invention has been made in order to solve the above-mentioned problems, and a first layer structure in which a server device manages a link relationship of an arbitrary number of node information that can be arbitrarily linked, A second layer structure for managing the location of the entity corresponding to the node information of
Generating a display data for displaying the data structure of the shared resource by referring to the data structure stored in the storage means capable of managing the shared resource with the layer structure of the information based on the data acquisition request from the information processing apparatus; Transferring the generated display data to the information processing device, the information processing device acquires display data for displaying a data structure of the shared resource generated in the server device, and displays the acquired display data. By displaying the data structure of the shared resource in a tree on the display means based on the data, even if the link relationship between the information or the entity of the information itself is changed, all information associated with the change is displayed. Server device so that a plurality of linked information can be easily traced from either the parent or the child. STRUCTURE, SERVER DEVICE, INFORMATION PROCESSING DEVICE, CONTROL METHOD OF SERVER DEVICE, CONTROL METHOD OF INFORMATION PROCESSING DEVICE, AND CONTROL METHOD It is an object to provide a program and a computer-readable recording medium.

[0014]

According to a first aspect of the present invention, there is provided a first layer structure for managing a link relation of an arbitrary number of node information (nodes NA to NF shown in FIG. 5) which can be arbitrarily linked. (A network layer L1 shown in FIG. 5) and a second layer structure (information capsule layer L2 shown in FIG. 5) for managing the location of an entity corresponding to the arbitrary node information.
And the entity (entities ETYA, D,
G) for managing the third layer structure (entity layer L3 shown in FIG. 5).

A second invention according to the present invention is that, out of the arbitrary number of node information, two linked node information are bidirectionally linked.

In a third aspect according to the present invention, the node information corresponds to one of information having a substance and a category of the information.

In a fourth aspect according to the present invention, the second layer structure manages attribute information of the node information.

According to a fifth aspect of the present invention, the attribute information includes information (information type) indicating whether the node information corresponds to the information or the category.

[0019] In a sixth aspect of the present invention, the attribute information includes information (information summary /
Memo).

According to a seventh aspect of the present invention, the attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and a registration date and time of the node information in the first layer structure. Registrant information.

According to an eighth aspect of the present invention, the entity managed by the third layer structure can be arranged on a network.

According to a ninth aspect of the present invention, there is provided a server apparatus (the server machine 3 shown in FIG. 1) capable of communicating with a plurality of information processing apparatuses (client machines 1 and 2 shown in FIG. 1) via a predetermined communication medium. ), A first layer structure (network layer L1 shown in FIG. 5) for managing a link relationship of an arbitrary number of node information (nodes NA to NF shown in FIG. 5) which can be arbitrarily linked, and the arbitrary node information A second layer structure (information capsule layer L2 shown in FIG. 5) that manages the location of the entity corresponding to the above, and a third layer structure (FIG. 5) that manages the entity (the entities ETYA, D, and G shown in FIG. 5) Storage means (storage device 31 shown in FIG. 1) capable of managing shared resources with the entity layer L3 shown in FIG. 5;
Generating means for generating display data for displaying the data structure of the shared resource with reference to a data structure stored in the storage means based on a data acquisition request from the information processing apparatus (a file shown in FIG. 3) Management program 405
3) and transfer means (FIG. 3) for transferring the display data generated by the generation means to the information processing apparatus.
Transfer processing function of the file management program 405 shown in FIG.
And it has a door.

[0023] In a tenth aspect according to the present invention, the generation unit refers to a data structure stored in the storage unit based on a data acquisition request from the information processing apparatus, and the data structure of the shared resource. Is generated as a display data (data representation by XML in FIG. 23) for tree-displaying.

In an eleventh aspect according to the present invention, the generation means focuses on arbitrary viewpoint information added to the data acquisition request based on the data acquisition request from the information processing apparatus, and A display for retrieving the node information using information as a reference (“base point information” in parameters transferred from the client machines 1 and 2 to the server machine 3 shown in FIG. 1) and displaying the data structure of the shared resource in a tree view Generate data.

According to a twelfth aspect of the present invention, there is provided a registration unit for automatically registering a resource acquired from the information processing apparatus as a shared resource in a storage unit according to the first to third layer structures (the file management unit shown in FIG. 3). (A registration processing function of the program 405).

According to a thirteenth aspect of the present invention, there is provided the updating means for updating the first layer structure of the storage means based on a node deletion instruction obtained from the information processing apparatus (the file management program 405 shown in FIG. 3). The updating means updates the link information corresponding to the node instructed to be deleted and cancels the link relationship with other node information.

According to a fourteenth aspect of the present invention, the display data generated by the generation means is represented by a structured format.

According to a fifteenth aspect of the present invention, the structured format includes XML.

According to a sixteenth aspect of the present invention, among the arbitrary number of node information, two linked node information are:
They are linked in both directions.

According to a seventeenth aspect of the present invention, the node information corresponds to one of information having a substance and a category of the information.

In an eighteenth aspect according to the present invention, the second layer structure manages attribute information of the node information.

According to a nineteenth aspect of the present invention, the attribute information includes information indicating whether the node information corresponds to the information or the category.

According to a twentieth aspect of the present invention, the attribute information includes information that summarizes the entity or category.

[0034] In a twenty-first aspect of the present invention, the attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and a registration date and time of the node information in the first layer structure. Registrant information.

According to a twenty-second aspect of the present invention, the entity managed by the third layer structure is managed so as to be referred to on a network accessible by the server device.

According to a twenty-third aspect of the present invention, an information processing apparatus (client machines 1 and 2 shown in FIG. 1) capable of communicating via a predetermined communication medium with a server capable of managing shared resources with a specific data structure. An acquisition unit (acquisition processing function of the client module 603 shown in FIG. 4) for acquiring display data for displaying a data structure of the shared resource generated in the server device based on a data acquisition request; Display control means (display control processing function of the client module 603 shown in FIG. 4) for displaying a tree structure of the data structure of the shared resource on the display means based on the display data acquired by the means.

In a twenty-fourth aspect according to the present invention, the data acquisition request includes information indicating arbitrary node information in a shared resource managed by the server device in a specific data structure.

According to a twenty-fifth aspect of the present invention, the display control means issues a data acquisition request to the server device again from the viewpoint of information specified in a data structure displayed in a tree on the display means. is there.

According to a twenty-sixth aspect of the present invention, there is provided an instruction means (registration instruction function of the client module 603 shown in FIG. 4) for instructing the server device to register resources managed in the information processing apparatus. And a transfer means (a transfer processing function of the client module 603 shown in FIG. 4) for transferring the resource registered and designated as a shared resource to the server device.

According to a twenty-seventh aspect of the present invention, the display data obtained from the server device by the obtaining means is expressed in a structured format.

According to a twenty-eighth aspect of the present invention, the structured format includes XML.

According to a twenty-ninth aspect of the present invention, the specific data structure corresponds to a first layer structure for managing a link relationship of an arbitrary number of node information that can be arbitrarily linked, and the arbitrary node information. It has a second layer structure for managing the location of the entity and a third layer structure for managing the entity.

According to a thirtieth aspect of the present invention, among the arbitrary number of node information, two linked node information are:
They are linked in both directions.

[0044] In a thirty-first aspect of the present invention, the node information corresponds to either information having a substance or a category of the information.

In a thirty-second aspect of the present invention, the second layer structure manages attribute information of the node information.

[0046] In a thirty-third aspect of the present invention, the attribute information includes information indicating whether the node information corresponds to the information or the category.

[0047] In a thirty-fourth aspect of the present invention, the attribute information includes information summarizing the entity or category.

According to a thirty-fifth aspect of the present invention, the attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and a registration date and time of the node information in the first layer structure. Registrant information.

According to a thirty-sixth aspect of the present invention, the entity managed by the third layer structure is managed so as to be referred to on a network accessible by the server device.

According to a thirty-seventh aspect of the present invention, there is provided the first aspect of the present invention, which is capable of communicating with a plurality of information processing apparatuses via a predetermined communication medium and managing a link relation of an arbitrary number of arbitrarily linkable node information. A server apparatus having storage means capable of managing shared resources with a layer structure, a second layer structure for managing the location of an entity corresponding to the arbitrary node information, and a third layer structure for managing the entity. In the control method,
A generation step of generating display data for displaying the data structure of the shared resource with reference to a data structure stored in the storage unit based on a data acquisition request from the information processing apparatus (step S11 in FIG. 19) To S14, FIG.
Steps S21 to S31) and a transfer step of transferring the generated display data to the information processing apparatus (step S15 in FIG. 19).

According to a thirty-eighth aspect of the present invention, in the generating step, the data structure of the shared resource is referred to by referring to a data structure stored in the storage means based on a data acquisition request from the information processing device. To generate display data for displaying a tree.

According to a thirty-ninth aspect of the present invention, in the generation step, based on a data acquisition request from the information processing device, the viewpoint is generated by focusing on arbitrary viewpoint information added to the data acquisition request. The node information is searched based on information to generate display data for displaying a tree structure of the data structure of the shared resource.

A fortieth invention according to the present invention has a registration step (not shown) of automatically registering a resource acquired from said information processing apparatus as a shared resource in a storage means according to said first to third layer structures. Things.

A forty-first invention according to the present invention has an updating step (not shown updating step) of updating the first layer structure of said storage means based on a node deletion instruction obtained from said information processing apparatus. In the updating step, the link information corresponding to the node instructed to be deleted is updated to cancel the link relation with other node information.

According to a forty-second aspect of the present invention, the display data generated in the generation step is expressed in a structured format.

According to a forty-third aspect of the present invention, the structured format includes XML.

According to a forty-fourth aspect of the present invention, among the arbitrary number of node information, two linked node information are:
They are linked in both directions.

According to a forty-fifth aspect of the present invention, the node information corresponds to one of information having a substance and a category of the information.

[0059] In a forty-sixth aspect of the present invention, the second layer structure manages attribute information of the node information.

According to a forty-seventh aspect of the present invention, the attribute information includes information indicating whether the node information corresponds to the information or the category.

According to a forty-eighth aspect of the present invention, the attribute information includes information summarizing the entity or category.

[0062] In a forty-ninth aspect of the present invention, the attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and a registration date and time of the node information in the first layer structure. Registrant information.

According to a fiftieth aspect of the present invention, the entity managed by the third layer structure is managed so that it can be referred to on a network accessible by the server device.

A fifty-first invention according to the present invention relates to a control method of an information processing apparatus capable of communicating via a predetermined communication medium with a server apparatus capable of managing shared resources with a specific data structure, Acquisition step of acquiring display data for displaying the data structure of the shared resource generated in the server device (steps S4 and S4 in FIG. 18)
5, steps S43 and S44 in FIG. 21, and a display step of displaying the data structure of the shared resource in a tree on the display means based on the acquired display data (step S43 in FIG. 18).
6, S7, and steps S45 and S46 in FIG. 21).

[0065] In a fifty-second invention according to the present invention, the data acquisition request includes information designating arbitrary node information in a shared resource managed by the server device in a specific data structure.

In a fifty-third invention according to the present invention, in the display step, a data acquisition request is issued to the server again from the viewpoint of information specified in a data structure displayed in a tree on the display means. .

According to a fifty-fourth aspect of the present invention, there is provided an instruction step (instruction step not shown) for instructing the server device to register a resource managed in the information processing apparatus, and a resource registered and instructed in the instruction step. And a transfer step (a transfer step (not shown)) for transferring to the server device as a shared resource.

According to a fifty-fifth aspect of the present invention, the display data obtained from the server device in the obtaining step is expressed in a structured format.

[0069] In a fifty-sixth aspect of the present invention, the structured format includes XML.

[0070] In a fifty-seventh aspect of the present invention, the specific data structure corresponds to a first layer structure for managing a link relation of an arbitrary number of node information that can be arbitrarily linked, and the arbitrary node information. It has a second layer structure for managing the location of the entity and a third layer structure for managing the entity.

According to a fifty-eighth aspect of the present invention, among the arbitrary number of node information, two linked node information are:
They are linked in both directions.

According to a fifty-ninth aspect of the present invention, the node information corresponds to one of information having a substance and a category of the information.

In a sixtieth aspect of the present invention, the second layer structure manages attribute information of the node information.

[0074] In a sixty-first aspect of the present invention, the attribute information includes information indicating whether the node information corresponds to the information or the category.

[0075] In a 62nd invention according to the present invention, said attribute information includes information summarizing said entity or category.

In a sixty-third aspect of the present invention, the attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and a registration date and time of the node information in the first layer structure. Registrant information.

According to a sixty-fourth aspect of the present invention, the entity managed by the third layer structure is managed so that it can be referred to on a network accessible by the server device.

According to a sixty-fifth aspect of the present invention, there is provided a first aspect of the present invention, which is capable of communicating with a plurality of information processing apparatuses via a predetermined communication medium and managing a link relation of an arbitrary number of node information that can be arbitrarily linked. A server device having storage means capable of managing shared resources with a layer structure, a second layer structure for managing the location of an entity corresponding to the arbitrary node information, and a third layer structure for managing the entity. Generating a display data for displaying a data structure of the shared resource with reference to a data structure stored in the storage unit based on a data acquisition request from the information processing apparatus (FIG. 1)
9, steps S11 to S14, and step S21 in FIG.
To S31) and a transfer step (step S15 in FIG. 19) of transferring the generated display data to the information processing apparatus.

In a sixty-sixth aspect according to the present invention, in the generating step, the data structure of the shared resource is referred to by referring to a data structure stored in the storage means based on a data acquisition request from the information processing device. To generate display data for displaying a tree.

In a sixty-sixth aspect according to the present invention, in the generating step, based on a data acquisition request from the information processing apparatus, the viewpoint is generated by focusing on arbitrary viewpoint information added to the data acquisition request. The node information is searched based on information to generate display data for displaying a tree structure of the data structure of the shared resource.

A sixty-eighth invention according to the present invention has a registration step (step not shown) of automatically registering a resource acquired from the information processing apparatus as a shared resource in a storage unit in accordance with the first to third layer structures. Things.

A sixty-sixth invention according to the present invention has an updating step (an unillustrated updating step) of updating a first layer structure of said storage means based on a node deletion instruction obtained from said information processing apparatus. In the updating step, the link information corresponding to the node instructed to be deleted is updated to cancel the link relation with other node information.

According to a seventieth aspect of the present invention, the display data generated in the generation step is expressed in a structured format.

[0084] In a seventy-first aspect of the present invention, the structured format includes XML.

According to a seventy-second aspect of the present invention, among the arbitrary number of node information, two linked node information are
They are linked in both directions.

[0086] In a seventy-third aspect of the present invention, the node information corresponds to one of information having a substance and a category of the information.

[0087] In a seventy-fourth aspect of the present invention, the second layer structure manages attribute information of the node information.

[0088] In a seventy-fifth aspect of the present invention, the attribute information includes information indicating whether the node information corresponds to the information or the category.

[0089] In a seventy-sixth aspect of the present invention, the attribute information includes information summarizing the entity or category.

In a seventy-seventh aspect of the present invention, the attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and a registration date and time of the node information in the first layer structure. Registrant information.

According to a seventy-eighth aspect of the present invention, the entity managed by the third layer structure is managed so that it can be referred to on a network accessible by the server device.

A seventy-ninth invention according to the present invention is directed to an information processing apparatus capable of communicating via a predetermined communication medium with a server apparatus capable of managing shared resources in a specific data structure, based on a data acquisition request. Acquisition steps (steps S4, S5 in FIG. 18, steps S43, S44 in FIG. 18) for acquiring display data for displaying the data structure of the shared resources generated in The display means executes a display step (steps S6, S7 in FIG. 18, steps S45, S46 in FIG. 21) of displaying a tree structure of the data structure of the shared resource.

[0093] In an eightyth aspect of the present invention, the data acquisition request includes information designating arbitrary node information in a shared resource managed by the server device in a specific data structure.

[0094] In an eighty-first aspect of the present invention, in the display step, a data acquisition request is issued to the server device again from the viewpoint of information specified in a data structure displayed in a tree on the display means. .

According to an eighty-second aspect of the present invention, there is provided an instruction step (instruction step, not shown) for instructing the server device to register resources managed in the information processing apparatus, and a resource registered and instructed in the instruction step. And a transfer step (a transfer step (not shown)) for transferring to the server device as a shared resource.

[0096] In an eighty-third aspect of the present invention, the display data obtained from the server device in the obtaining step is expressed in a structured format.

[0097] In an eighty-fourth aspect of the present invention, the structured format includes XML.

[0098] In an eighty-fifth aspect of the present invention, the specific data structure corresponds to a first layer structure for managing a link relationship of an arbitrary number of arbitrarily linkable node information, and the arbitrary node information. It has a second layer structure for managing the location of the entity and a third layer structure for managing the entity.

An eighty-sixth invention according to the present invention is characterized in that, of the arbitrary number of node information, two linked node information are:
They are linked in both directions.

[0100] In an eighty-seventh aspect of the present invention, the node information corresponds to one of information having a substance and a category of the information.

In an eighty-eighth aspect of the present invention, the second layer structure manages attribute information of the node information.

In an eighty-ninth aspect according to the present invention, the attribute information includes information indicating whether the node information corresponds to the information or the category.

In a ninetieth aspect of the present invention, the attribute information includes information that summarizes the entity or category.

[0104] In a ninety-first aspect of the present invention, the attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and a registration date and time of the node information in the first layer structure. Registrant information.

According to a ninety-second aspect of the present invention, the entity managed by the third layer structure is managed so as to be referred to on a network accessible by the server device.

A ninety-third invention according to the present invention is characterized in that the data structure is a first to third layer structures that can be specified by a computer.

A ninety-fourth invention according to the present invention is directed to the above-described first to first aspects.
The third layer structure allows the computer to specify the location information of each entity managed in the second layer structure by referring to node information managed in the first layer structure. The entity managed by the third layer structure can be specified by referring to the location information of each entity managed by the second layer structure.

[0108] A 95th invention according to the present invention, wherein said first layer structure is linked to said node information by referring to any node information managed by said first layer structure by said computer. It is assumed that other node information to be performed can be specified.

A 96th invention according to the present invention, wherein said generation means refers to node information managed by said first layer structure to thereby determine location information of each entity managed by said second layer structure. And specifying the entity managed in the third layer structure by referring to the location information of each entity managed in the specified second layer structure.

A 97th invention according to the present invention, wherein said generation means refers to any node information managed by said first layer structure to generate other node information linked to said node information. To identify.

In a ninety-eighth aspect of the present invention, in the generating step, the location information of each entity managed in the second layer structure is referred to by referring to node information managed in the first layer structure. And specifying the entity managed in the third layer structure by referring to the location information of each entity managed in the specified second layer structure.

[0112] In a ninety-ninth aspect of the present invention, in the generation step, the other node information linked to the node information is referred to by referring to any one of the node information managed by the first layer structure. To identify.

[0113] In a hundredth invention according to the present invention, in the generation step, the location information of each entity managed in the second layer structure by referring to node information managed in the first layer structure. And specifying the entity managed in the third layer structure by referring to the location information of each entity managed in the specified second layer structure.

[0114] In the 101st invention according to the present invention, in the generating step, by referring to any node information managed by the first layer structure, other node information linked to the node information is referred to. To identify.

The 102nd invention according to the present invention relates to claim 6
The program according to any one of 5-92, 100, and 101 is recorded on a recording medium in a computer-readable manner.

[0116]

DESCRIPTION OF THE PREFERRED EMBODIMENTS [First Embodiment] FIG. 1 is a block diagram showing an example of a network system to which an information processing apparatus and a server apparatus according to a first embodiment of the present invention can be applied. , The server machine 3 and the client machines 1 and 2 can communicate with each other by a predetermined protocol.

In the client machine 1 shown in FIG. 1, reference numeral 11 denotes a display device having a function of displaying a file described in a predetermined language (for example, HTML or XML) by a browser. Reference numeral 12 denotes a control unit (including a CPU, a ROM, and a RAM (not shown)) which is loaded into an internal memory 121 from an external storage device (not shown).
S (for example, Windows (registered trademark), MacOS
(Various operation systems including (registered trademark)) the execution of the application. Reference numeral 122 denotes a client-side file search application program (client module, detailed procedures will be described later).
Web browser (Web Bro) without depending on platform (software environment such as hardware and OS)
wser) (for example, a Java (registered trademark) applet), which is downloaded on demand (downloaded when necessary) from a server 3 described later and arranged in a memory inside the client machine 1.

In the client machine 2 shown in FIG. 1, a display device 21 has a function of displaying a file described in a predetermined language (eg, HTML or XML) by a browser. Reference numeral 22 denotes a control unit (including a CPU, a ROM, and a RAM (not shown)).
S (for example, Windows (registered trademark), MacOS
(Various operation systems including (registered trademark)) the execution of the application. Reference numeral 222 denotes a client-side file search application program (client module, detailed procedures will be described later).
Web browser (WebBro) regardless of platform (software environment such as hardware and OS)
wser) (for example, a Java (registered trademark) applet), which is downloaded on demand (downloaded when necessary) from a server machine 3 described later and arranged in a memory inside the client machine 1.

In this example, the number of clients is “2”.
However, as long as the client can execute the file search processing system program, the number is not limited.

In the server machine 3 shown in FIG.
Is an external storage device composed of a hard disk or the like, and has a three-layer network layer (a layer for managing related information 312), an information capsule layer (a layer for managing information capsule information 313), and an entity layer (an entity layer). Layer for managing information 311)
The information is stored and managed.

Reference numeral 32 denotes a control unit (CPU, not shown)
Server OS loaded from an external storage device (not shown) on its internal memory 321.
(For example, WindowsNT (registered trademark), UNIX
(Including a registered trademark) controls the execution of the application. Reference numeral 322 denotes a file search system program (detailed procedure will be described later) installed on the server side.

Although not shown in the server machine 3, as described above, the file search application program on the client side is stored on the hard disk of the server machine 3 and downloaded to the client when necessary. Is done.

FIG. 2 is a view for explaining the configuration of software modules (corresponding to the server-side program 322 shown in FIG. 1) of the server machine 3 shown in FIG.

In FIG. 2, reference numeral 301 denotes an OS (operating system), 302 denotes a library, and 303 denotes We.
The b server 304 is an application and includes a file management program 305 as a part of the application. A hardware control program 306 includes a network board control program 307 and a hard disk control program 308 as a part of the hardware control program.

FIG. 3 is a diagram for explaining the configuration of the file management program shown in FIG. 2. The same components as those in FIG. 2 are denoted by the same reference numerals.

In FIG. 3, the file management program 3
05 is realized as one of the applications on the server machine 3, and 401 is the main part of the management program, which controls the entire management program. 402 is a GU
I program (for example, CGI or Servlet
t, SOAP, etc.), and passes data (such as data expressed in XML format) from the management program 401 to the Web server 303.

The Web server 303 sends the data of the GUI program 402 to the client machines 1 and 2 in the http format, and transmits instructions from the client machines 1 and 2 to the management program 401.

The device communication program 403 uses the network control program 307 to execute the server machine 3
Communication with the device to obtain information and the like from the device and to set the device.

The file management program 405 uses the hard disk control program 308 to implement a file server function of storing and managing information according to a three-layer bidirectional link network structure.

FIG. 4 is a diagram for explaining the configuration of software modules (corresponding to the client side programs 122 and 221 shown in FIG. 1) of the client machines 1 and 2 shown in FIG.

In FIG. 4, reference numeral 601 denotes an OS, which performs general processing of the client machine. 602 is Web
In Browser (Web browser), server machine 3
The drawing data expressed in the XML format is received from the Web server 303, displayed on a screen, and the user's instruction is transmitted to the server machine 3 through the http protocol. 603, a client module;
The Browser 602 performs various processes on data that is not processed. The client module 603
Includes various application programs. 6
A network program 04 controls communication between the client machine and the server machine 3.

FIG. 5 is a diagram for explaining the structure of an information management system in a server device according to the present invention. In this embodiment, a three-layer structure (network layer) using a general-purpose structured format such as XML is used. , Information capsule layer, entity layer), and manages categories and information utilizing the bidirectional link network structure.

In FIG. 5, L1 is a network layer (first layer structure) that abstracts categories and information as nodes NA to NF that can be arbitrarily linked, and expresses the abstracted nodes NA to NF in XML. , Construct a network structure of a bidirectional link between XML (manage a link relationship between any number of node information that can be arbitrarily linked).

L2 is an information capsule layer (second layer structure), which defines information capsules ICA to ICF that are associated one-to-one with the nodes NA to NF.

The information capsules ICA to ICF include:
There are a category type and an information type, which correspond to the category and the information, respectively. And information capsule I
The date of registration of the category or information,
Attribute information such as registrants and summaries (information summarizing (explaining) categories or information) can be added. The information capsule manages the location (URL) of an entity (shown in the following entity layer) corresponding to node information in the network layer.

L3 is an entity layer (third layer structure) mainly on a network accessible by the server machine 3 (for example, the Internet or an intranet (of course, a storage device in the server machine 3 may be used)). This resource is composed of entities (entities) ETYA, ETYD, and ETYG that can be accessed by, for example, a URL, and the URL (location) is managed in a corresponding information capsule of the information capsule layer L2.

Examples of the actual files include text files, MS-Word files, MS-Excel files, and MS-PowerP files manufactured by Macrosoft.
It is an entity file on the network that can store information such as an O.T. file and a PDF file. That is, the entity layer manages entities corresponding to node information and information capsules.

The network layer L shown in FIG.
1, the information capsule layer L2 will be described in detail.

The information structure of the network layer L1 (information structure of each node) includes an information identification ID (a unique number is automatically assigned by the server machine 3) by XML, a link to the information capsule layer, and an end of the network structure. Information and links to other network information (for the number of links). That is, each node information is realized as an XML file.

Specifically, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "22"><propurl> e: \ aaa \ prop \ prop22.xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel0.xml </ link><link> e: \ aaa \ rel \ rel66.xml </ link><link> e: \ aaa \ rel \ rel55.xml </ link></relational>, each with "<? xml version =" 1.0 "encoding ="
euc-jp "?>" is an XML declaration, "id =" 22 "" is an information identification ID,
"<Propurl> e: \ aaa \ prop \ prop22.xml </ propurl>" is a link to the information capsule layer, and "<terminate> false </ te
rminate> ”is the termination information of the network structure (“ false ”= not terminal /“ true ”= terminal),“ <link> e: \ aaa \ rel \ rel0.x
ml </ link> ”,“ <link> e: \ aaa \ rel \ rel66.xml </ link </ link>
> ”And“ <link> e: \ aaa \ rel \ rel55.xml </ link> ”are links (for the number of links) to other network information.

On the other hand, the information structure of the information capsule layer L2 (information structure of each information capsule) is expressed by XML using an information identification ID (same as network layer information), information state (in use / unused), registrant, registration date , Title, link to entity information, information summary / memo, and information type. That is, each information capsule is XML
Implemented as a file.

Specifically, <? Xml version = "1.0" encoding = "euc-jp"?><Property delete = "no" id = "22"><person> anonymous </ person><date> 2001 / 02/23 13:19:04 </ date><title> Programming language </ title><dataurl></dataurl><memo> Programming language related </ memo><information> false </ information></ property > And "<? Xml version =" 1.0 "encoding ="
euc-jp "?>" is an XML declaration, and "id =" 22 ">" is an information identification ID
(Same as the corresponding node in the network layer), "de
lete = "no" is the information state ("no" = in use / "yes" = unused), "<person> anonymous </ person>" is the registrant, "<d
ate> 2001/02/23 13:19:04 </ date>"is the registration date,"<tit
le> program language </ title>"is the title,"<dataurl>
</ dataurl> ”is a link to entity information (in this case, a category type, so a link to entity information is not specified, but in the case of an information type, for example,“ <dataurl> http: // www. abcdefg.com/bbb/cde.html
</ dataurl>), the actual entity location is specified), and <memo> related to programming languages </ memo>
Is an information summary / memo, "<information> false </ informatio
“n>” is the information type (“false” = category type / “true” = information type). As described above, the data structure having the above-described first to third layer structures (the network layer L1, the information capsule layer L2, and the entity layer L3) can be specified by the computer (the server machine 3). Then, the file search program 405) of the server machine 3 uses the network layer L
1, the location information (URL of each entity, etc.) of each entity managed by the information capsule layer L2 can be specified by referring to the node information managed by the information capsule layer L2, and managed by the specified second layer structure. The entity (entity) managed by the entity layer L3 can be specified by referring to the location information (URL of each entity) of each entity.

Also, the computer (here, the file search program 405 of the server machine 3) refers to any node information managed by the network layer L1 to obtain other node information linked to the node information. It can be specified.

Further, the computer (here, the file search program 405 of the server machine 3) transmits the information identification ID in the attribute information managed by the information capsule layer L2.
, It is also possible to specify node information managed by the network layer L1 (node information having the same information ID).

FIG. 6 is a diagram showing an example of bidirectional network type data managed by the server machine 3 shown in FIG.

In FIG. 6, N1 to N9 are nodes, and the node N1 is associated with “C ++” as a category, and the node N2 is associated with “program language” as a category.
Is associated with the node N3 as “Sp” as a category.
electrical root ", node N4 is associated with" object-oriented "as a category, node N5 is associated with" mobile "as a category, and node N6 is associated with" Java "as a category.
And the node N7 has the category "UM
L is associated with the node N8, "XML" is associated with the category, and the node N9 is associated with "information on ABCD" as information. Note that the nodes N1 to N9 are defined by XML as described above, and the bidirectional network type data example is managed by a network layer as shown in FIG.

FIG. 7 is a diagram showing an example of a network layer of the bidirectional network type data shown in FIG.
An arrow in the figure shows a state in which bidirectional links are associated. The same components as those in FIG. 6 are denoted by the same reference numerals. In addition, the nodes that link bidirectionally correspond to the information capsules on a one-to-one basis.

Hereinafter, N1 is, for example, an XML file “e: \ a
aa \ rel \ rel11.xml "and N2 is an XML file" e:
\ aaa \ rel \ rel22.xml ", N3 is, for example, an XML file" e: \ aaa \ rel \ rel0.xml ", N4 is, for example, an XML file" e: \ aaa \ rel \ rel44.xml ", and N5 is, for example, XML File "e: \ aaa \ rel \ rel55.xml", N6 is, for example, an XML file "e: \ aaa \ rel \ rel66.xml", N7 is, for example, XML
File "e: \ aaa \ rel \ rel77.xml", N8 is XM
L file "e: \ aaa \ rel \ rel88.xml", N9 is X
The nodes and their link relationships will be described below as realized by the ML file “e: \ aaa \ rel \ rel99.xml”.

First, concretely showing the node N1, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "11"><propurl> e: \ aaa \ prop \ prop11 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel22.xml </ link><link> e: \ aaa \ rel \ rel44.xml </ link></relational> and an arrow N1-L- indicating a link from N1 to N2.
N2 is the above “<link> e: \ aaa \ rel \ rel22.xml </ link>”
N1-L indicating a link from N1 to N4 corresponding to
−N4 is “<link> e: \ aaa \ rel \ rel44.xml </ link>
".

Also, when the node N2 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "22"><propurl> e: \ aaa \ prop \ prop22 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel11.xml </ link><link> e: \ aaa \ rel \ rel0.xml </ link><link> e: \ aaa \ rel \ rel66.xml </ link><link> e: \ aaa \ rel \ rel55.xml </ link></relational> and an arrow N2-L indicating a link from N2 to N1 −
N1 is the above “<link> e: \ aaa \ rel \ rel11.xml </ link>”
N2-L indicating the link from N2 to N3
−N3 is the above “<link> e: \ aaa \ rel \ rel0.xml </ link>”
, An arrow N2-L indicating a link from N2 to N6
−N6 is “<link> e: \ aaa \ rel \ rel66.xml </ link>
N2 indicating a link from N2 to N5.
−L−N5 is the above “<link> e: \ aaa \ rel \ rel55.xml </ li>
nk>].

Further, when the node N3 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "0"><propurl> e: \ aaa \ prop \ prop0 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel22.xml </ link><link> e: \ aaa \ rel \ rel22.xml </ link><link> e: \ aaa \ rel \ rel55.xml </ link></relational>, and an arrow N3-L- indicating a link from N3 to N2.
N2 is the above “<link> e: \ aaa \ rel \ rel22.xml </ link>”
N3-L indicating the link from N3 to N4, corresponding to
−N4 is “<link> e: \ aaa \ rel \ rel22.xml </ link>
N3 indicating a link from N3 to N5
−L−N5 is the above “<link> e: \ aaa \ rel \ rel55.xml </ li>
nk>].

Further, when the node N4 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "44"><propurl> e: \ aaa \ prop \ prop44 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel11.xml </ link><link> e: \ aaa \ rel \ rel0.xml </ link><link> e: \ aaa \ rel \ rel66.xml </ link><link> e: \ aaa \ rel \ rel77.xml </ link></relational> arrow N4-L indicating the link from N4 to N1 −
N1 is the above “<link> e: \ aaa \ rel \ rel11.xml </ link>”
N4-L indicating the link from N4 to N3, corresponding to
−N3 is the above “<link> e: \ aaa \ rel \ rel0.xml </ link>”
N4-L indicating the link from N4 to N6, corresponding to
−N6 is “<link> e: \ aaa \ rel \ rel66.xml </ link>
And an arrow N4- indicating a link from N4 to N7.
L-N7 is described in the above "<link> e: \ aaa \ rel \ rel77.xml </ link </ link>
> ”.

Further, when the node N5 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "55"><propurl> e: \ aaa \ prop \ prop55 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel22.xml </ link><link> e: \ aaa \ rel \ rel0.xml </ link><link> e: \ aaa \ rel \ rel66.xml </ link><link> e: \ aaa \ rel \ rel88.xml </ link></relational> and an arrow N5-L indicating a link from N5 to N2 −
N2 is the above “<link> e: \ aaa \ rel \ rel22.xml </ link>”
, An arrow N5-L indicating a link from N5 to N3
−N3 is the above “<link> e: \ aaa \ rel \ rel0.xml </ link>”
, An arrow N5-L indicating a link from N5 to N6
−N6 is “<link> e: \ aaa \ rel \ rel66.xml </ link>
N5 indicating a link from N5 to N8.
−L−N8 is the same as “<link> e: \ aaa \ rel \ rel88.xml </ li>
nk>].

Also, when the node N6 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "66"><propurl> e: \ aaa \ prop \ prop66 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel22.xml </ link><link> e: \ aaa \ rel \ rel77.xml </ link><link> e: \ aaa \ rel \ rel55.xml </ link><link> e: \ aaa \ rel \ rel88.xml </ link><link> e: \ aaa \ rel \ rel99.xml </ link><link> / relational>, indicating the link from N6 to N2.
N2 is the above “<link> e: \ aaa \ rel \ rel22.xml </ link>”
, An arrow N6-L indicating a link from N6 to N7
−N7 is “<link> e: \ aaa \ rel \ rel77.xml </ link>
N6 indicating a link from N6 to N5.
−L−N5 is the above “<link> e: \ aaa \ rel \ rel55.xml </ li>
nk>"and an arrow N indicating a link from N6 to N8
6-L-N8 is based on the above “<link> e: \ aaa \ rel \ rel88.xml </
link>"and an arrow N6-L-N9 indicating a link from N6 to N9 is the above-mentioned"<link> e: \ aaa \ rel \ rel99.xml "
</ link>".

Further, when the node N7 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "77"><propurl> e: \ aaa \ prop \ prop77 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel44.xml </ link><link> e: \ aaa \ rel \ rel88.xml </ link></relational> and an arrow N7-L- indicating a link from N7 to N4.
N4 is the above “<link> e: \ aaa \ rel \ rel44.xml </ link>”
And an arrow N7-L indicating a link from N7 to N8.
−N8 is “<link> e: \ aaa \ rel \ rel88.xml </ link>
".

Also, when the node N8 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "88"><propurl> e: \ aaa \ prop \ prop88 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel55.xml </ link><link> e: \ aaa \ rel \ rel66.xml </ link><link> e: \ aaa \ rel \ rel77.xml </ link><link> e: \ aaa \ rel \ rel99.xml </ link></relational> and an arrow N8-L indicating a link from N8 to N5 −
N5 is the above "<link> e: \ aaa \ rel \ rel55.xml </ link>"
And an arrow N8-L indicating a link from N8 to N6.
−N6 is “<link> e: \ aaa \ rel \ rel66.xml </ link>
N8 indicating a link from N8 to N7.
−L−N7 is the same as the above “<link> e: \ aaa \ rel \ rel77.xml </ li>
nk>"and an arrow N indicating a link from N8 to N9
8-L-N9 is based on the above “<link> e: \ aaa \ rel \ rel99.xml </
link> ”.

Further, when the node N9 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "99"><propurl> e: \ aaa \ prop \ prop99 .xml </ propurl><terminate> true </ terminate><link> e: \ aaa \ rel \ rel66.xml </ link><link> e: \ aaa \ rel \ rel88.xml </ link></link>relational> and an arrow N9-L- indicating a link from N9 to N6.
N6 is the above “<link> e: \ aaa \ rel \ rel66.xml </ link>”
And an arrow N9-L indicating a link from N9 to N8.
−N8 is “<link> e: \ aaa \ rel \ rel88.xml </ link>
".

Thus, even when the information capsule and the entity corresponding to a certain node that are linked to a plurality of nodes are changed, all the nodes that refer to the changed information capsule and the entity are changed. And the entity are referenced via one node, the change result can be transmitted to all the referring nodes in a straightforward manner.

Further, the layering facilitates separation of the search target. In other words, it is easy to realize options such as only the information capsule layer, only the entity layer, and both layers as search targets.

FIGS. 8 to 10 show examples of the user interface displayed on the displays 11 and 21 of the client machines 1 and 2 shown in FIG. 1. FIG. 8 shows the client machine 1 when a category is selected. 9 corresponds to the screen displayed on the client machine 2, and FIG. 9 corresponds to the category list screen displayed on the client machine 1 or 2 when “Java” in the category shown in FIG. 8 is selected. FIG. 10 corresponds to a screen displayed on the client machine 1 or the client machine 2 when the information “ABCD” is selected.

The upper part 801 of the category list part 800 shown in FIGS. 8 and 9 is the property (data in the corresponding information capsule) of the selected category,
Reference numeral 2 denotes a display content of a category or information property related (linked) to the selected category (that is, the category displayed in the upper part 801). The upper part 1001 shown in FIG. In the property of the selected information (the data in the corresponding information capsule), the lower part 1002 shows the display contents based on the entity data managed in the entity layer corresponding to the selected information.

In the display processing shown in FIG. 10, the information managed by the server machine 3 in a three-layer structure according to an information acquisition request from the client machine 1 or 2 in accordance with an information selection instruction as described later. 4 is acquired from the server machine 3 by the network program 604 shown in FIG. 4 and displayed by the Web Browser 602 on the display.

[Second Embodiment] In the first embodiment,
XML generated from management information of each layer obtained by referring to information managed in a three-layer structure in the server machine 3
The data is acquired from the server machine 3 by the network program 604 shown in FIG.
Has been described simply on the display, but in the following, the relation of the category of the network structure or the relevance of the information is based on a free viewpoint (viewpoint) that the user focuses on (based on that viewpoint as a root). An embodiment in which display is controlled as a dynamic tree structure will be described.

FIGS. 11 to 13 are diagrams for explaining a dynamic tree display processing state in the information processing apparatus according to the second embodiment of the present invention. The network type data shown in FIG. 6 is converted into tree type data. This is an example of display after conversion processing.

In the present embodiment, as shown in FIG. 11A, for example, in a state where a tree is displayed on the screen by the Web Browser 602 on the display 11 of the client machine 1, the category "program language" is viewed from the viewpoint. Specifically, when the category “program language” is selected by a pointing device (not shown), a start instruction menu is displayed. With the “program language” being selected, the start instruction menu “start here” is selected. When "to" is selected and selected, the tree structure of the category area is dynamically changed (details will be described later).
As shown in FIG. 11B, the root of the category area starts from “program language” and the category is W
The tree is displayed by the ebBrowser 602.

Then, in the display state shown in FIG. 11B, when an instruction from the viewpoint of the category “Java” is further performed, specifically, as shown in FIG. 12A, the category “Java” is displayed. Is selected with a pointing device (not shown), a starting point instruction menu is displayed, and the “Ja” is displayed.
When the start instruction menu is selected and instructed in a state where “va” is selected, the tree structure of the category area is dynamically changed (details will be described later), and as shown in FIG. With the root of “Java” as the starting point, the categories are displayed in a tree form by the Web Browser 602.

Then, in the display state shown in FIG. 12B, with the category “program language” opened, an instruction from the viewpoint of the category “Special Root” is performed. Specifically, when the category “SpecialRoot” is selected with a pointing device (not shown), a starting point instruction menu is displayed. When the starting point instruction menu is selected and instructed while the “Special Root” is selected, The tree structure of the category area is dynamically changed (details will be described later). As shown in FIG. 13B, the root of the category area is displayed in the form of a tree by the Web Browser 602 starting from “Special Root”. You.

As described above, the client machine acquires the XML data of each layer on the network side managed by the server machine 3 only by giving an instruction starting from the category intended by the user.
3 converts the XML data structure into a tree display structure and displays it on the display by the Web Browser 602, so that the server machine 3 merely has a three-layer XM
Just by centrally managing the L data, the user can freely expand and display the category in which the tree structure is customized.

Before describing the “change of starting point”, first, a process of displaying (tree display) information of a lower layer of a predetermined category displayed on the client screen will be described.

Hereinafter, an example of tree display processing for categories or information between the information processing apparatus and the server apparatus according to the present invention will be described with reference to FIGS.

FIG. 14 is a diagram showing an example of a tree structure displayed on the display of each of the client machines 1 and 2 shown in FIG. 1. The tree structure is obtained from the server machine 3 and starts from the category “Special Root” according to the XML data. Each category corresponds to a state where a tree is displayed.

FIGS. 15 and 16 are diagrams showing an example of tree information created on the memory 321 of the server machine 3 shown in FIG.

In FIG. 14, it is assumed that the tree is already displayed on the screen on the display 11 of the client machine 1 or the like.
Suppose you want to get information under "C ++" under Programming Language under. At this time, the user operates the pointing device (not shown) and double-clicks the information including the information to be acquired, in this case, “C ++” in the figure.
The client application (network program 604) on the memory of the client machine 1
Information on the upper layer of the information that the user double-clicked,
In this case, “Special Root” − “program language” is acquired, and “C ++” is passed to the server machine 3 together with information as a parameter in accordance with a control procedure described later.
The parameters include "C ++" (base information),
In addition to “Special Root” — “program language” (tracking exclusion information), information indicating the depth of tracking (default is “1” but can be changed by user setting) is included.

The server machine 3 receives, for example, the base information “C ++
”And the information“ Special Root ”and the“ program language ”in the upper layer of the base information are stored in all the root information existing in the memory 321.

Next, the related information of the base point information is read from the hard disk 31 and expanded on the memory 3211. Further, from the related information developed on the memory 321, related destination information of the information is acquired and stored in an array on the memory 321.

For all related destinations stored in the array,
While reading the information of the node indicated by the related destination into the hard disk 31, one piece of information stored in the array is obtained, and a loop process of information tracking is performed. In detail, it is checked whether the information already exists in all the route information by looping all the route information, and as a result of the check, if the information is stored in the all route information, the duplicate information is detected at that time. The flag is set, the information tracking loop process is completed, and the process proceeds to the next process.

Next, when the information tracking depth is designated, after exiting the information tracking loop processing, the duplicated information detection flag is not detected and reaches the designated information tracking depth. If not, use that information as a parameter,
Execute the tree generation process again.

When the depth of information tracking is not specified, after exiting the loop processing of information tracking, the duplication information detection flag is not detected and the information is used as a parameter.
Execute the tree generation process again.

The above processing is repeated by the number of pieces of information stored in the array, and when the node to be tracked (information of the node indicated by the related destination in the array) does not exist, the memory 321 is shown in FIG. Tree information is created by the file management program 405.

As shown in FIG. 15, when the tree structure is created, only the relationship between the information is converted from the network to the tree, and the tree information includes the specific contents (Property) of each information. Not.

FIG. 15 shows only the hierarchical structure of information.
After reading the entity file at the destination indicated by the information capsule link of each piece of information from the data structure state shown in (1) and expanding the information on the memory 321, a tree structure (FIG. 16) having specific information is stored in the file management program. 4
05.

Then, the server machine 3 delivers the XML data representing the hierarchical structure of the information shown in FIG. 16 in XML to the client machine 1 that has made the request via the network control program 307.

The hierarchical structure of the information shown in FIG.
An example of XML data represented by L is shown. <? xml version = "1.0" encoding = "Shift-JIS"?><category> C ++ <property><person> anonymous </ person><date> 2000/03/14 13:19:04 </ date><title> C ++ </ title><dataurl> http://www.xxx </ dataurl><memo> C ++ is an object-oriented programming language ... </ memo></property><category> Object-oriented <property><person> anonymous </ person><date> 2001/01/10 10:10:09 </ date><title> object-oriented </ title><dataurl> http: //www.omg ... </ dataurl ><memo> Object Orientation is for Software Engineering ... </ memo></property></category></category> As a result, the client machine 1 becomes the server machine 3
The hierarchical structure of the information represented by the delivered XML data is acquired, and the data structure of the XML is converted into a tree display structure and displayed on the display 11 so as to be below the “base point information” ( (FIG. 17). At this time, FIG.
The same display as the category list shown in FIG.

FIG. 17 shows a state in which “C +
+ "Is a schematic diagram showing a process for displaying information under"
This corresponds to a case where "Object Orientation" is displayed under "C ++" in response to an instruction to display information under "C ++".

As shown in the figure, in the state where the tree display as shown in (a) is already displayed on the screens of the client machines 1 and 2, the user operates the “Program Language” under “Special Root”. Suppose you want to see the information under "C ++". At this time, the user must select "C ++" under the programming language.
Is double-clicked on the pointing device (not shown) with the pointing device (not shown), as shown in (b), the information "object-oriented" is returned from the server machine 3 as XML data, and the client machines 1 and 2 send the "Special Root""Object-oriented" is additionally displayed under "C ++" under "Programming language" under "".

(C) shows an outline of the process between the client and the server (the process between the client module 603 shown in FIG. 4 and the file management program 405 shown in FIG. 3). This will be described with reference to FIGS.

FIG. 18 is a flowchart showing an example of a first data processing procedure in the information processing apparatus (client machine) according to the present invention, which is executed by the CPU (not shown) of the client machines 1 and 2 shown in FIG. The client module 603 (FIG. 4) is activated and realized by a CPU (not shown) as a part of the client module 603. Note that (1) to (7) indicate each step. Also,
A case where the following processing is executed by the client machine 1 will be described as an example.

First, in step (1), the user of the client machine 1 checks the tree structure displayed on the display 11 (see the display screen example shown in FIG. 14).
The client module shown in FIG. 4 determines whether or not the user has operated a pointing device or the like (not shown) to issue a lower layer information display instruction (for example, double-clicking “C ++” to instruct the display of information under “C ++”). If it is determined in step 603 that the lower layer information display instruction has been issued, the process proceeds to step (2), and the hierarchy information of the specified base point information (FIG. 1)
When “C ++” is used as the base point information as in the example shown in FIG.

In step (3), a parameter for requesting a tree display for the XML data acquired from the server machine 3 based on the acquired hierarchy information (the designated base information, the hierarchy information, and the parameters including the designation of the tracking depth) ) Is created by the client module 603. Then, in step (4), the client module 603
Is transferred to the server machine 3 (that is, the client module 603 uses the information (viewpoint) specified on the tree-structured data structure as the base point information to generate any node information. A data acquisition request including a parameter instructing is issued to the server machine 3).

Next, in step (5), step (4)
The client module 603 determines whether or not XML data (in the example shown in FIG. 17, data to be added below “C ++”) as response data from the server machine 3 to the tree display request transferred in the above is acquired. And XM
If it is determined that the L data has been acquired, the client module 603 creates the display data for displaying the category or information in a tree form by analyzing the XML data acquired from the server machine 3 in step (6). .

In step (7), based on the display data created by the client module 603, the Web Browser 602 additionally displays lower layer information on the display 11 below the base point information on the tree (FIG. 1).
As shown in Figure 7, "Object-oriented" under "C ++"
Is additionally displayed), and the process ends. That is, based on a data acquisition request to the server machine 3, display data for displaying a data structure of a shared resource generated in the server machine 3 and managed in a three-layer structure on the server machine 3 is acquired from the server, The display data is displayed as a tree below the information specified in step (1).

FIG. 19 is a flowchart showing an example of a first data processing procedure in the server device according to the present invention. The CPU (not shown) of the server machine 3 shown in FIG.
Corresponds to a data processing procedure by the file management program 405 (FIG. 4). (11)
(15) shows each step.

First, in step (11), the file management program 405 determines whether or not a tree display request has been received from the client machine 1, and if it is determined that the tree display request has been received, In step (12), the parameters included in the tree display request received by the file management program 405 are analyzed, and in step (13), the parameters (base information, hierarchical information,
Based on the analysis result of the (tracking depth specification), the tree generation processing (first-depth tree generation processing for the tracking depth specification in the parameter) described in detail in FIG. 20 is executed.

Then, in step (14), from the generated tree information (the information shown in FIG. 15), the information of the entity file at the destination indicated by the information capsule link of each information is read and expanded in the memory. 16 is generated, and the file management program 405 converts the information into XML data. In step (15), the network control program 307 converts the information into XML data using the file management program 405. The obtained XML data is transferred to the client machine 1 that has issued the tree display request, and the process ends.

FIG. 20 is a flow chart showing an example of a third data processing procedure in the server device according to the present invention. The CPU is not shown in the server machine 3 shown in FIG.
Corresponds to the detailed procedure of the tree generation process in step (13) shown in FIG. 19 by the file management program 405 (FIG. 4) executed by the program. (21)-
(32) shows each step, and each step is executed by the file management program 405 shown in FIG.

First, in step (21), the file management program 405 stores the tree display request parameter in all the root information secured on the memory 321 shown in FIG. The information of the hierarchy is also stored), and only the base information that does not include the information of the upper hierarchy is stored in the tree information. Then, step (2)
In 2), the file management program 405 reads the related information 312 of the base information and expands it in the memory 321.

Then, in step (23), the file management program 405 sets the duplication information detection flag (valid only in the present tree generation process) on the memory 321 to an undetected state, and sets the related information expanded in the memory 321. (Node information) All the related destination information possessed by 312 is acquired, and in step (24), the file management program 405
The relevant destination information is stored in the array secured in the array 21 (valid only within the tree generation processing).

Next, in step (25), the file management program 405 obtains one piece of related destination information stored in the array secured in the memory 321, and in step (26)
Then, it is determined whether or not this related destination information exists in all the route information. If it is determined that the related destination information exists in all the route information, the process proceeds to step (32), and the duplicate information detection flag on the memory 321 is set to the detection state. Set, step (2)
Proceed to 7).

On the other hand, if it is determined in step (26) that the relevant destination information does not exist in all the route information, the file management program 405 determines in step (27) the depth of information tracking (client Is determined to be arbitrarily selectable from), and if it is determined that the depth is not specified, the process directly proceeds to step (29).

On the other hand, if it is determined in step (27) that a depth for information tracking is specified, the process proceeds to step (28), where the file management program 405 specifies the current information tracking depth. It is determined whether the depth is shallower than the specified depth. If it is determined that the depth is not shallower than the specified depth (the specified depth has been reached), the process directly proceeds to step (31).

The depth of the information tracking can be specified because an infinite loop (which traces the same route many times through the network) that can occur when the network structure is represented by a tree structure is used. This is to avoid it. For this reason, in the present embodiment, it is possible to effectively avoid falling into an infinite loop by limiting the depth from the node at the starting point. It is assumed that the depth specification for this information tracking is specified at the time of a tree display request from the client.

On the other hand, if it is determined in step (28) that the information tracking depth is shallower than the designated depth, the process proceeds to step (29).

In step (29), it is determined whether or not the duplication information detection flag is in the undetected state. (Information), the tree generation processing of the next depth (depth for information tracking) is executed again (the tree generation processing itself shown in FIG. 19 is recursively executed).
Then, the process proceeds to step (31).

On the other hand, if it is determined in step (29) that the duplication information detection flag is already in the detection state, the flow directly proceeds to step (31). As a result, it is possible to prevent duplicate detection of the related destination information once set in all the route information, thereby effectively avoiding falling into an infinite loop.

Next, in step (31), the file management program 405 determines whether or not there is related destination information (node to be tracked) that has not been processed yet in the array. In step (2)
Returning to 5), the process for the next related destination information in the array is repeated.

On the other hand, if it is determined in step (31) that there is no related destination information (node to be tracked) which has not been processed in the array, the processing is terminated as it is (upper parent tree creation processing). , And this is repeated to finally return to step (14) in FIG. 18). Incidentally, at the time of returning to step (14) in FIG.
Tree information below the base point (information shown in FIG. 15) is generated in the tree information on the memory 321.

With the above processing, the network type data on the server machine 3 can be converted into the tree type data.

Also, by the processing shown in FIG. 18 to FIG. 20, focusing on arbitrary viewpoint information or arbitrary viewpoint information added to a data acquisition request (tree display request) from the client machine 1, node information is used as the viewpoint information. By tracking (searching) and generating display data for displaying a data structure of a shared resource managed in three layers in a tree, the user can obtain predetermined information (base point) of the tree displayed on the client machine. Information) is obtained (double-clicked) to acquire the lower layer information as XML data from the server machine 3 and additionally display it below the information (base point information) specified by the user on the client machine. Can be.

Also, as described above, in the present embodiment,
The tree displayed on the client machine can be dynamically changed and displayed, starting from predetermined information of the tree displayed on the client machine (using that information as a root). An example in which the following processing is executed by the client machine 1 will be described below with reference to FIG.

FIG. 21 is a flowchart showing an example of the second data processing procedure in the information processing apparatus (client machine) according to the present invention, which is executed by the CPU (not shown) of the client machines 1 and 2 shown in FIG. The client module 603 (FIG. 4) is activated and realized by a CPU (not shown) as a part of the client module 603. Note that (41) to (46) indicate each step. Also, a case where the following processing is executed by the client machine 1 will be described as an example.

In this case, as in the case of the lower layer information display processing shown in FIG. 17, first, in step (41), the user of the client machine 1 displays the tree structure displayed on the display 11 (the display structure shown in FIG. 11). When the user operates a pointing device or the like (not shown) to give a start point change instruction (for example, instructs “Start here” from the “Program” menu) to the screen example (see screen example), step (42) is performed. Then, the client module 603 shown in FIG. 4 performs a tree display request parameter for XML data acquired from the server machine 3 based on the designated new starting point (“program language” in the example of FIG. Information (“program language”),
In step (43), a tree including the parameter created by the client module 603 is created. The display request is transferred to the server machine 3 (that is, the client module 603 obtains data including a parameter indicating any node information with the starting point (viewpoint) indicated on the data structure displayed in the tree as base information. The request is made to the server machine 3).

Then, the server machine 3 is configured as shown in FIGS.
By executing the process indicated by 0, the tree information lower than the information ("program language") specified at the starting point is returned to the client machine as XML data.

Next, in step (44), step (4)
The client module 603 determines whether or not the XML data that is the response data from the server machine 3 to the tree display request transferred in 3) has been acquired.
If it is determined that L data has been acquired, step (4)
In 5), the client module 603 creates display data for displaying the category or information in a tree format by analyzing the XML data acquired from the server machine 3.

[0214] In step (46), the Web Browser 602 displays the display 11 on the basis of the display data created by the client module 603.
Then, a tree display starting from the information (“program language”) designated as the starting point is performed (FIG. 11B), and the process is terminated. That is, based on the data acquisition request to the server machine 3, 3
The display data for displaying the data structure of the shared resource managed in the layer structure is obtained from the server, and the display data is displayed in a tree with the information designated in step (41) as the root.

As a result, categories or information in both parent / child directions can be dynamically expanded and displayed on the client machines 1, 2 and the like in accordance with the XML data obtained from the server machine 3. In this way, by customizing the starting point of the tree display form freely by the user, it is possible to instruct the shared resources (substantial files, URLs, etc.) on the network with the tree structure constructed on a user basis. Thus, the user can efficiently reach (the information can be efficiently searched).

When the starting point is changed, the tracking exclusion information (upper layer information) is specified as the parameter when the display request is sent from the client machine to the server machine. It may be configured to display a tree in which the tracking exclusion information (information of the upper hierarchy) is added to the XML data returned from the server 3.

The "tracking depth specification" specified by the client is stored in an environment setting file provided in each client machine, read from the file, and specified to the server. You may. Further, the "tracking depth designation" stored in the environment setting file can be freely changed by the user on the client side. When the environment setting file is not in the client machine, a configuration may be adopted in which a default environment setting file is downloaded from the server machine 3 to the client machine.

[0218] Furthermore, the above-mentioned environment setting file includes a "starting point" displayed first when the client is started.
Category or information is also recorded.

[Third Embodiment] In the second embodiment,
A case has been described in which the depth of the base point is specified to prevent the processing from entering an infinite loop. At this time, a plurality of tree display forms on the client machine may be switched.

FIG. 20 is a diagram showing an example of a tree display form in the information processing apparatus according to the third embodiment of the present invention.
(A) of FIG.
FIG. 22B shows an example in which the display is not performed after the first time, and FIG. 22B is an example in which the category or information (in the present embodiment, the second time or later is displayed for the category “Special Root”).

It is assumed that the instruction of the display form is stored in an environment setting file in each of the client machines 1 and 2, and that the client machines 1 and 2 read this environment setting file at the time of startup. Then, the client machines 1 and 2 have the client module 6
03 obtains the XML data from the server machine 3, and switches the display mode based on the display instruction at the time when the client is activated.

Although the above-mentioned environment setting file is read at the time of startup by the client, the client may read the environment setting file every time the environment setting file is changed, and may control the switching of the display mode.

Note that once a category or information appears,
In the case where the display is to be performed after the first time, the client sets the parameters transmitted in steps (4) and (43) to 2
Information to be displayed after the first time is added, and the server machine 3 receiving the information invalidates the duplication detection flag in the tree generation processing shown in FIG.
It is assumed that tree information including a duplicate display is generated and returned to the client machines 1 and 2. However, in this case, since there is a possibility that an infinite loop may occur, it is necessary to specify the tracking depth with respect to the base point.

[Fourth Embodiment] In the first embodiment,
Client machines 1 and 2 are XM from server machine 3
The case has been described where the L data is received and the category or information structure of the shared resource on the network is displayed in a tree structure. However, the file management program 405 of the server machine 3 expands the XML data into an intermediate tree structure. Then, the configuration may be such that the intermediate XML data is easy to handle by the client module 603 of the client machines 1 and 2. Hereinafter, the embodiment will be described.

FIG. 23 is a diagram showing an example of XML data exchanged between an information processing apparatus and a server apparatus according to the fourth embodiment of the present invention. It is.

In FIG. 23, reference numeral 2100 denotes an intermediate XM
The L data is expanded by the file management program 405 of the server machine 3 into an intermediate tree structure using a general-purpose structured format such as XML.

In order to display the category or information structure on the client machines 1, 2, etc., when the file management program 405 of the server machine 3 expands the network structure into a tree structure, the file management program 405 expands the XML data 2100 having an intermediate tree structure. I do. Then, the XML data 2100 is transferred to the client module 6 of the client machine 1 or 2.
03, and thereafter, the client module 6
03 freely edits and displays on the displays 11, 21 and the like in a form that is easy for the user to understand visually. For example, different icons may be displayed according to categories, information, and the like. At this time, the icon data may be downloaded from the server machine 3 or the icons of the client machines 1 and 2 may be used.

This makes it easy to independently develop the program of the display portion, and allows the user to make various display requests (including a request for iconification, a request for changing the folder form by differentiating colors or shapes, etc.). It is easy to deal with it flexibly.

[Fifth Embodiment] In the first embodiment,
Client machines 1 and 2 are XM
The case where the L data is received and the category or information structure of the shared resource on the network is displayed in a tree structure has been described. Will perform tracking for tree expansion on the network structure,
A situation where considerable time is required for the development process may occur. Therefore, by passing the path from the root to the node to be opened to the tracing process, control may be performed such that tracing for tree expansion is omitted for nodes on the path. Hereinafter, the embodiment will be described.

FIG. 24 is a diagram illustrating a tree display processing state in the information processing apparatus and the server apparatus according to the fifth embodiment of the present invention.

In FIG. 24, client machines 1 and 2
When an instruction to change the above-mentioned viewpoint to “program language” is given in 2, for example, when “program language” displayed in a network form is expanded in a tree view, the path from the root to the node to be opened is stored in the server. By passing it to the tracking process for the machine 3, for example, in the current display, since the “program language” is under “Special Root”, the client module 603
ot ”-“ program language ”path to server machine 3
, It is possible to omit the trace processing for tree expansion for nodes on the path.

Similarly, when an instruction to change the above-mentioned viewpoint to “C ++” is issued in the client machines 1 and 2, the path from the root to the node to be opened is passed to the tracking processing on the server machine 3 side. That is, the client module 603 is "object-oriented"-
By notifying the path "C ++"-"program language" to the file management program 405 of the server machine 3, it is possible to omit the trace processing for tree expansion for the nodes on the path. Become.

Similarly, when an instruction to change the above-mentioned viewpoint to “program language” in the category “Java” is issued in the client machines 1 and 2, the path from the root to the node to be opened is changed to the server machine 3 side. In other words, the client module 603 performs “UML”-“object-oriented”-“Ja
By notifying the path "va"-"program language" to the file management program 405 of the server machine 3, it is possible to omit the trace processing for tree expansion for nodes on the path. .

Then, in accordance with the tree display request from the client machines 1 and 2, the server machine 3 expands the tree from the designated node onward, and requests the node expansion of the result in the intermediate tree structure using XML. Return to the machine 1 or the client machine 2, and display the tree on the client machines 1 and 2.

In other words, when a portion after a certain node on the tree display is expanded, it is not necessary to check whether the path is already displayed, and unnecessary trace determination processing by the file management program 405 of the server machine 3 is avoided. Can be.

[Sixth Embodiment] In the second embodiment,
A case has been described in which categories and information already managed as shared resources on the network in a three-layer structure on a hard disk or the like on the server machine 3 are displayed on the client machines 1 and 2 in a tree structure. Is registered on a hard disk or the like on the server machine 3 so that it can be used as a shared resource on the network. At this time, the information registered on the hard disk or the like on the server machine 3 As described in the embodiment, the display processing may be controlled in a tree structure. Hereinafter, the embodiment will be described.

FIGS. 25 to 29 are diagrams showing examples of information registration processing in an information processing apparatus and a server apparatus according to the fifth embodiment of the present invention. Hereinafter, for example, the client machine 1 or the client machine shown in FIG. Information of a hierarchical structure in a folder managed on the server machine 3
Will be described in the case where it can be used as a network resource. FIG. 25 corresponds to the category display example when the file resources on the client machines 1 and 2 shown in FIG. 1 are registered in the server machine 3 (managed in the three-layer structure shown in the first embodiment). And FIG.
Client machines 1 and 2 in the state shown in FIG.
27 and 28 show the state of the three-layer structure after registering the information of the hierarchical structure in the folder managed on the client machine 2 in the server machine 3 in correspondence with the example of the starting point change processing state. FIG. 29 corresponds to FIG.
FIG. 7 is a diagram showing in detail the state of the network layer among the states of the three-layer structure after registration shown in FIG. 28.

In FIG. 25, W1 is a registration source window, which corresponds to a state in which folders and file contents managed by the client machines 1, 2 and the like are displayed. W2 is a registration destination window corresponding to a state in which categories and the like managed by the server machine 3 are displayed.

Reference numeral W3 denotes a post-registration window. After the target folder TGF selected in the registration source window W1 is dragged and dropped (registration instruction) to the category "Java" of the registration destination window W2, the target folder TGF is stored in the client machine 1. , 2 to the server machine 3, and the contents of the target folder TGF are registered collectively in a state where the hierarchical structure of folders and files managed by the client machines 1, 2 and the like is maintained. The contents of the target folder TGF are stored in the registration source window W
The display control is performed so that the icon displayed in 1 and the icon in the post-registration window W3 have different display forms.

In FIG. 26, a starting point change instruction window W11 is displayed by the user on the client machines 1 and 2 in the state in which the post-registration window W3 shown in FIG. 25 can be displayed as shown in the second embodiment. This shows a state in which the starting point change instruction is performed by a pointing device (not shown) or the like.

W12 is a window after the start point is changed. In the start point change instruction window W11, the category "apiDoc" is displayed.
When "s" is instructed, it shows a tree expanded display state of the category whose origin has been changed.

Hereinafter, the processing of the server machine 3 will be described with reference to FIGS.

When registering the information group shown in FIG. 25, the server machine 3 generates nodes, information capsules, and entities corresponding to the registered information group in three layers as shown in FIGS. 27 to 29. .

In the network layers shown in FIGS. 27 and 28, nodes N90 to N96 correspond to the registered information groups, and a node N6 corresponding to "Java" and a node "doc".
s ”, a node N90 corresponding to“ docs ”, and a node N corresponding to“ apiDocs ”
91, a node N90 and a node N92 corresponding to "guide", and a node N90 and a node N93 corresponding to "install" are bidirectionally linked.
Also, node 91 and node 9 corresponding to “xyz.html”
4. The node 91 and the node 95 corresponding to “zzz.css”, and the node 91 and the node 96 corresponding to “org” are bidirectionally linked.

Further, in the information capsule layer, P
R6, PR90 to PR96 are information capsules corresponding to N6, N90 to N96. Information capsule PR
Reference numeral 94 denotes the location information of “xyz.html” E94 (entity) shown in FIG. 28, and the information capsule PR95 stores “zz” shown in FIG.
z.css "which contains the location information of E95 (entity). The server machine 3 has a hierarchically structured information group in a folder managed on the client machines 1 and 2.
When registration of the information group is instructed from the client machines 1 and 2 and the information group is transferred from the client machines 1 and 2,
The information structure of the hierarchical structure received from the client machines 1 and 2 is stored in the entity layer.

Next, nodes and information capsules are generated in the network layer and the information capsule layer, respectively, for all the folders and files in the stored hierarchical information group. At this time, nodes corresponding to folders and files having a parent-child relationship in the hierarchical structure are generated so as to be linked bidirectionally. The node corresponding to the folder at the top of the hierarchical structure is bidirectionally linked to the node corresponding to the registered category ("Java" in FIGS. 27 to 29).

Further, when generating an information capsule, one corresponding to a folder in the hierarchical structure is generated as a category type, one corresponding to a file is generated as an information type, and the information capsule generated as an information type (see FIG. 27 and 28, PR94 and PR95) correspond to the corresponding files (E94 and E95 in FIGS. 27 and 28).
Insert the location information of That is, the file management program of the server machine 3 automatically registers the hierarchically-structured resources acquired from the client machines 1 and 2 in the storage device 31 according to the above-described three-layer structure.

Hereinafter, referring to FIG. 29, the category "Ja"
N6 corresponding to “va” is, for example, an XML file “e: \ aaa”.
\ rel \ rel66.xml ", N corresponding to the category" docs "
90 is, for example, the XML file “e: \ aaa \ rel \ rel90.xm
l "and N91 corresponding to the category" apiDocs "are, for example, an XML file" e: \ aaa \ rel \ rel91.xml ", and N92 corresponding to the category" guide "are, for example, an XML file" e: \ aaa \ rel \ rel92.xml ". xml ", category" inst
N93 corresponding to the XML file “e:
\ aaa \ rel \ rel93.xml ", category" xyz.html "
N94 corresponding to XML file "e: \ aaa \ rel"
\ rel94.xml "and N95 corresponding to the category" zzz.css "are, for example, XML files" e: \ aaa \ rel \ rel95.xm ".
l ”and N96 corresponding to the category“ org ”are, for example, X
The following describes the nodes and their link relationships, as realized by the ML file “e: \ aaa \ rel \ rel96.xml”.

First, concretely showing the node N6, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "66"><propurl> e: \ aaa \ prop \ prop66 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel22.xml </ link><link> e: \ aaa \ rel \ rel77.xml </ link><link> e: \ aaa \ rel \ rel55.xml </ link><link> e: \ aaa \ rel \ rel88.xml </ link><link> e: \ aaa \ rel \ rel99.xml </ link><link>link> e: \ aaa \ rel \ rel90.xml </ link></relational> and an arrow N6-L indicating a link from N6 to N90
−N90 is “<link> e: \ aaa \ rel \ rel90.xml </ link </ link>
> ”.

When the node N90 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "90"><propurl> e: \ aaa \ prop \ prop90 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel66.xml </ link><link> e: \ aaa \ rel \ rel91.xml </ link><link> e: \ aaa \ rel \ rel92.xml </ link><link> e: \ aaa \ rel \ rel93.xml </ link></relational>, indicating an arrow N90− indicating a link from N90 to N6.
L-N6 is the same as “<link> e: \ aaa \ rel \ rel90.xml </ link </ link>
>, And an arrow N90-L-N91 indicating a link from N90 to N91 is “<link> e: \ aaa \ rel \ rel9
1.xml </ link> ”, and an arrow N90-L-N92 indicating a link from N90 to N92 is“ <link> e: \ a
aa \ rel \ rel92.xml </ link>"and N90 to N9
The arrow N90-L-N93 indicating the link to No. 3 corresponds to the above “<link> e: \ aaa \ rel \ rel93.xml </ link>”.

Further, when the node N91 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "91"><propurl> e: \ aaa \ prop \ prop91 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel90.xml </ link><link> e: \ aaa \ rel \ rel96.xml </ link><link> e: \ aaa \ rel \ rel94.xml </ link> ……………… <link> e: \ aaa \ rel \ rel95.xml </ link></relational> and link from N91 to N90 Arrow N91 indicating
-L-N90 is based on the above "<link> e: \ aaa \ rel \ rel90.xml </
link>", and an arrow N91-L-N96 indicating a link from N91 to N96 is"<link> e: \ aaa \ rel \ r "
el96.xml </ link>, and an arrow N91-L-N94 indicating a link from N91 to N94 is indicated by the above “<link> e:
\ aaa \ rel \ rel94.xml </ link>"and N91 to N
An arrow N91-L-N95 indicating a link to the N.95 corresponds to the above "<link> e: \ aaa \ rel \ rel95.xml </ link>".

Further, when the node N92 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "92"><propurl> e: \ aaa \ prop \ prop92 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel90.xml </ link> ……………… </ relational> and link from N92 to N90 Arrow N92 shown
-L-N90 is based on the above "<link> e: \ aaa \ rel \ rel90.xml </
link> ”.

Further, when the node N93 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "93"><propurl> e: \ aaa \ prop \ prop93 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel90.xml </ link> ……………… </ relational> and link from N93 to N90 Arrow N93 shown
-L-N90 is based on the above "<link> e: \ aaa \ rel \ rel90.xml </
link> ”.

When the node N94 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "94"><propurl> e: \ aaa \ prop \ prop94 .xml </ propurl><terminate> true </ terminate><link> e: \ aaa \ rel \ rel91.xml </ link></relational> and an arrow N94 indicating a link from N94 to N91
−L-N91 is the same as “<link> e: \ aaa \ rel \ rel91.xml </
link> ”.

Further, when the node N95 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "95"><propurl> e: \ aaa \ prop \ prop95 .xml </ propurl><terminate> true </ terminate><link> e: \ aaa \ rel \ rel91.xml </ link></relational> and an arrow N95 indicating a link from N95 to N91
−L-N91 is the same as “<link> e: \ aaa \ rel \ rel91.xml </
link> ”.

Further, when the node N96 is specifically shown, <? Xml version = "1.0" encoding = "euc-jp"?><Relational id = "96"><propurl> e: \ aaa \ prop \ prop96 .xml </ propurl><terminate> false </ terminate><link> e: \ aaa \ rel \ rel91.xml </ link> ……………… </ relational> and link from N95 to N91 Arrow N95 shown
−L-N91 is the same as “<link> e: \ aaa \ rel \ rel91.xml </
link> ”.

[0257] PR6, PR90 to PR96 in the information capsule layer shown in Figs. 27 and 28 will be specifically described below. The information group “docs” having a hierarchical structure registered from the client machine 2 is “e: \ aaa
\ ety \ docs "stored in the server machine 3.

The PR6 corresponding to “Java” is, specifically, <? Xml version = "1.0" encoding = "euc-jp"?><Property delete = "no" id = "66"><person> anonymous </ person><date> 2001/02/23 13:19:04 </ date><title> Java </ title><dataurl></dataurl><memo> About the Java language in general …… </ memo><information> false </ information></property>

The PR90 corresponding to “docs” is, specifically, <? Xml version = "1.0" encoding = "euc-jp"?><Property delete = "no" id = "90"><person> anonymous </ person><date> 2001/03/20 10:10:08 </ date><title> docs </ title><dataurl></dataurl><memo></memo><information> false </ information></property>

PR91 corresponding to “apiDocs”
Is, specifically, <? Xml version = "1.0" encoding = "euc-jp"?><Property delete = "no" id = "66"><person> anonymous </ person><date> 2001 / 03/20 10:10:08 </ date><title> apiDocs </ title><dataurl></dataurl><memo></memo><information> false </ information></property>

[0261] Specifically, the PR92 corresponding to "guide" is, specifically, <? Xml version = "1.0" encoding = "euc-jp"?><Property delete = "no" id = "92"><person> anonymous </ person><date> 2001/03/20 10:10:08 </ date><title> guide </ title><dataurl></dataurl><memo></memo><information> false </ information></property>

PR93 corresponding to “install”
Is, specifically, <? Xml version = "1.0" encoding = "euc-jp"?><Property delete = "no" id = "93"><person> anonymous </ person><date> 2001 / 03/20 10:10:08 </ date><title> installation </ title><dataurl></dataurl><memo></memo><information> false </ information></property>

PR94 corresponding to “xyz.html”
Is, specifically, <? Xml version = "1.0" encoding = "euc-jp"?><Property delete = "no" id = "946"><person> anonymous </ person><date> 2001 / 03/20 10:10:08 </ date><title> xyz. html </ title><dataurl> e: \ aaa \ ety \ docs \ apiDocs \ xyz.html </ dataurl
><memo></memo><information> true </ information></property>

PR95 corresponding to “zzz.css”
Is, specifically, <? Xml version = "1.0" encoding = "euc-jp"?><Property delete = "no" id = "95"><person> anonymous </ person><date> 2001 / 03/20 10:10:08 </ date><title> Programming language </ title><dataurl> e: \ aaa \ ety \ docs \ apiDocs \ zzz.css </ dataurl><memo></memo><information> true </ information></property>

The PR96 corresponding to “org” is, specifically, <? Xml version = "1.0" encoding = "euc-jp"?><Property delete = "no" id = "96"><person> anonymous </ person><date> 2001/03/20 10:10:08 </ date><title> org </ title><dataurl></dataurl><memo></memo><information> false </ information></property>.

As described above, the information group having a hierarchical structure in the folder managed on the client machine 2 is stored in the entity layer in the server machine 3 while maintaining the hierarchical structure. Nodes and information capsules corresponding to each folder and file in the information group are generated in the information capsule layer.

Thus, when registering information managed by the client machines 1 and 2, in particular, information in which folders and files are managed in a predetermined hierarchical structure as shared resources of the network, the hierarchical structure is changed. Maintained and collectively can be registered in a hard disk or the like on the server machine 3 as a resource registration in a three-layer structure, and after registration, as a network resource, expand the file structure into a tree structure at the starting point specified by the user. In addition to being able to be displayed, documents and help files having a relative hierarchical structure such as HTML can be registered in a natural form.

[Seventh Embodiment] In the first embodiment,
The case where the network shared resources are managed in a three-layer structure has been described. However, when information is managed in a three-layer structure with a bidirectional link network structure, a process of deleting registered information occurs. Hereinafter, an example of a unique deletion process in the case of management using a three-layer structure will be described.

In the present embodiment, the file management program 405 deletes only the link between the nodes and leaves the node / information capsule / entity as it is. (A function of deleting each other's link information in each of the two nodes), and in the case of deleting a certain information capsule, one of the second deletion processing function and the two deletion function processing of simultaneously deleting the corresponding node and entity is performed. As a result, there may be a case where the network is divided. In this case, a third deletion processing function for putting the isolated network into the trash can is provided.

[0270] The user can instruct the file management program 405 to select and instruct each deletion request to execute the intended deletion processing effectively.

That is, the file management program 305 in the server machine 3 receives the category or information (node information) deletion instruction from the client machines 1 and 2 based on the instruction.
The network layer in the storage device 31 is updated. At this time, the file management program 305 updates the link information corresponding to the node information instructed to be deleted, and releases the link relation with other node information. As a result, when the node information instructed to be deleted is disconnected from the network, the node information instructed to be deleted and the corresponding information capsule and entity are put in the recycle bin.

In the recycle bin, deleted nodes, information capsules, and entities can be returned to the state before deletion by a "restore instruction" by the user.

It is needless to say that providing separate recycle bins for each deletion function process makes it easier to find what to restore.

Further, when a node, information capsule, or entity in the recycle bin is deleted, the deleted node, information capsule, or entity is deleted from the storage device 31.

In each of the above embodiments, the case where the file search application program on the client side is downloaded from the server machine 3 to the client when necessary is described. It is needless to say that the case in which the software is installed in the software is also within the scope of the present invention.

When a client module independent of a platform is used, a single client module can be used for a client machine, whether it is a personal computer having a different hardware configuration OS or a mobile machine such as a mobile phone. Module management can be performed easily and development costs can be reduced.

Further, in each of the above embodiments, the case where the file search application program on the client side does not depend on the platform has been described. However, after being downloaded on the client machine, the file search application program is converted into a machine language suitable for the platform of the client. It may be configured so that it can be converted, or converted to the optimal state for the client's platform (selecting only the parts that can be executed faster if converted to machine language in the program, selectively converted to machine language suitable for the platform)
That is, a so-called HotSpot technology may be applied.

In each of the above embodiments, the present invention is applied to a plurality of information processing apparatuses (the client machines 1 and 2 shown in FIG. 1).
2. A case has been described where server-client processing is executed in a system composed of the server machine 3). However, server-client processing can be executed on one information processing device. As a result, even in a local environment, files can be managed in the above-described three-layer structure, and, as performed in the above-described server / client system, one piece of information can be simultaneously registered in a plurality of categories or the hierarchical structure can be changed. Excellent file management that can be easily traced from both the parent and child directions can be performed.

It is needless to say that a configuration obtained by effectively combining the configurations of the above embodiments is also within the scope of the present invention.

As described above, without duplicating information or creating information shortcuts, one piece of information can be registered in a plurality of different categories, or any category or information hierarchy displayed in a tree can be changed from parent to child or child. From any direction from the parent to the parent, and by dynamically changing and displaying the tree starting from a certain category or information, it is possible to get a bird's-eye view of the relevance of the category or information .

Hereinafter, the configuration of a data processing program readable by a network system to which the information processing apparatus and the server apparatus according to the present invention can be applied will be described with reference to a memory map shown in FIG.

FIG. 30 is a diagram for explaining a memory map of a storage medium for storing various data processing programs readable by a network system to which the information processing apparatus and server apparatus according to the present invention can be applied.

Although not shown, information for managing a group of programs stored in the storage medium, for example, version information, a creator and the like are also stored, and information dependent on the OS or the like on the program reading side, for example, An icon or the like for identification display may also be stored.

Further, data subordinate to various programs is also managed in the directory. In addition, a program for installing various programs on a computer or a program for decompressing a program to be installed when the program to be installed is compressed may be stored.

The functions shown in FIGS. 18 to 21 in this embodiment may be performed by a host computer by a program installed from the outside.
In this case, the present invention is applied even when a group of information including a program is supplied to the output device from a storage medium such as a CD-ROM, a flash memory, or an FD, or from an external storage medium via a network. Things.

As described above, the storage medium storing the program code of the software for realizing the functions of the above-described embodiments is supplied to the system or the apparatus, and the computer (or CPU or MP) of the system or the apparatus is supplied.
It goes without saying that the object of the present invention is also achieved when U) reads and executes the program code stored in the storage medium.

In this case, the program code itself read from the storage medium realizes the novel function of the present invention, and the storage medium storing the program code constitutes the present invention.

As a storage medium for supplying the program code, for example, a floppy (registered trademark) disk, hard disk, optical disk, magneto-optical disk, C
D-ROM, CD-R, DVD-ROM, magnetic tape,
A non-volatile memory card, ROM, EEPROM, or the like can be used.

When the computer executes the readout program code, not only the functions of the above-described embodiments are realized, but also the OS (Operating System) running on the computer based on the instructions of the program code. ) And the like perform part or all of the actual processing, and the processing realizes the functions of the above-described embodiments.

Further, after the program code read from the storage medium is written into a memory provided in a function expansion board inserted into the computer or a function expansion unit connected to the computer, based on the instruction of the program code, The CPU provided in the function expansion board or function expansion unit performs part or all of the actual processing,
It goes without saying that a case where the function of the above-described embodiment is realized by the processing is also included.

Further, the present invention may be applied to a system composed of a plurality of devices or an apparatus composed of one device. Needless to say, the present invention can be applied to a case where the present invention is achieved by supplying a program to a system or an apparatus. In this case, by reading a storage medium storing a program represented by software for achieving the present invention into the system or the apparatus, the system or the apparatus can enjoy the effects of the present invention. .

Further, by reading and reading a program represented by software for achieving the present invention from a database on a network by a communication program, the system or apparatus can be
It is possible to enjoy the effects of the present invention.

[0293]

As described above, according to the first, ninety-third to ninety-fifth aspects of the present invention, the first layer structure for managing the link relation of any number of arbitrarily linkable node information, A second layer structure for managing the location of an entity corresponding to the arbitrary node information; and a third layer structure for managing the entity.
Layer structure of the information, the link relationship of the information and the entity of the information itself can be managed independently, even if the link relationship between the information or the entity is changed,
The change can be easily reflected on all associated information.

According to the second aspect, among the arbitrary number of node information, two linked node information are bidirectionally linked, so that a plurality of linked information can be easily read from any direction. Can be traced to.

[0295] According to the third invention, the node information is:
Since the information corresponds to either the information having the entity or the category of the information, the information can be easily associated with a plurality of different categories without duplicating the entity of the information.

According to the fourth to seventh aspects, since the second layer structure manages the attribute information of the node information,
The information link relationship, the information attribute, and the entity of the information itself can be managed independently. Even if the link relationship, the attribute, and the entity between the information are changed, all of the changes associated with the change can be managed. Information can be easily reflected.

According to the eighth aspect, since the entity managed by the third layer can be arranged on a network, a plurality of pieces of information arranged on a network such as the Internet or an intranet can be freely associated with each other. And can be easily managed.

The ninth, twelfth to twenty-fourth, thirty-seventh, and twentieth aspects of the present invention.
According to the inventions of 2 to 50, 65, 70 to 78, and 96 to 102, the first layer structure that manages the link relationship of any number of node information that can be arbitrarily linked, and corresponds to the arbitrary node information The data structure stored in the storage means capable of managing the shared resources by the second layer structure for managing the location of the entity and the third layer structure for managing the entity is included in the data acquisition request from the information processing apparatus. The display data for displaying the data structure of the shared resource is generated with reference to the information processing device, and the generated display data is transferred to the information processing device. Therefore, the display data is managed in a specific data structure on the server device. The association of the shared resources can be displayed on the information processing device in a predetermined format.

According to the tenth, thirty-sixth, and sixty-sixth aspects of the present invention, the generation unit refers to a data structure stored in the storage unit based on a data acquisition request from the information processing device. Since the display data for tree-displaying the data structure of the shared resource is generated, the relevance of the shared resource managed by the specific data structure on the server device can be tree-displayed on the information processing device.

[0300] According to the eleventh, thirty-ninth, and sixty-seventh aspects of the present invention, based on a data acquisition request from the information processing device, the generation means may add arbitrary viewpoint information added to the data acquisition request. Focusing attention, the node information is searched based on the viewpoint information to generate display data for displaying a tree structure of the data structure of the shared resource, so that the user can determine the relevance of the shared resource managed by the specific data structure. Can be displayed on the information processing apparatus as a tree starting from the desired viewpoint.

[0301] According to the twelfth, forty-sixth, and sixty-sixth aspects of the present invention, the resources acquired from the information processing apparatus are allocated to the first
Since information is automatically registered as a shared resource in the storage means according to the third layer structure, information of a hierarchical structure managed by the information processing apparatus can be easily registered as a shared resource of a specific data structure.

According to the thirteenth, forty-first and forty-ninth aspects of the present invention, when updating the first layer structure of the storage means based on a node deletion instruction acquired from the information processing apparatus, Since the link information corresponding to the specified node is updated and the link relation with other node information is released, the relevance of the shared resource managed by the specific data structure can be easily changed.

According to the twenty-third, twenty-seventh to thirty-sixth, 51,
According to the invention of 55-64, 79, 83-92, display data for displaying the data structure of the shared resource generated in the server device is acquired based on the data acquisition request, and the acquired display is acquired. Since the data structure of the shared resource is displayed as a tree on the display means based on the data, the relevance of the shared resource managed by the specific data structure can be displayed as a tree on the information processing apparatus.

The twenty-fourth, twenty-fifth, fifty-second, fifty-third,
According to the inventions of 80 and 81, the data acquisition request includes information designating arbitrary node information in a shared resource managed by the server device in a specific data structure, and the display control means includes: Since the data acquisition request is issued to the server device again from the viewpoint of the information specified in the data structure displayed in the tree structure on the means, the relevance of the shared resource managed by the specific structure data structure is started from the user's desired viewpoint. The information can be displayed on the information processing apparatus as a set tree.

According to the twenty-sixth, fifty-second, and eighty-sixth inventions, a resource managed in an information processing apparatus is instructed to register with the server apparatus, and the resource instructed to be registered is used as a shared resource by the server apparatus. Therefore, information of a hierarchical structure managed by the information processing apparatus can be easily registered as a shared resource of a specific data structure.

Accordingly, without duplicating information or creating shortcuts, one piece of information can be registered in a plurality of different categories, or any category or information hierarchy displayed in a tree can be changed from parent to child or from child to parent. An excellent network that can search freely in any direction, dynamically change and display the tree starting from a certain category or information, and provide a bird's-eye view of the relevance of the category or information For example, it is possible to provide a shared resource management environment.

[Brief description of the drawings]

FIG. 1 is a block diagram illustrating an example of a network system to which an information processing device and a server device according to a first embodiment of the present invention can be applied.

FIG. 2 is a diagram illustrating a software module configuration of the server machine illustrated in FIG. 1;

FIG. 3 is a diagram illustrating a configuration of a file management program shown in FIG. 2;

FIG. 4 is a diagram illustrating a software configuration of the client machine illustrated in FIG. 1;

FIG. 5 is a diagram illustrating a structure of an information management system in the server device according to the present invention.

FIG. 6 is a diagram showing an example of bidirectional network type data managed by the server machine shown in FIG. 1;

7 is a diagram illustrating an example of a network layer of the bidirectional network type data illustrated in FIG. 6;

FIG. 8 is a diagram illustrating an example of a user interface displayed on a display of the client machine illustrated in FIG. 1;

FIG. 9 is a diagram illustrating an example of a user interface displayed on a display of the client machine illustrated in FIG. 1;

FIG. 10 is a diagram illustrating an example of a user interface displayed on a display of the client machine illustrated in FIG. 1;

FIG. 11 is a diagram illustrating a dynamic tree display processing state in the information processing apparatus according to the second embodiment of the present invention.

FIG. 12 is a diagram illustrating a dynamic tree display processing state in the information processing apparatus according to the second embodiment of the present invention.

FIG. 13 is a diagram illustrating a dynamic tree display processing state in the information processing apparatus according to the second embodiment of the present invention.

FIG. 14 is a diagram illustrating an example of a tree structure displayed on a display of the client machine illustrated in FIG. 1;

FIG. 15 is a diagram illustrating an example of tree information created on a memory of the server machine illustrated in FIG. 1;

FIG. 16 is a diagram illustrating an example of tree information created on a memory of the server machine illustrated in FIG. 1;

FIG. 17 is a schematic diagram showing a process of displaying information under “C ++” from the state shown in FIG. 14;

FIG. 18 is a flowchart illustrating an example of a first data processing procedure in the information processing apparatus (client machine) according to the present invention.

FIG. 19 is a flowchart illustrating an example of a first data processing procedure in the server device according to the present invention.

FIG. 20 is a flowchart illustrating an example of a second data processing procedure in the server device according to the present invention.

FIG. 21 is a flowchart illustrating an example of a second data processing procedure in the information processing apparatus (client machine) according to the present invention.

FIG. 22 is a diagram illustrating an example of a tree display form in the information processing apparatus according to the third embodiment of the present invention.

FIG. 23 shows an information processing apparatus according to a fourth embodiment of the present invention,
FIG. 4 is a diagram illustrating an example of XML data exchanged by a server device.

FIG. 24 is a diagram illustrating a tree display processing state in the information processing device and the server device according to the fifth embodiment of the present invention.

FIG. 25 is an information processing apparatus according to a fifth embodiment of the present invention,
It is a figure showing the example of information registration processing in a server device.

FIG. 26 is an information processing apparatus according to a fifth embodiment of the present invention,
It is a figure showing the example of information registration processing in a server device.

FIG. 27 is an information processing apparatus according to a fifth embodiment of the present invention,
It is a figure showing the example of information registration processing in a server device.

FIG. 28 is an information processing apparatus according to a fifth embodiment of the present invention,
It is a figure showing the example of information registration processing in a server device.

FIG. 29 is an information processing apparatus according to a fifth embodiment of the present invention,
It is a figure showing the example of information registration processing in a server device.

FIG. 30 is a diagram illustrating a memory map of a storage medium that stores various data processing programs that can be read by a network system to which the information processing device and the server device according to the present invention can be applied.

[Explanation of symbols]

 1, 2 Client machine 3 Server machine 11, 21 Display 12, 22, 32 Control unit 31 Hard disk (storage device) 311 Entity information 312 Related information 313 Information capsule information

──────────────────────────────────────────────────続 き Continued on the front page (51) Int.Cl. ⁷ Identification symbol FI Theme coat ゛ (Reference) G06F 3/14 310 G06F 3/14 310A 320 320A 17/30 110 17/30 110F 310 310B 414 414Z (72) Inventor Tomoaki Kuramochi 3-9-7 Mita, Minato-ku, Tokyo Inside Canon Software Co., Ltd. (72) Inventor Nobuyuki Ohama 3-9-7 Mita, Minato-ku, Tokyo Canon Software Inc. F-term (reference) 5B069 AA02 BB16 DD01 LA03 5B075 KK07 NK43 NK44 NR06 NR20 PP03 PP13 PQ02 PQ42 5B082 BA05 EA01 EA07 EA09 EA10 GC02 GC04 5E501 AA01 AC20 AC22 AC33 AC35 BA05 CC17 DA04 FA04 FA22 FA44

Claims (102)

[Claims] A first layer structure that manages a link relationship of an arbitrary number of node information that can be arbitrarily linked; a second layer structure that manages a location of an entity corresponding to the arbitrary node information; A third layer structure for managing entities. 2. The data structure according to claim 1, wherein, of the arbitrary number of node information, two linked node information are bidirectionally linked. 3. The data structure according to claim 1, wherein the node information corresponds to one of information having a substance and a category of the information. 4. The apparatus according to claim 1, wherein the second layer structure manages attribute information of the node information.
The data structure according to any of the above. 5. The data structure according to claim 4, wherein the attribute information includes information indicating whether the node information corresponds to the information or the category. 6. The attribute information according to claim 4, wherein the attribute information includes information that summarizes the entity or the category.
The described data structure. 7. The attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and information of a registrant of the node information in the first layer structure. The data structure according to any one of claims 4 to 6, wherein 8. The data structure according to claim 1, wherein the entity managed by the third layer structure can be arranged on a network. 9. A server device capable of communicating with a plurality of information processing devices via a predetermined communication medium, wherein: a first layer structure for managing a link relationship of an arbitrary number of node information that can be arbitrarily linked; A second layer structure that manages the location of the entity corresponding to the node information of the first item, a storage unit that can manage shared resources with a third layer structure that manages the entity, and a data acquisition request from the information processing apparatus. Generating means for generating display data for displaying the data structure of the shared resource with reference to the data structure stored in the storage means, based on the information, and processing the display data generated by the generating means to the information processing. A server device, comprising: transfer means for transferring the data to a device. 10. A display data for displaying a data structure of the shared resource in a tree by referring to a data structure stored in the storage unit based on a data acquisition request from the information processing device. 10. The server device according to claim 9, wherein 11. The generating means, based on a data acquisition request from the information processing device, focuses on any viewpoint information added to the data acquisition request, and converts the node information based on the viewpoint information. 10. The server device according to claim 9, wherein display data for searching and displaying the data structure of the shared resource in a tree is generated. 12. A storage device according to claim 9, further comprising a registration unit for automatically registering a resource acquired from said information processing apparatus as a shared resource in a storage unit according to said first to third layer structures. A server device according to item 1. 13. An updating unit for updating a first layer structure of the storage unit based on a node deletion instruction acquired from the information processing apparatus, wherein the updating unit corresponds to a node instructed to delete. The server device according to any one of claims 9 to 12, wherein the link information is updated to cancel the link relationship with other node information. 14. The server device according to claim 9, wherein the display data generated by said generating means is expressed in a structured format. 15. The server device according to claim 14, wherein the structured format includes XML. 16. The server device according to claim 9, wherein the two pieces of linked node information among the arbitrary number of node information are linked bidirectionally. 17. The server device according to claim 9, wherein the node information corresponds to one of information having a substance and a category of the information. 18. The apparatus according to claim 9, wherein said second layer structure manages attribute information of said node information.
18. The server device according to any one of 17. 19. The attribute information, wherein the node information is:
19. The server device according to claim 18, wherein the server device includes information indicating which of the information and the category corresponds. 20. The server device according to claim 18, wherein the attribute information includes information that summarizes the entity or category. 21. The attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and information of a registrant of the node information in the first layer structure. The server device according to any one of claims 18 to 20, wherein: 22. The server according to claim 9, wherein the entity managed by the third layer structure is managed so as to be referred to on a network accessible by the server device. apparatus. 23. An information processing apparatus capable of communicating with a server device capable of managing a shared resource with a specific data structure via a predetermined communication medium, the information processing device comprising: Acquisition means for acquiring display data for displaying a data structure, and display control means for displaying a data structure of the shared resource in a tree on the display means based on the display data acquired by the acquisition means. Characteristic information processing device. 24. The information processing apparatus according to claim 23, wherein the data acquisition request includes information indicating arbitrary node information in a shared resource managed by the server device in a specific data structure. . 25. The display control device according to claim 23, wherein the display control unit issues a data acquisition request to the server again using the information specified in the data structure displayed as a tree on the display unit as a viewpoint. Information processing device. 26. An instruction unit for instructing the server device to register a resource managed in the information processing apparatus, and a transfer unit for transferring the resource registered and instructed by the instruction unit to the server device as a shared resource. The information processing apparatus according to any one of claims 23 to 25, comprising: 27. The information processing apparatus according to claim 23, wherein the display data obtained by the obtaining unit from the server device is expressed in a structured format. 28. The information processing apparatus according to claim 27, wherein said structured format includes XML. 29. The specific data structure is a first data structure for managing a link relationship of an arbitrary number of node information that can be arbitrarily linked.
29. The apparatus according to claim 23, further comprising: a second layer structure for managing the location of an entity corresponding to the arbitrary node information; and a third layer structure for managing the entity. An information processing device according to any one of the above. 30. The information processing apparatus according to claim 29, wherein, of the arbitrary number of node information, two linked node information are bidirectionally linked. 31. The information processing apparatus according to claim 29, wherein the node information corresponds to one of information having a substance and a category of the information. 32. The method according to claim 29, wherein the second layer structure manages attribute information of the node information.
32. The information processing apparatus according to any one of -31. 33. The attribute information, wherein the node information is:
The information processing apparatus according to claim 32, further comprising information indicating which of the information and the category corresponds to the information. 34. The information processing apparatus according to claim 32, wherein the attribute information includes information that summarizes the entity or the category. 35. The attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and information of a registrant of the node information in the first layer structure. 35. The information processing apparatus according to claim 32, wherein: 36. The entity managed by the third layer structure is managed so as to be referred to on a network accessible by a server device.
An information processing device according to any one of the above. 37. A first layer structure that can communicate with a plurality of information processing apparatuses via a predetermined communication medium and manages a link relationship of an arbitrary number of node information that can be arbitrarily linked; In a control method of a server device having a storage unit capable of managing shared resources by a second layer structure for managing the location of an entity corresponding to information and a third layer structure for managing the entity, the information processing apparatus Generating a display data for displaying a data structure of the shared resource with reference to a data structure stored in the storage unit based on a data acquisition request from the storage unit; and A method for controlling a server device, comprising: a transfer step of transferring data to an information processing device. 38. A display data for displaying a data structure of the shared resource in a tree form by referring to a data structure stored in the storage unit based on a data acquisition request from the information processing device. 38. The control method of a server device according to claim 37, wherein: 39. The generating step, based on a data acquisition request from the information processing apparatus, focuses on any viewpoint information added to the data acquisition request, and converts the node information based on the viewpoint information. 38. The method according to claim 37, further comprising: generating display data for searching and displaying a tree structure of the data structure of the shared resource. 40. The apparatus according to claim 37, further comprising a registration step of automatically registering a resource acquired from said information processing apparatus as a shared resource in a storage unit in accordance with said first to third layer structures. The control method of a server device according to claim 1. 41. An updating step of updating a first layer structure of the storage unit based on a node deletion instruction acquired from the information processing apparatus, wherein the updating step corresponds to a node instructed to delete. 41. The control method of a server device according to claim 37, wherein the link information is updated to release the link relation with other node information. 42. The control method for a server device according to claim 37, wherein the display data generated in said generating step is expressed in a structured format. 43. The method according to claim 42, wherein the structured format includes XML. 44. The control method for a server device according to claim 37, wherein two linked node information of the arbitrary number of node information are linked bidirectionally. . 45. The method according to claim 37, wherein the node information corresponds to one of information having a substance and a category of the information. 46. The apparatus according to claim 37, wherein the second layer structure manages attribute information of the node information.
45. The control method for a server device according to any one of items 45 to 45. 47. The attribute information, wherein the node information is
47. The control method for a server device according to claim 46, further comprising information indicating which of the information and the category corresponds. 48. The method according to claim 46, wherein the attribute information includes information that summarizes the entity or category. 49. The attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and information of a registrant of the node information in the first layer structure. The method for controlling a server device according to any one of claims 46 to 48, characterized in that: 50. An entity managed by the third layer structure is managed so as to be referred to on a network accessible by a server device.
The control method of a server device according to any one of the above. 51. A method for controlling an information processing device capable of communicating with a server device capable of managing shared resources with a specific data structure via a predetermined communication medium, wherein the server device generates the server device based on a data acquisition request. An acquisition step of acquiring display data for displaying a data structure of the shared resource; and a display step of displaying the data structure of the shared resource in a tree on a display means based on the acquired display data. Control method for an information processing apparatus. 52. The information processing apparatus according to claim 51, wherein the data acquisition request includes information indicating arbitrary node information in a shared resource managed by the server apparatus in a specific data structure. Control method. 53. The information according to claim 51, wherein, in the displaying step, a data acquisition request is issued to the server device again from the viewpoint of information specified in a data structure displayed in a tree on the display means. A method for controlling a processing device. 54. An instruction step of instructing the server device to register a resource managed in the information processing apparatus, and a transfer step of transferring the resource registered and instructed in the instruction step to the server apparatus as a shared resource. The control method for an information processing device according to any one of claims 51 to 53, comprising: 55. The control method for an information processing device according to claim 51, wherein the display data obtained from the server device in the obtaining step is expressed in a structured format. 56. The method according to claim 55, wherein the structured format includes XML. 57. The specific data structure is a first data structure for managing a link relationship of an arbitrary number of node information that can be arbitrarily linked.
57. A layer structure according to claim 51, further comprising a second layer structure for managing the location of an entity corresponding to the arbitrary node information, and a third layer structure for managing the entity. A control method for an information processing device according to any one of the above. 58. The control method for an information processing apparatus according to claim 57, wherein, of the arbitrary number of node information, two linked node information are linked bidirectionally. 59. The method according to claim 57, wherein the node information corresponds to one of information having a substance and a category of the information. 60. The apparatus according to claim 57, wherein the second layer structure manages attribute information of the node information.
60. The control method for an information processing apparatus according to any one of claims to 59. 61. The attribute information, wherein the node information is:
The control method for an information processing apparatus according to claim 60, further comprising information indicating which of the information and the category corresponds. 62. The method according to claim 60, wherein the attribute information includes information that summarizes the entity or category. 63. The attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and information of a registrant of the node information in the first layer structure. The method for controlling an information processing apparatus according to any one of claims 60 to 62, characterized in that: 64. The entity managed by the third layer structure is managed so as to be referred to on a network accessible by a server device.
The control method for an information processing device according to any one of the above. 65. A first layer structure that can communicate with a plurality of information processing apparatuses via a predetermined communication medium and manages a link relationship of an arbitrary number of node information that can be arbitrarily linked, and the arbitrary node A server device having storage means capable of managing shared resources with a second layer structure for managing the location of an entity corresponding to information and a third layer structure for managing the entity, wherein data from the information processing device A generation step of generating display data for displaying a data structure of the shared resource with reference to a data structure stored in the storage unit based on the acquisition request; and generating the display data by the information processing apparatus. And a program for executing the transfer step. 66. A display data for displaying a data structure of the shared resource in a tree by referring to a data structure stored in the storage unit based on a data acquisition request from the information processing device. 66. The program according to claim 65, wherein the program is generated. 67. The generating step, based on a data acquisition request from the information processing apparatus, focuses on any viewpoint information added to the data acquisition request, and converts the node information based on the viewpoint information. 66. The program according to claim 65, wherein the program generates a display data for tree-displaying the data structure of the shared resource by searching. 68. The apparatus according to claim 65, further comprising a registration step of automatically registering a resource acquired from said information processing apparatus as a shared resource in a storage unit according to said first to third layer structures. The program described in. 69. An updating step of updating a first layer structure of the storage unit based on a node deletion instruction obtained from the information processing apparatus, wherein the updating step corresponds to a node instructed to delete. The program according to any one of claims 65 to 68, wherein the link information is updated to cancel the link relation with other node information. 70. The program according to claim 65, wherein the display data generated in said generating step is expressed in a structured format. 71. The program according to claim 70, wherein said structured format includes XML. 72. The program according to any one of claims 65 to 71, wherein, of the arbitrary number of node information, two linked node information are linked bidirectionally. 73. The program according to claim 65, wherein the node information corresponds to one of information having a substance and a category of the information. 74. The apparatus according to claim 65, wherein the second layer structure manages attribute information of the node information.
73. The program according to any one of -73. 75. The attribute information, wherein the node information is:
The program according to claim 74, further comprising information indicating which of the information and the category corresponds to the information. 76. The program according to claim 74, wherein the attribute information includes information that summarizes the entity or category. 77. The attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and information of a registrant of the node information in the first layer structure. The program according to any one of claims 74 to 76, characterized in that: 78. The entity managed by the third layer structure is managed so as to be referred to on a network accessible by a server device.
The program according to any of the above. 79. An information processing apparatus capable of communicating with a server device capable of managing the shared resource with a specific data structure via a predetermined communication medium, based on the data acquisition request, the shared resource generated by the server device. A program for executing an acquisition step of acquiring display data for displaying a data structure, and a display step of displaying a data structure of the shared resource in a tree on a display means based on the acquired display data. 80. The program according to claim 79, wherein said data acquisition request includes information designating arbitrary node information in a shared resource managed by said server device in a specific data structure. 81. The program according to claim 79, wherein in the displaying step, a data acquisition request is issued to the server device again from the viewpoint of information specified in a data structure displayed in a tree on the display means. . 82. An instruction step of instructing the server apparatus to register a resource managed in the information processing apparatus, and a transfer step of transferring the resource registered and instructed in the instruction step to the server apparatus as a shared resource. The program according to any one of claims 79 to 81, wherein the program is provided. 83. The program according to claim 79, wherein the display data obtained from the server device in the obtaining step is expressed in a structured format. 84. The program according to claim 83, wherein said structured format includes XML. 85. The first data structure manages a link relationship of an arbitrary number of node information that can be arbitrarily linked.
85. A device according to claim 79, further comprising a second layer structure for managing the location of an entity corresponding to the arbitrary node information, and a third layer structure for managing the entity. The program described in any of them. 86. The program according to claim 85, wherein, of the arbitrary number of node information, two linked node information are bidirectionally linked. 87. The program according to claim 85, wherein the node information corresponds to one of information having a substance and a category of the information. 88. The apparatus according to claim 85, wherein the second layer structure manages attribute information of the node information.
90. The program according to any one of -87. 89. The attribute information, wherein the node information is:
The program according to claim 88, further comprising information indicating which of the information and the category corresponds. 90. The program according to claim 88, wherein said attribute information includes information summarizing said entity or category. 91. The attribute information includes a title of the node information, a registration date and time of the node information in the first layer structure, and information of a registrant of the node information in the first layer structure. The program according to any one of claims 88 to 90, wherein: 92. The program according to claim 85, wherein said entity managed by said third layer structure is managed so as to be referred to on a network accessible by a server device. 93. The data structure according to claim 1, wherein said data structure is a first to third layer structures that can be specified by a computer. 94. The first to third layer structures of each entity managed by the second layer structure by referring to node information managed by the first layer structure by the computer. The location information can be specified, and the entity managed in the third layer structure can be specified by referring to the location information of each entity managed in the specified second layer structure. Claim 9
3. Data structure according to 3. 95. The first layer structure specifies other node information linked to the node information by referring to any node information managed by the first layer structure by the computer. The data structure according to claim 93 or 94, wherein the data structure is possible. 96. The generating means specifies location information of each entity managed by the second layer structure by referring to node information managed by the first layer structure, and the specified information is specified. 23. The entity managed by the third layer structure is specified by referring to the location information of each entity managed by the second layer structure. Server device. 97. The method according to claim 97, wherein the generation unit specifies another node information linked to the node information by referring to any one of the node information managed by the first layer structure. Item 70. The server device according to any one of Items 9 to 22, 96. 98. In the generating step, the location information of each entity managed in the second layer structure is specified by referring to node information managed in the first layer structure, and the specified information is specified. 51. An entity managed in the third layer structure is specified by referring to location information of each entity managed in the second layer structure. Control method of server device. 99. The generating step specifies another node information linked to the node information by referring to any node information managed in the first layer structure. Item 40. The control method for a server device according to any one of Items 37 to 50, 98. 100. The generating step specifies location information of each entity managed by the second layer structure by referring to node information managed by the first layer structure, and specifies the location information. 51. An entity managed by the third layer structure is specified by referring to location information of each entity managed by the second layer structure. program. 101. The method according to claim 101, wherein the generation step specifies other node information linked to the node information by referring to any node information managed in the first layer structure. The program according to any one of Items 37 to 50, 100. 102. Claims 65 to 92, 100, 101
A computer-readable recording medium that records the program according to any one of the above.