WO2007049388A1 - Appareil et procede d'intermediation de recherche, systeme de recherche decentralise, appareil de decentralisation et son procede de commande - Google Patents

Appareil et procede d'intermediation de recherche, systeme de recherche decentralise, appareil de decentralisation et son procede de commande Download PDF

Info

Publication number
WO2007049388A1
WO2007049388A1 PCT/JP2006/315334 JP2006315334W WO2007049388A1 WO 2007049388 A1 WO2007049388 A1 WO 2007049388A1 JP 2006315334 W JP2006315334 W JP 2006315334W WO 2007049388 A1 WO2007049388 A1 WO 2007049388A1
Authority
WO
WIPO (PCT)
Prior art keywords
search
processor
processors
mediating apparatus
result
Prior art date
Application number
PCT/JP2006/315334
Other languages
English (en)
Japanese (ja)
Inventor
Chisato Numaoka
Original Assignee
Sony Computer Entertainment Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sony Computer Entertainment Inc. filed Critical Sony Computer Entertainment Inc.
Publication of WO2007049388A1 publication Critical patent/WO2007049388A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/951—Indexing; Web crawling techniques

Definitions

  • Search mediation apparatus search mediation method, distributed search system, distributed processing apparatus, and distributed processing apparatus control method
  • the present invention relates to a search mediating device, a search mediating method, a distributed search system, a distributed processing device, and a control method for the distributed processing device, and more particularly to distributed processing such as search using a multiprocessor.
  • Patent Document 1 discloses a parallel processing system that searches a text base at high speed.
  • this system includes a plurality of search servers 2 that perform search processing and a search management server 1 for managing the operations of the plurality of search servers.
  • Server 1 divides all relevant information based on the text base to be searched and the relevant text base, and combines the divided parts of the text base and related information corresponding to the divided parts into a plurality of searches. Assign to some or all of Server 2.
  • Each search server 2 performs an information search for the text-based divided portion allocated by the search management server 1 in parallel and independently.
  • Patent Document 2 a search request for data stored in a plurality of secondary storage devices 5 is sent to a plurality of servers operating on a plurality of processors 4.
  • a database management device 3 that performs load balancing of IZO and CPU by processing in parallel using processes and enables a reduction in response time.
  • Patent Document 3 As shown in FIG. 5C, a plurality of data bases that are distributed and accessible by the client 6 through one or more search servers 7 are also disclosed. A method for efficiently searching for source 8 is disclosed.
  • the index search unit 15 searches the database, and the P2P search unit 16 registers the peer-to-peer search for the peer node 21 that can be reached from the server 13 in the registered root node 17. Run through route node 20.
  • Patent Document 1 Japanese Patent Laid-Open No. 9-134364
  • Patent Document 2 Japanese Patent Laid-Open No. 9-305631
  • Patent Document 3 Japanese Patent Laid-Open No. 10-21250
  • Patent Document 4 U.S. Patent No. 6636854
  • the present invention has been made in view of the above problems, and one of its purposes is a search mediating apparatus capable of requesting a part of search processing to a computer with established trust relationship, search mediation A method and distributed search system are provided.
  • Another object of the present invention is to provide a distributed processing device capable of promptly confirming the existence of a trust relationship with a computer when processing such as search is distributed to a plurality of computers. It is to provide a method for controlling a distributed processing apparatus.
  • a search mediating apparatus is a search mediating apparatus that starts a search according to a search request from a client accompanied by search target information and outputs a search result.
  • a multi-processor including two or more processors each storing a secret key and a search engine having a search engine that is authenticated based on at least one of the two or more processors and the secret key stored in the processor
  • a search target information transmitting means for transmitting to the device at least a part of the search target information related to an ID stored in the processor; a search result receiving means for receiving a search result from the search device; It is characterized by providing.
  • the search mediating apparatus is a search mediating apparatus that starts a search in accordance with a search request from a client with search target information and outputs a search result, each storing an ID and a secret key.
  • At least one search device comprising: a multiprocessor including two or more processors; and a search engine authenticated based on a secret key stored in each of at least two of the two or more processors.
  • Search target information transmitting means for transmitting at least a part of the search target information related to the ID stored in the processor, and search result reception in which each of the at least two processors receives a search result from the search device.
  • search result integration means for integrating the search results received by each of the at least two processors.
  • a search mediating apparatus includes a search request one-chip multiprocessor that makes a search request to at least one search apparatus, and a database that indexes search results of the at least one search apparatus. And a search result integration one-chip multiprocessor integrated into the system.
  • a search mediating apparatus is a search mediating apparatus that makes a search request to a plurality of computers connected via a network in accordance with a search request from a client.
  • Determining means for determining whether each computer is a trusted computer or an untrusted computer based on the presence or absence of an authentication process with each computer; and a high reliability test for displaying an answer from the trusted computer.
  • Search result display means, and low reliability search result display means for displaying an answer from the unreliable computer separately from the display by the high reliability search result display means.
  • the distributed search system is a distributed search system having a plurality of search devices operating in a distributed environment, wherein at least one search request device, at least one search mediating device, and at least two search devices.
  • the search intermediary device includes a multiprocessor including at least two or more processors, and at least one processor included in the multiprocessor is one of the at least two or more search devices. After establishing a trust relationship with at least one, the search requesting device performs a search according to the received search request.
  • the distributed processing device is connected to a plurality of computers via a network, and a plurality of distributed processing devices that request each part of given processing from the computers.
  • a plurality of processors each including a memory for storing at least authentication information, and each of the plurality of processors is based on the authentication information stored in a memory provided in the processor. After performing the authentication process with at least one of the computers, a part of the given process is requested to the at least one computer.
  • FIG. 1 is a hardware configuration diagram of a computer used as a search mediating apparatus according to an embodiment of the present invention.
  • FIG. 2 is a configuration example of a sub processor provided in the computer shown in FIG.
  • FIG. 3 is a diagram showing an example of a search system.
  • FIG. 4 is a diagram illustrating a configuration example of a peer node.
  • FIG. 7 is a diagram showing another example of the search system.
  • FIG. 8 is a protocol diagram of search processing applied to the system shown in FIG.
  • FIG. 9 is a flowchart of peer node selection / authentication 'registration processing.
  • FIG. 10 is a diagram showing an example of a trust relationship between peer nodes included in the search system according to the present embodiment.
  • FIG. 11 is a flowchart of a piano selection “authentication” registration process when one sub-processor performs authentication with a plurality of peer nodes.
  • FIG. 12 A diagram showing a configuration example of a piano keyboard access table when one sub-processor performs authentication with a plurality of peer nodes.
  • FIG. 13 is a diagram showing an example of a search interface (user interface).
  • FIG. 14 is a flowchart showing an example of search processing.
  • FIG. 15 is a diagram showing another example of a trust relationship between peer nodes included in the search system according to the present embodiment.
  • FIG. 16 is a flowchart of peer node selection / authentication / registration processing when one sub-processor authenticates with a plurality of peer nodes and also makes a search request to a peer node having no trust relationship.
  • FIG. 17 is a diagram showing a configuration example of a peer node access table when one sub-processor authenticates with a plurality of peer nodes and also makes a search request to a peer node having no trust relationship.
  • FIG. 18 A diagram showing an example of a search interface when one sub-processor authenticates with a plurality of peer nodes and also makes a search request to a peer node having no trust relationship.
  • FIG. 19 is a diagram showing a device configuration example of a search mediating apparatus according to the present embodiment.
  • FIG. 20 is a diagram showing a conventional distributed / parallel search.
  • FIG. 21 is a diagram showing a conventional peer-to-peer search.
  • FIG. 1 is a system configuration example of a computer 31 used as a search relay device using the one-chip multi-core processor 32 used in the present invention.
  • the one-chip multicore processor 32 includes a main processor 39 having a processor core 40, sub-processors 33a to 33h having a processor core 34, an lZ interface 48, and a memory controller.
  • a total of 11 processing elements (information processing means) called “La 46” are coupled to the ring bus 45 and are configured to operate in parallel.
  • each processing element is uniquely identified (identified) on the ring bus 45 by an ID such as “SPE1”, for example, which element sends a request to which element via the ring bus 45. ! / Can be specified.
  • the memory controller 46 is coupled to the main memory 47 and mediates each processing element accessing the main memory 47.
  • the main memory 47 is drawn outside the one-chip multi-core processor 32, but the main memory 47 may be included inside the one-chip multi-core processor 32.
  • the main processor 39 and sub-processors can be connected by connecting a graphics card 55 with a bridge 49 and frame memory 56 and controlling the display output to the monitor 57, and an RF processing unit 59 that enables wireless communication using the antenna 61. 33 can control external devices and exchange data through communication with external devices.
  • This system is connected to a data communication network via a network interface 50, and the main processor 42 and the sub processor 33 can communicate with various devices on the network independently of each other.
  • the received signal acquired by the RF processing unit 59 is frequency-converted by the down converter 60, converted to digital data by the AD converter 58, and then supplied to the IO interface 48.
  • Each of the sub processors 33 includes a core 34, a local storage (LS) 35, a memory flow controller (MFC) 36 including a DMAC (Dict Memory Access Controller) 37, and a secure memory 38 including a secret key. It is included as a component.
  • the secure memory 38 is storage means such as a RAM that is accessed exclusively by the core 34 (that is, only from the core 34 provided in the same subprocessor 33 as the secure memory 38).
  • Secure memory can be part of local storage (LS) 35, as shown in Figure 2 (a), or dedicated hardware (core 34 force exclusive) as shown in Figure 2 (b). RAM accessed by Or other storage means).
  • the dedicated hardware may be a non-volatile memory or a volatile memory.
  • the local storage (LS) 35 has a public key 63 and a public key certificate 64 indicating that the public key 63 has been certified by a third party.
  • a peer node access table 65 holding information (address, etc.) related to access to external peer nodes is held.
  • each sub-processor 33 has its own local storage 35, once the program is loaded into the local storage 35, the subsequent processing is performed without accessing the main memory 47 unless necessary. Can continue.
  • the main processor 39 includes a core 40, an L1 cache, an L2 cache, and an MFC 43 including a DMAC 44 as constituent elements.
  • the operating system operates on the main processor 39, and a program that operates on each sub-processor 33 is determined based on the basic processing of the operating system.
  • the program power that operates in the sub-processor 33 may be a program that forms part of the operating system in the normal concept (for example, a device driver or a part of the system program).
  • the main processor 39 and the sub-processor 33 are instruction set architectures (ISAs) each having a different instruction set.
  • each of the sub processor 33 and the peer nodes 84a to 84h stores at least one secret key.
  • the sub processor 33 and each peer node 84 are provided with a public key certificate from a public key certificate authority based on their public keys 63.
  • the public key certificate authority issues a public key certificate (such as the public key 63 encrypted with the private key of the certificate authority), and the public key certificate is issued.
  • a reply is sent to the sub processor 33, and the sub processor 33 holds the public key certificate.
  • the public key certificate authority issues a public key certificate and returns the public key certificate to the peer node 84, and each peer node 84 receives the public key certificate. Holding.
  • public key authentication infrastructure X.509 recommended by ITU-T, for example, can be adopted.
  • each sub processor 33 when each sub processor 33 establishes a trust relationship with the peer node 84, the sub processor 33 first selects the external peer node 84 in S61.
  • a peer node selection server exists on the network here.
  • the piano selection server uniquely selects one peer node 84 based on the request of each sub processor 33, and the sub processor 33 communicates with the selected peer node 84 in the SSL handshake protocol in S62.
  • Mutual authentication is performed using For example, the sub-processor 33 receives the public key certificate from the selected peer node 84, decrypts the public key certificate using the public key of the public key certificate authority, and receives information on the peer node 84 (peer Node 84's public key and its administrator's name).
  • the piano card 84 is authenticated from this information.
  • the peer node 84 also receives the public key certificate from the sub processor 33, decrypts the public key certificate using the public key of the public key certificate authority, and obtains information on the sub processor 33 (sub processor 33). The public key and the name of the user). This information power also authenticates the sub-processor 33.
  • the sub-processor 33 will thereafter make the peer node 84 a trusted peer node unless a failure such as inaccessibility occurs. to decide. Therefore, in step S64, the sub processor 33 registers information related to the peer node 84 in the peer node access table 65 shown in FIG.
  • the process returns to S61 again, and the sub processor 33 requests the peer node selection server to select the peer node again. If the mutual authentication is successful until the end (for example, until a predetermined time elapses), the sub-processor 33 determines that there is no reliable peer node. in this case, In the present embodiment, the sub-processor 33 does not participate (participate in) the search processing distributed processing.
  • the above processing may be executed when a search request is made from a client, or may be executed at other appropriate timing such as when the computer 31 is started up.
  • the first embodiment can be classified into the following two types depending on how search results are returned to the search requester.
  • FIG. 3 shows how the mutual authentication between the sub-processor 33 and the peer node 84 has already been successful by the process of FIG.
  • Eight sub-processors 33 are associated with eight peer nodes 84a to 84h via a network 85 such as the Internet or a home network.
  • sub-processor 33a is associated with peer node 84a
  • sub-processor 33b is associated with peer node 84b.
  • the power shown by the eight sub-processors 33 is established with the external peer node 84, and there are at least one sub-processor 73 involved in the search process. Good.
  • the peer node 84 shown in FIG. 3 may have the same configuration as the computer 31, or FIG.
  • a general purpose or special purpose computer having a secure memory 88 in the main memory 87 accessed from the main processor 86 or a secure memory 88 independent of the main memory 87, as shown in (a) and (b). It may be.
  • the peer node 84 adopts the configuration shown in FIG. 4, the private key 62 is stored in the secure memory 88, the public key 63, the public key certificate 64 issued by a third party, and the A peer anode access table 65 is provided.
  • the computer 31 in FIG. 3 is a single processor piano, the main processor 42 is the main processor 86 in FIG.
  • the main memory 47 in 3 can be configured to be the main memory 87 in FIG. That is, the main memory 47 has a storage area corresponding to the secure memory 88 as shown in FIG.
  • a search request (search request data) is input from the client computer 83 on the network 85 (see FIG. 3) or via the input interface 54 such as a keyboard connected to the computer 31.
  • the search request is accepted by one of the main processor 42 or the sub processor 33 (hereinafter referred to as main PE).
  • Search requests include search data such as text data (keywords, natural language sentences, etc.), image (PICT etc.), video (AVC or MPEG4 etc.), sound (MP3 or AAC etc.) or voice.
  • the search data is written on the shared memory on the main memory 47 so that it can be read by the main processor 42 and all sub-processors 33 in step S2.
  • the search data can be divided and allocated to each sub processor 33.
  • the N search keywords are divided into the number of sub-processors 33, and a part of the search keywords is assigned to each sub-processor 33.
  • the search keyword assigned to each sub processor 33 is stored in association with the ID of the sub processor 33 or information equivalent to the ID. More specifically, for example, assume that the following keyword set is specified.
  • Keyword ⁇ distributed, system, parallel, computer, 2000 ⁇
  • the search system calculates the logical sum of data including each keyword. If there are three sub-processors, SPU1, SPU2, and SPU3, the above keyword is divided into three sets such as ⁇ Distributed, System ⁇ , ⁇ Parallel, Computer ⁇ , and ⁇ 2000 ⁇ . Ask. Then, associate each subset with the ID of each SPU. Write to in-memory 47. Thereby, each sub processor can read a keyword group to be searched by the sub processor from the main memory 47 based on the ID assigned to the sub processor.
  • each search intermediary PE (at least one of the sub-processors 33 in FIG. 3 executes a search process using the assigned search keyword independently).
  • the fact that the search data has been written on the main memory 47 is notified using means such as an interrupt or asynchronous message communication.
  • each search intermediary PE can monitor a specific memory location corresponding to the search intermediary PE and move to step S4 when new data is written.
  • each search intermediary PE issues an access request to the main memory 47 in parallel, and reads the search data allocated to the search intermediary PE.
  • the search intermediary PE can read only the keyword with an ID that matches its own ID.
  • the search intermediary PE uses the keyword read in step S4 as search data, and sends its ID and public key certificate to the peer node on the network 85 having the search engine associated as described above.
  • a search request is sent with 64 attached (step S5).
  • the peer node When the search is completed, the peer node returns the search result in step S6 with the common key certificate of the peer node attached to the search intermediary PE having the ID included in the request (step S6). .
  • the search intermediary PE that received the search result reply writes the search result to the main memory 47 with its own ID attached (step S7), and writes the search result to the main memory 47 for the main processor 42.
  • the completion is notified using an interrupt or asynchronous message communication (step S8).
  • the main processor 42 After sending the search data write notification to the search intermediary PE in step S3, the main processor 42 sends the search results to the main memory 77 from all search intermediary PEs involved in the search process. Wait for notification of writing (step S10), and then, in step S9, request the main memory 77 to read the search results and obtain all the search results. After that, all the search results, for example, the number of keywords Sort by a certain standard, such as many, order, etc., and reassemble as a single search result data (step S11), and in step 12, send the data to the client computer 83 that issued the search request It is processed whether it is displayed on the user interface such as a display or a display connected to the computer 71. Further, the completion of the search process may be reported to the client computer 83 or the computer 71 (that is, itself) that has issued the search request.
  • Step S21 to S27 correspond to steps S1 to S7, respectively, and thus the description thereof is omitted here.
  • This type is characterized in that each search intermediary PE sends a search result report to the search requester independently. Therefore, in step S28, the search result report is reported directly (sequentially) in parallel to the search mediator PE client computer 83 or computer 71 in parallel with the operation of other search mediator PEs. It has been made. Simultaneously or in parallel with this step S28, the main PE is notified of the search result report (step S29).
  • step S23 the main PE sends a search data write notification to the search intermediary PE, and then the search results are written to the main memory 77 from all search intermediary PEs involved in the search process.
  • step S30 the client computer 83 or the computer 71 reports completion of the search result (step S31).
  • search result integration and integration result report processing are also performed in parallel.
  • This example is implemented using a search result request 'result notification unit implemented using a computer 31-1 including a one-chip multicore processor 32-1 and a computer 31-2 including a one-chip multicore processor 32-2.
  • Search result integration • The integrated result reporting unit, of course, also searches for search results. • The result notification unit also integrates the results collected from the peer node 112 of the network 85. Search processing for databases stored in storage devices) and non-volatile memories such as flash memory)
  • At least one sub-processor 33-1 included in the one-chip multi-core processor 32-1 of the search result request 'result notification unit is connected to the network 85.
  • a trust relationship has already been established by performing mutual authentication with at least one peer node 112 arranged in a distributed manner, and each sub-processor 33-1 that has received a search request has established a trust relationship. Requests a part of the search to the peer node 112 that is searching. For example, when the sub processor 93-la has established a trust relationship with the peer node 112a, it makes a search request to the peer node 112a.
  • step S41 a search request from the client 83 on the network 85, or a search request power S through the user input interface of the computer 31, a search result request.
  • Result notification unit main PE1 for example, main processor 42-1
  • the main PE1 issues a search request 1 to the main PE2 (for example, the main processor 42-2) of the search result integration / integration result reporting unit (step S42) and searches the main memory 47-1 Write the target data (step S43).
  • the search data request / result notification unit search mediator PE for example, at least one of the sub-processors 941) interrupts that the search data has been written to the main memory 47-1.
  • step S44 Notification is made by asynchronous message communication (step S44).
  • the search intermediary PE that has received the search data write notification reads the search data (search keyword) associated with its ID in step S45, and has a peer node that is in a trust relationship (eg, peer node 112 in FIG. 9).
  • Search request 2 is performed for at least one of the above (step S46).
  • the main PE2 executes a search process for the local storage 110 in response to the search request 1, and writes the search result 1 as a result to the main memory 47-2 (step S47). Thereafter, the main PE 2 reports to the client 83 that the search result 1 has been written to the main memory 47-2 (step S48).
  • step S54 While the search result 2 from all the peer nodes 112 is returned, the main PE 2 is in a waiting state in step S54. During this time, when a search for a certain peer node is completed, a search result 2 is returned to the search intermediary PE that has issued a search request to the piano node (step S49). In response, the search intermediary PE sends the search result 2 to the search result integration-integrated result reporting unit's result writing PE (eg, one of sub-processors 33-2) associated with the search intermediary PE. Report (step S50).
  • the search result integration-integrated result reporting unit's result writing PE eg, one of sub-processors 33-2
  • the result writing PE calculates an index so that the search result data indicating the search result 2 can be indexed (step S51), and writes the indexed state into the main memory 47-2 (step S52). ) And the completion of writing search result 2 to main PE2 using an interrupt or asynchronous message communication (step S53) o Main PE2 has all peer node capabilities in step S54.
  • a request to read all the search results 2 is issued to the memory 47-2, and the search result data indicating the search results 2 is read therefrom (step S55).
  • step S56 a difference between search result 1 and search result 2 (a search result included in search result 2 but not included in search result 1) is calculated, and search data corresponding to the difference is calculated.
  • Register based on the index in the database provided on the local storage 110 nonvolatile memory such as HDD or flash memory).
  • the main PE 2 sends the difference between the search results 1 and 2 to the client 83 (step S57) and reports the search completion to the main PE 1 of the search result request 'result notification unit (step S57). S58). Finally, data indicating that the requested search has been completed is transmitted from the main PE 1 to the client 83 (step S59).
  • the search power of main PE2 is assumed to be completed earlier than the search of all peer nodes 112.
  • it waits for reports of search results 2 from all the peer nodes 112, calculates the difference between search results 1 and 2 and registers it in the database on the local storage 110.
  • the result of merging search result 1 and search result 2 (data corresponding to the logical sum of search result 1 and search result 2) is reported to client 83 at the timing corresponding to step S57.
  • step S48 becomes unnecessary.
  • step S56 is executed. In this case, step S48 is not necessary.
  • one sub processor of the mano core processor is connected via the network 85. After establishing a trust relationship with the peer computer by mutual authentication, the sub processor power also asks the peer computer to perform a search process, and each sub processor receives the search result.
  • the computer itself including the sub-processor can also be called a peer node because it also has a function as a server that accepts other computer requests in addition to a function as a client that requests other peer computers to search. .
  • one sub-processor establishes a trust relationship with only one peer node.
  • one sub-processor may have a trust relationship with a plurality of peer nodes and make a search request.
  • a tree network of peer nodes may be configured with the peer node 120 receiving the search request as the apex.
  • the peer node 120 that first receives a search request has established a trust relationship with the two peer nodes 121a and 121a, and the peer node 121a has established a trust relationship with the peer nodes 122a and 122b.
  • Each piano keyboard may be a computer system using a one-chip multiprocessor as shown in Fig. 1! /.
  • the peer node 120 when the peer node 120 receives a search request from a client, the search request is transmitted downward (toward the end of the tree).
  • the peer nodes 124a, 124b, 125, 126a, 126b, and 127 that are sown at the end of the trust relationship return the search results upward (in the root direction of the tree).
  • the search results of all the peer nodes are collected in the peer node 120 that first receives a search request from the client.
  • a client (not shown) making a search request to the peer node 120 receives this search result and displays it to the user.
  • the peer node 120 itself is a search server having a user interface, the search result is displayed to the user via the user interface on the spot.
  • step S71 it is determined how many peer nodes are to be selected (how many peer nodes to try mutual authentication).
  • the processing in FIG. 11 is essentially the same as the processing in FIG. N can also be infinite.
  • the peer node access table 65 in FIG. 2 or 4 is generally finite.
  • step S72 it is verified whether N is 0 or not, that is, whether or not authentication has been performed for N scheduled peer nodes. While N is not 0, the process proceeds to step S73 to check whether there is a peer node that can be selected. As a result, if there is a peer node that can be selected, N is decremented by 1 in step S74, and then the process proceeds to step S75 to select the peer node. If the peer node to be selected does not already exist, the registration process is terminated. In step S76, mutual authentication is performed with the peer node selected in step S75. For example, an SSL handshake protocol can be used. Finally, in step S77, it is confirmed whether the peer node authentication is successful.
  • FIG. 12 shows an example of the peer node access table 65 of FIG. 2 or FIG.
  • the peer node ID here, the local ID seen from the computer that holds the table that is not the global ID
  • the public key certificate storage location that is the address in the local memory
  • the registered are registered.
  • the IP address of the peer node and a response indicating whether or not the registered peer node is currently accessible exist as items.
  • the location on the other party's network is in some form, such as a power MAC address using an IP address.
  • “OK” is displayed! /, Indicates an accessible peer node, and “NO” indicates that access is not possible for some reason (eg network disconnection or computer power off). Show the peer node!
  • FIG. 13 shows an example of a user interface (search interface) for using this embodiment.
  • This user interface is displayed on the monitor 57 of the computer 31 and includes a search start button 132, a search stop button 133, a search condition input unit 134, a search expression input unit 135, a search genre specification unit 136, and a search result display. Includes part 137.
  • the search condition input unit 134 inputs the maximum search wait time as part of the search condition. In this example, there are three options: 1 minute, 10 minutes, and unlimited, with the check box of 1 minute marked.
  • the search expression input unit 135 is an input form for inputting one or a plurality of search keywords.
  • the search genre designation unit 136 designates a search genre (type of data to be searched), and web, image, sound, news, group, and directory are shown as options. For example, if a sound is selected, sound data is displayed on the search result display unit 137 as a search result.
  • FIG. 14 shows a main part of processing of the search application. This process is executed when searching by the computer 31 or the client 83.
  • the search application including the user interface program that displays the screen of FIG. 13
  • the search is performed. Wait for an instruction to start (step S82).
  • the search button 132 is pressed, the search time limit (for example, a fixed value) is stored in the memory by checking the conditions set in the search condition input unit 134 of the search interface in FIG. Step S83). Then check to see if a remote search server is specified. For example, it is checked whether the remote server location (location identification information) such as URL or IP address is set in a specified variable such as remote_server.
  • variable keywordjist is a variable indicating the keyword group input to the search expression input unit 135 in FIG.
  • search— request 1 (remote— server, keyword— 1 i s t);
  • the peer node that processes each part of the search request includes an untrusted peer node.
  • This figure differs from Fig. 12 in that nodes in the tree network contain unreliable peer nodes.
  • the peer nodes 142a, 144b, 145, and 146b are peer nodes that cannot establish a trust relationship.
  • the peer node 141a Recognize it as an unreliable search result. This is because information may be tampered with on an untrusted node due to an untrusted node in between.
  • FIG. 16 is a flowchart showing a registration process of a peer node when one sub-processor authenticates with a plurality of peer nodes, establishes a trust relationship in a part of the sub-processor, and can include one. is there.
  • the processing in this figure is based on the tree-structured network in Fig. 15, and is partially modified from the flowchart in Fig. 11. Specifically, what differs from FIG. 11 is the processing after step S77.
  • FIG. 11 adds step S79 as a process after the peer node authentication has failed. Yes.
  • the peer node is registered in the peer node access table as a peer node having no trust relationship.
  • FIG. 17 shows an example of a peer node access table generated by the process of FIG. Compared with the peer node access table shown in FIG. 12, the peer node access table shown in FIG.
  • the reliability of the peer node ID 0004 is “none”. This indicates that the peer node that is determined to have failed in the peer node authentication in step S77, that is, is recognized as an unreliable peer node.
  • the public key certificate storage location of this peer node ID 0004 is indicated as “NONE”. Untrusted peer nodes do not have public key certificates, so local memory This is because it cannot be stored.
  • FIG. 18 shows an example of a user interface (search interface) when a search request is processed by a tree-structure network including untrusted peer nodes as shown in FIG.
  • the screen area for displaying the search results is divided into a search result display unit 147 for a peer node having a trust relationship and a search result display unit 148 for a peer node having no trust relationship. Except for the above, it is the same as the user interface 131 shown in FIG.
  • FIG. 19 shows an example of the device configuration of the search mediating apparatus according to the present embodiment.
  • a monitor 160 such as a television receiver
  • the main body of the search mediating device 151 displays a search result or accepts a search request using the monitor 160.
  • the search intermediary device 151 includes an input interface such as a switch 154 for starting / stopping the device, a confirmation lamp (indicator) 155 indicating operation / non-operation, an IR light receiving unit 152 for receiving an infrared signal from a remote controller, and a keyboard 159.
  • a connection interface 153 such as USB is provided.
  • the keyboard 159 is depicted as being wired and connected to the connection interface 153.
  • the connection interface 153 is a wireless communication interface
  • the keyboard 159 may be a wireless keyboard. It is possible to communicate with the connection interface 153 in accordance with a communication standard such as llaZbZg.
  • the remote controller 156 includes an infrared light emitting unit 157 and a keypad unit 158 including a plurality of numbers, characters, or direction instruction keys. Each key may be configured so that an input type such as numeric input, character input, or direction indication input can be selected with one key (input type selection key).
  • one of the keys is an input type selection key
  • the keypad unit is provided with a display unit for displaying the inputted character, and the display unit has a display unit for the currently selected input type ( Numbers, letters, or direction instructions) are displayed.
  • the input character string is further displayed on the display unit.
  • the search mediating apparatus 151 is configured as shown in FIG. 1, for example, and is connected to a monitor 160 (corresponding to the monitor 57 in FIG. 1) via a graphic card 55.
  • the output generated by the processor of the device 151 is displayed.
  • a search interface 141 as shown in FIG. 18 is displayed.
  • the search interface is operated using a user interface such as the remote control 156 or the keyboard 159.
  • the input type may be set to “direction indication” by the remote controller 156, and the cursor may be moved between the buttons on the search interface 141 by instructing the direction of the key force of the keypad unit 158.
  • the cursor position is set in order such as a search start button 132, a search stop button 133, a search condition input unit 134, a search expression input unit 135,. Can be changed.
  • the present invention is not limited to the above embodiments.
  • the example in which the present invention is applied to a search system using a network is taken up.
  • the present invention is not limited to this, and various processes are distributed by a plurality of computers arranged on the network.
  • the computer 31 is configured as a distributed processing device, and is connected to a plurality of computers (such as peer node 84) via the network 85. Then, each computer is requested for each part of given processing such as numerical calculation and graphics processing.
  • the distributed processing apparatus includes a one-chip multi-core processor 32 including a plurality of sub-processors 33 as in the configuration of FIG.
  • each sub-processor 33 involved in the distributed processing has a local storage 35.
  • Requests at least one computer for part of a given process At this time, the request includes the ID of the sub-processor 33 that is the request source.
  • the computer that has received the request returns the processing result including this ID to the distributed processing device that is the computer 31.
  • the sub-processor 33 that requested the distributed processing acquires a processing result including its own ID from various received data.
  • the main processor 42 or the like integrates the processing results in the sub processors 33 involved in the distributed processing, and outputs the integration result to the monitor 57 or the like, for example. In this way, it is possible to prevent the situation in which each sub processor 33 accesses the main memory 47 during mutual authentication and it takes a long time to read out the authentication information. Mutual authentication with computers is possible.

Landscapes

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

Abstract

La présente invention concerne un appareil d'intermédiation de recherche capable de demander à un ordinateur, avec lequel une relation fiable est établie, de faire une partie d'un traitement de recherche. Un appareil d'intermédiation de recherche, qui lance une recherche en fonction d'une requête de recherche, accompagnée des informations de recherche, depuis un client et qui produit un résultat de recherche, comprend un processeur multi-cœurs à puce unique (32) comprenant deux processeurs ou plus conservant des identifiants respectifs et des clés secrètes. Au moins l'un des deux processeurs ou plus transmet, en fonction de la clé secrète stockée dans ce processeur, au moins une partie des informations de recherche précédentes liées à l'identifiant stocké dans ce processeur sur un appareil de recherche ayant un moteur de recherche authentifié et reçoit un résultat de recherche par l'appareil de recherche.
PCT/JP2006/315334 2005-10-24 2006-08-02 Appareil et procede d'intermediation de recherche, systeme de recherche decentralise, appareil de decentralisation et son procede de commande WO2007049388A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2005309120 2005-10-24
JP2005-309120 2005-10-24

Publications (1)

Publication Number Publication Date
WO2007049388A1 true WO2007049388A1 (fr) 2007-05-03

Family

ID=37967509

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2006/315334 WO2007049388A1 (fr) 2005-10-24 2006-08-02 Appareil et procede d'intermediation de recherche, systeme de recherche decentralise, appareil de decentralisation et son procede de commande

Country Status (1)

Country Link
WO (1) WO2007049388A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012238050A (ja) * 2011-05-10 2012-12-06 Hitachi Solutions Ltd 統合検索装置、統合検索システム、統合検索方法
JP2014509423A (ja) * 2011-02-18 2014-04-17 アマデウス エス．アー．エス． ルール属性から運賃検出を提供するための方法、システム、およびコンピュータプログラム

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001265744A (ja) * 2000-03-17 2001-09-28 Sony Corp データ処理装置及びデータ処理方法
JP2003030238A (ja) * 2001-07-18 2003-01-31 Nippon Telegr & Teleph Corp <Ntt> 並列型情報検索装置および方法と並列型情報検索プログラムおよび該プログラムを記録した記録媒体
JP2005018379A (ja) * 2003-06-25 2005-01-20 Toshiba Corp プロセッサ、プロセッサシステム及びキャッシュ一貫性制御方法
JP2005099984A (ja) * 2003-09-24 2005-04-14 Toshiba Corp オンチップマルチコア型耐タンパプロセッサ
JP2005521143A (ja) * 2002-03-15 2005-07-14 インターナショナル・ビジネス・マシーンズ・コーポレーション ピアツーピア・ネットワークにおけるリソース検索方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001265744A (ja) * 2000-03-17 2001-09-28 Sony Corp データ処理装置及びデータ処理方法
JP2003030238A (ja) * 2001-07-18 2003-01-31 Nippon Telegr & Teleph Corp <Ntt> 並列型情報検索装置および方法と並列型情報検索プログラムおよび該プログラムを記録した記録媒体
JP2005521143A (ja) * 2002-03-15 2005-07-14 インターナショナル・ビジネス・マシーンズ・コーポレーション ピアツーピア・ネットワークにおけるリソース検索方法
JP2005018379A (ja) * 2003-06-25 2005-01-20 Toshiba Corp プロセッサ、プロセッサシステム及びキャッシュ一貫性制御方法
JP2005099984A (ja) * 2003-09-24 2005-04-14 Toshiba Corp オンチップマルチコア型耐タンパプロセッサ

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
INOUE U. ET AL.: "Database Processor RINDA no Sekkei to Jitsugen", TRANSACTIONS OF INFORMATION PROCESSING SOCIETY OF JAPAN, INFORMATION PROCESSING SOCIETY OF JAPAN, vol. 31, no. 3, 15 March 1990 (1990-03-15), pages 373 - 380, XP003011627 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2014509423A (ja) * 2011-02-18 2014-04-17 アマデウス エス．アー．エス． ルール属性から運賃検出を提供するための方法、システム、およびコンピュータプログラム
US9703832B2 (en) 2011-02-18 2017-07-11 Amadeus S.A.S. Method, system and computer program to provide fares detection from rules attributes
JP2012238050A (ja) * 2011-05-10 2012-12-06 Hitachi Solutions Ltd 統合検索装置、統合検索システム、統合検索方法

Similar Documents

Publication Publication Date Title
US10585683B2 (en) Defining application programming interfaces (APIs) using object schemas
US10866828B2 (en) Extending object-schema-based application programming interfaces (APIs)
US20110129089A1 (en) Method and apparatus for partially encoding/decoding data for commitment service and method of using encoded data
WO2013143403A1 (fr) Procédé et système pour accéder à un site web
JP2011034462A (ja) 情報処理装置及びその処理方法
JP2007188184A (ja) アクセス制御プログラム、アクセス制御方法およびアクセス制御装置
WO2019223136A1 (fr) Procédé et appareil d&#39;acquisition de données, et dispositif informatique et support de stockage
JP2019140423A (ja) 端末登録システムおよび端末登録方法
JP4698678B2 (ja) データ通信方法、コンピュータ及び情報記憶媒体
WO2007049388A1 (fr) Appareil et procede d&#39;intermediation de recherche, systeme de recherche decentralise, appareil de decentralisation et son procede de commande
JP2010033562A (ja) 通信端末、認証情報生成装置、認証システム、認証情報生成プログラム、認証情報生成方法および認証方法
JP2008269141A (ja) オーバレイ検索装置、オーバレイ検索システム、オーバレイ検索方法およびオーバレイ検索用プログラム
US10042957B2 (en) Devices and methods for implementing dynamic collaborative workflow systems
JP5227106B2 (ja) 候補出力プログラム及び候補出力サーバ
CN113157722A (zh) 一种数据处理方法、装置、服务器、系统及存储介质
JP2014085994A (ja) ライセンス管理装置、ライセンス管理システム、及びライセンス管理方法
JP4862727B2 (ja) ネットワークシステム、通信装置及びコンピュータプログラム
US10554789B2 (en) Key based authorization for programmatic clients
JP5749222B2 (ja) アクセス許可制御システム、アクセス許可制御方法
US20190370259A1 (en) Devices and methods for implementing dynamic collaborative workflow systems
JP4283595B2 (ja) 情報処理装置、オブジェクト管理方法、オブジェクト管理プログラム及び記録媒体
Lin et al. A P2P blog system with OpenID integration
US20230244863A1 (en) System and method for reference validation of spreadsheet
JP2012203764A (ja) ユーザ情報管理装置
JP2023034929A (ja) 情報処理装置、情報処理システム、情報処理方法、及びプログラム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06782203

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: JP