JP2010224840A - Network equipment setting method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To improve the demerits of a relay type search mediation system which is inferior to a registration type search mediation system. <P>SOLUTION: Under a network environment where a registration type search mediation system coexist, a relay type search mediation system I provides the function of a register inquiry function equivalent to that of the registration type search mediation system. Thus, a real information database R under the control of the relay type search mediation system I is able to get a chance to provide real information even to a searcher C who subscribes in the registration type. At the same time, a searcher C who subscribes in the registration type is able to acquire his or her desired real information also from the real information database R under the control of the relay type search mediation system I. Thus, it is enough for both the searchers only to cope with their own retrieval/search system, and it is not necessary to be conscious of the use of a compatible function on the relay type search mediation system. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to a search mediation system that mediates a search when searching a plurality of databases with different founders from a user terminal, and in particular, a search-type relay / answer aggregation type that can include a registration-type search mediation method. Related to search mediation system

  In recent years, it has been required to share information on logistics management and article location management across companies. As represented by ebXML (electronic business XML), basic information acquisition mechanisms, information sharing / exchange frameworks, and common items of information to be exchanged are being developed. Using this common information sharing / exchange framework, it is possible to start a smooth business operation by allowing existing or potential business partners to search a database that stores business information as needed. is there. On the other hand, a system for mediating data storage destinations has already been proposed (see Patent Document 1).

  Disclosing information managed by the company has the advantage that new customers can be cultivated thereby. However, if the information is unconditionally disclosed, there is also a problem that it reveals the hand to the competitor. This is not only the contents of the information, but also the location of the database itself should be made known to potential customers, but it should be kept secret to inconvenient partners such as competitors in order to prevent industrial espionage and cracking interference. , Have inconsistent demands. Today, as standardized data sharing and exchange methods are becoming popular, this benefit provides a good opportunity for new, more advantageous business relationships that have never been met before. Latent. However, it is still difficult to detect the presence and location even if it is shared as a base.

  For this reason, while disclosing the contents of the information itself, the presence / absence of the information and its location, the disclosure of the information to be searched can be restricted according to the request source of the disclosure. A system to provide has been proposed. Hereinafter, it is called a search mediation system.

  As such a search intermediary system, the real information possession “registration type” is notified to notify the intermediary system that the real information is retained, and the searcher searching for the real information returns an access path to the real information possession DB. ”Has been proposed. Hereinafter, such a mediation system is referred to as a “registration type” search mediation system.

  FIG. 1 is a conceptual diagram showing the relationship between a searcher C, a search mediation system, and an actual information DB in the registration type method.

  Here, the concept of registration type search mediation will be described with reference to FIG. First, “1” to “5” in FIG. 1 are the first to fifth steps enumerated below, respectively, in this order until the actual information to be searched is registered and used by the searcher C. The flow of the process is shown.

  First step: Real information database R (resource: EPC Information Service (hereinafter, EPCIS) as an example) owns real information and can create a summary record (discussed later) by self creating a summary record (discussed later) Is registered as “Data Provision Announcement” to permit the brokerage system I to make an inquiry about possession of actual information.

  Second step: The searcher (client) C makes an inquiry to the registration-type brokerage system I as “holding destination search” for the possession DB of the article location / handling information that is interested in the brokerage system I.

  Third step: The intermediary system I introduces an access path to each of the real information databases R permitted to be disclosed among the real information locations to the searcher C who meets the disclosure conditions.

  Fourth step: The searcher C directly contacts each individual real information database R and obtains permission to perform a real information search in the DB, and then sends the real search formula. (In some cases, access may be denied from the beginning, in which case actual information retrieval is not possible.)

  Fifth step: The real information database R judges the identity of the searcher C, conceals and corrects the content according to its own policy (granularity processing), and replies with detailed data obtained from the searcher C.

  The registration type system illustrated in FIG. 1 is a “summary” in which only the location of the corresponding record group is answered to each record of the actual information held by a limited search key “summary key” based on the mediation service standard. The basic configuration is that the “record” is self-created on the real information DB side and registered in the registry of the brokerage system.

  “Summary key” and “summary record” have precedents, but none have been established as standards, so an example of assumptions sufficient to realize this concept will be described later. Also, no method has yet been shown for the method of creating the summary record and the summary key from the actual record record or the actual retrieval formula. Therefore, in the following, in order to show that the concept is established, a virtual example with reference to the existing search standard “EPCIS” is handled.

  Next, FIG. 2 is an overall configuration diagram showing an overview of an enlargement of a location search range by tie-up between brokerage systems in a registration type system and an actual search outside the single range due to the effect thereof.

  The real information holding DBs 33 to 35 are affiliated with the information holding registration DB 22 that is responsible for the real information holding registration and location disclosure. The real information holding DBs 36 and 37 are members of another information holding registration DB 23.

  The search client QC12 subscribes to the DB 22 as a location searcher.

  DB22 and DB23 have mutually signed a partnership agreement that introduces each other's search subscribers, guarantees the clearing of subscribers' identity and search fees, and mediates disclosure of the location of the group of real information DBs under their control.

  Here, along the steps of FIG. 1, the flow of the partnership search will be described in FIG. The location search response step 3 and the actual search response step 5 are omitted for the sake of brevity.

  First step: Each real information DB registers “data provision announcement” in the brokerage system = registration DB of each member.

  Second step: When a search is made from the QC 12 to the subscribing DB 22, the DB 22 searches for “data provision announcement” registered from its affiliates, extracts the DB 33 that reports the possession of the actual information, and the step 2 'is requested to the partner database 23 as a ripple search.

  Third step: The DB 23 that has received the indirect search replies that the affiliated DB 37 holds the corresponding real information.

  Fourth step: The QC 12 that has detected the location of the DB 33 and DB 37 directly from the DB 22 to which the subscriber has joined directly attempts the search permission negotiation by contacting the DB 33 and the DB 37, and if permitted, the actual information search formula is expressed as S4 and S4 ′. To obtain the actual information to be obtained (within a range disclosed by each DB).

  On the other hand, as a search mediation method that is different from the registration type search mediation method, a search formula “relay” / answer that collects and relays the answers of each DB by copying and relaying the searcher's actual search formula to the affiliated DB group There is an intensive search mediation system (see Patent Document 2). Hereinafter, such a mediation system is referred to as a relay type search mediation system.

  FIG. 3 is a conceptual diagram of the search-type relay / reply aggregation method.

  This figure shows the basic operation and basic concept of the search mediation system I that relays the search formula and aggregates the answers in the relay type search mediation system I. In this figure, “1” to “6” indicate first to sixth operation processes described below. The description in parentheses is not the essence of the relay type, but it is a collective description of the more advanced incidental processing that is its feature.

  First operation process: The real information holding DB registers the location access path and the real information disclosure subject (and the granularity limit) in the mediation system I.

  Second operation processing: The searcher C registers the identity (and identity disclosure range) in the mediation system I.

  Third operation process: Searcher C throws a search expression to intermediary system I.

  Fourth operation process: The mediation system I copies and distributes the search expression to the real information database R corresponding to the disclosure target.

  Fifth operation processing: The real information database R that has received the copy distribution of the mediation search type returns the result to the mediation system I within a range that can be disclosed in accordance with its own policy (standard). (Adding automatic granularity processing entrusted by the relay system that has been answered, and charging by granularity)

  Sixth operation process: The intermediary system I concatenates the answers for each real information database R and answers the searcher C all at once.

  Such a relay type search mediation system I has the following advantages over the registration type search mediation system I.

  1. From the searcher C, the mediation system I can be seen only as a single virtual real information database R ′. From the real information database R, the mediation system I can be seen only by a single known searcher C ′. That is, both the upper and lower sides are not aware of the intermediary system I as a basic operation = no modification from the conventional search means is necessary.

  2. The registration permission negotiation between the actual information database R and the searcher C after the first meeting after the location search, which cannot avoid the registration type, can be completely omitted. In the registration type, when there are a large number of actual search destinations, if the new permission negotiations are frequently rushed from the opposite side, this post-negotiation will impose a serious burden.

3. Both the searcher C and the real information database R can maintain anonymity with respect to the other party.
The relay to the real information database R and the reply to the searcher C can be performed only by the borrowing name of the intermediary system I. Penalties can be imposed to limit anonymity.

4. The actual information to be finally provided can be narrowed down freely on the DB side.
Since the relay system can touch all the response information, the restriction of disclosure items / contents = granularity processing can be entrusted to the relay system by the real information database R, so that it does not have to be modified for itself. it can.

  5. Since the relay system can measure and observe all response traffic, the information amount can be charged without modification in place of the actual information database R. In addition, a variety of information content control services can be developed.

JP 2006-146293 A JP 2009-15552 A

  However, when the registration type search mediation system and the relay type search mediation system described above are compared, there are disadvantages not found in the other.

  First of all, in the registration type search mediation system, compared to the relay type search mediation system, the actual information holding side is revealed even if the real search permission negotiation is not reached (inferior information holding secrecy). It is necessary to specify the relevant attributes of the precise disclosure target in advance (it is inferior in disclosure restrictions). After the disclosure and detection of location, it is inevitable that search permission negotiations that are difficult to automate individually between the actual information holding DB and the searcher (It is inferior in post-negotiation), and there is a disadvantage that it is necessary to create registration data and search data separately from actual search (inferior in repair load).

  On the other hand, the relay type is advantageous in that it can solve the above-described disadvantages of the registration type and can provide an advanced data processing support function while being a simpler usage method that is the same as a normal actual search. However, registration-type search mediation has an example on a trial basis and is ahead in terms of diffusion. Moreover, it may be regarded as a problem that unnecessary retrieval formulas are relayed to the actual information holding DB that is not originally involved.

  The present invention provides a search intermediary system that realizes compatibility with a location search as a registration-type search intermediation method that is prevailing in popularity without an actual information DB being affiliated with the relay-type search intermediary system without modification load. The issue is to provide. It is another object of the present invention to reduce the diffusion of invalid retrieval formulas, which is a weak point of the relay type.

  The present invention is a search mediation system that mediates search when searching a plurality of databases with different founders from a user terminal, and includes a real information DB in a database information register for use in searching for a user terminal. By receiving a request for registration agency of the information to be searched from the side, the agency commissioned real information DB group management unit for performing this process, and means for generating information to be registered in the registry, It solves the problem.

  In addition, as an incidental function of the mediation type, a disclosure policy DB classified by actual information DB used for information granularity filter processing is provided.

  Furthermore, a request search formula management unit and a search formula request unit, which are the backbone of the relay type search mediation system, are provided, and a search formula receiving unit that determines that the mediation system itself is a requester of an answer.

  Also, identify respondents, refer to the disclosure policy DB for each real information DB, obtain an information disclosure policy setting slip and create a summary record for holding registration, inquire about unset disclosure policies, and register holding registration A surrogate summary record creation unit can be provided.

  Further, by modifying the location disclosure policy set in the existing summary record, the summary record created in the past is rewritten to reflect the new disclosure policy.

  Alternatively, a summary record that has not been in time for revision is temporarily revised with an unreflected revision policy, whereby a summary record created in the past is rewritten to reflect the new disclosure policy.

  In addition, an information holding registration type compatible function unit that is completely visible to the registration type relay system from the registration type external system is provided, and an actual information search corresponding unit that determines whether or not an answer is possible is provided.

  Furthermore, an actual information location response history DB that records a result history of whether or not an answer is possible can be provided.

  In addition, a search client account management unit that performs transaction billing through a mediation service, and a billing management DB that settles expenses required for proxy registration processing and information granularity filter processing are provided.

  Next, the present invention provides a search mediation system that mediates search when searching a plurality of databases with different establishments from a user terminal, and summarizes information held in an actual information database that is a mediation target. A registration register to be registered, a proxy registration function part that searches the real information database to acquire information held in the real information database and registers the summary in the register, and the registration for a registration type search request A registration type search support unit that refers to a book and makes a location response, and grants permission based on a determination as to whether or not the requester's disclosure identity matches the searcher account requirement policy for registration type real search permission requests ( Refusal) an account management unit that performs notification, an actual search type acceptance answering unit that accepts a registration type actual search request and answers the search result of the real information database, It makes is obtained by solving the problem which is adapted to anda relay processing unit for acquiring search results the actual information database in accordance with.

  Alternatively, the present invention is a search mediation system that mediates search when searching a plurality of databases with different founders from a user terminal, and searches the real information database that is an intermediary target and possesses the real information database Proxy registration function unit that acquires information to be registered and registers the summary in the registry of the higher-level registration-type search intermediary device, and the disclosure identity of the requester for the search-type actual search permission request is the searcher account requirement policy An account management unit that issues a permission (rejection) notification based on a determination as to whether or not it matches, an actual search expression reception reply unit that accepts an actual search request of a registration type method and answers a search result of the real information database, A relay processing unit that searches the real information database and obtains a search result in response to a relay request from a search-type reception answering unit, thereby solving the problem. It is intended.

  Next, it is also possible to provide a software program that causes a computer to function as the search mediation system.

  According to the present invention, although it is a relay type search mediation system, it can respond to an inquiry as a different type of registration type search mediation system and can indirectly correspond to the registration type without modifying the affiliated real information DB. it can. In addition, using the permanent search function that is the standard of the real information possession DB, create a permanent retrieval formula and request permanent placement, create a registration type real information possession registry on behalf of the initial response, and update information only Can be managed in a timely manner, and the member DB registry management can be performed in which update data is created from new answers and the registry is maintained. Furthermore, it is also possible to automatically execute the restriction on the disclosure target person in the registration type based on the searchers for the proxy information granularity filter of the relay type search mediation system. This is a relay-type search intermediary system that does not require this and is advantageous for information management, as opposed to the registration type, where only the access path to the DB holding the actual information is answered and repeated access negotiations are necessary after the fact. However, it is possible to respond to registration type inquiries and mutual flexibility, and to provide a function that allows the participating DBs to participate in the registration type without requiring the burden of refurbishment while maintaining the specifications for the standard search. it can.

  Without such ancillary service, in order to join the registration type, the real information DB will self-support the search permission negotiation by electronic message as described above, and implement the function to perform permission management dynamically. It is essential to make repairs.

  In the bare registration type system, the location of the actual information DB is disclosed as a result of the disclosure of the individual summary keys described in this introduction letter, and even if the actual search is not permitted, it is presented in the introduction letter. Holds the actual situation of the summary keyed object = it is revealed that it is the (handling) party of the article. It is clear that the distribution status of a certain fixed product can be almost completely elucidated by comparing the actual information holders that have been revealed for each business characteristic. This also realizes the concern that the investigator may incur a crisis of business continuity, such as putting pressure on the business partner who is estimated to be upstream or downstream (as an unfair act in fair trade). To do. On the other hand, the real information DB can be completely released from this concern by entering a relay-type umbrella and concealing the acceptance of the real search to the mediation system and hiding behind it. From this point, even if the registration type location search / retrieval mediation method is prevalent, the real information DB still has a serious reason for joining the relay type service.

Conceptual diagram showing the relationship between a searcher, a search mediation system, and a real information DB in a real information registration type search mediation method Outline block diagram of search propagation by tie-up of brokerage system in registered type Conceptual diagram showing the relationship between a searcher, a search mediation system, and a real information DB in a search relay / answer-intensive search mediation method Basic concept diagram of compatibility action by proxy registration to registration type method based on search type relay / answer aggregation method in the present invention Block diagram of the outline of the mechanism for using the domain from the registration type to the relay type method and the outline of the search spread by the tie-up between different types of intermediary systems Hardware configuration diagram for realizing compatible functions in the present invention The block diagram which shows the whole function structure of the relay system which implement | achieves this invention The flowchart which shows the outline | summary of the summary record proxy creation process in the said embodiment. Function linkage chart in which relay system in the present invention answers registration type location search Function linkage chart for relay system in the present invention to process actual search permission negotiation as a proxy search destination Function linkage chart in which relay system according to the present invention relays actual search as a proxy search destination, collects responses, and responds Diagram showing a virtual example of summary record and summary key for registered brokerage Summary key virtual example and actual search formula / result diagram in the real information holding registration method Diagram of summary keys that can be used for collaborative searches with limited searcher disclosure identity Functional block diagram for using granular filter settings Disclosure policy setting form management table in the disclosure policy DB 305 Diagram showing disclosure granularity processing rules by usage record item Diagram showing disclosure granularity setting slip for usage record items by searcher class Diagram showing identity disclosure policy correspondence table between searcher / actual information DB establishment person Diagram showing disclosure policy for searcher's identity attribute and real information DB founder attribute Diagram showing actual search formula for identifier handling record with content disclosure negotiation conditions Diagram showing the location response history record that records the disclosure judgment results of the agent for search permission negotiations Diagram of access path response issued by registered intermediary system in the sixth embodiment and its electronic introduction letter part Example of a letter of introduction including an identity section used for automatic search permission negotiation Block diagram showing the form of collaboration in which the relay type is a member of the registration type

  FIG. 4 is a flowchart showing the concept of the relay / aggregation method for performing proxy registration based on the relay type method described in FIG. 3 and compatible with the registration type mediation method.

  In the present embodiment, the relay type search mediation system I that relays the search formula of FIG. 3 and aggregates each answer originally has a mechanism for behaving equivalently to a registration type search mediation system that holds system information. .

  Registered search mediation systems are already widely used in other fields as a conventional technique, and can be easily used for location investigation of actual information. There are also prior implementation examples such as in the EU BRIDGE project. Even if this is the majority for now and for the time being, the real information database R provides the basic merits and advanced incidentals of the relay-type search mediation system I by providing the following compatibility method from the relay-type search mediation system I: For the searcher C who is participating in the registration type search mediation system I while enjoying the service, the information resources held by the real information database R under the relay type can be used by the search relay. be able to.

  In this figure, “1”, “1.1” to “6” indicate first to sixth operation processes described below. The descriptions in FIG. 4 and the following parentheses are not the essence of the relay type, but collectively describe more advanced incidental processing that is a feature of the relay type.

  First operation processing: The real information holding DB corresponding only to the relay type search mediation system I registers the location access path and the real information disclosure target (and the granularity limit) in the mediation system I. The first operation process includes the following 1.1 operation process and 1.2 operation process.

      1.1 Operation process: The brokerage system I requests to detect the change difference in the possession record of the real information database R.

      1.2 Operation process: The real information database R notifies the recording difference from the previous notification, and causes the brokerage system I to perform possession registration and grant announcement.

  Second operation process: The searcher C of the registration type search mediation system I registers the identity (and the disclosure range) in the registration type search mediation system I. The second operation process includes the following 2.1 operation process and 2.2 operation process.

      2.1 Operation processing: A registration type searcher C makes an inquiry to the registration type search mediation system I as a “holding destination search” for the possession DB of the actual article location / handling information of interest.

      2.2 Operation processing: When the brokerage system I falls under the agency registry and meets the disclosure conditions, the brokerage system I itself returns to the searcher C with a representation of acceptance of the actual search when the brokerage system I is the owner. .

  Third operation process: The searcher C throws an actual search expression to the mediation system I.

  Fourth operation process: The intermediary system I copies and distributes the search expression to the actual information database R corresponding to the disclosure target (corresponding to the proxy registry).

  Fifth operation processing: The real information database R that has received the copy distribution of the mediation search type returns the result to the mediation system I within a range that can be disclosed in accordance with its own policy (standard). (Adding automatic granularity processing entrusted by the relay system that has been answered, and charging by granularity)

  Sixth operation process: The intermediary system I concatenates the answers for each real information database R and answers the searcher C all at once.

  Based on FIG. 5, an outline of mutual cooperation and compatibility realization with the relay type search mediation system DB 21 viewed from the registration type search mediation system DB 22 in this embodiment will be described.

  In a network environment in which the registration type search mediation system has prevailed, the relay type search mediation system DB 21 includes the registration type search correspondence unit 200, so that the registry inquiry function equivalent to the registration type search mediation system DB22 is provided. Show to have.

  In the following, the cooperation of the general functional blocks in FIG. 5 will be described.

0th operation processing: Permanent search acquisition of registration target real information The relay DB 21 operates the proxy registration function unit 300 which is a component of the present invention to register the summary record as a new / correction / policy change. Then, the permanent information indicated by the circle number “0” in the figure is requested to the participating real information DBs 31 and 32, and the corresponding real information record is regularly reported.

First operation processing: summary record substitution creation and substitution registration As shown in the circle number “1” a in the figure, the summary record is obtained from the actual information to be registered for the new / correction / policy change registration by the substitution registration function unit 300. A request is made to the self-registration type search support unit 200 to create and execute proxy registration. The registration type search corresponding unit 200 executes this and prepares for the registration type search.

Second operation process: Start of registered search and spread of search by cooperation between brokerage systems The search client QC12 requests the registered relay system DB 22 to which it belongs to perform a location search as indicated by a circle number “2” in the figure. . The DB 22 searches the registry for the real information DBs 36 and 37 under its control, and requests the DB 21 in the affiliated relationship to perform a ripple search as indicated by a circle number “2” a in the figure. The DB 21 receives a registration type search by the registration type search support unit 200, searches the self-prepared summary record, and extracts the corresponding DBs 31 and 32. However, unlike the DB 22, the DB 21 replies as a unique license negotiation path to the account management unit 102 of the DB 21 itself as a search proxy window instead of an access path to the DBs 31 and 32. The direct permission negotiation access path to the real information DBs 31 and 32 is concealed from the QC 12.

Third Operation Process: License Negotiation for Actual Search The search client QC12 attempts a search permission negotiation for the real information DB 37 introduced by the DB 22, as indicated by a circle number “3” in the figure, and acquires a search account (one side) (In this case, the actual search of the process indicated by the circle number “4” in the figure is impossible). The search client QC12 tries to negotiate search permission with the account management unit 102 of the relay type search mediation system DB21 indirectly introduced by the DB 22, as indicated by a circle number “3” a in the figure. For reasons that will be described later, the DB 21 issues a search account to the actual search reception unit 101 of the DB 21 with a gradual examination.

Fourth Operation Process: Realization of Real Search The search client QC12 tries the real search of the process indicated by the circle number “4” in the figure with respect to the real information DB 37 only when the process indicated by the circle number “3” in the figure is successful. The actual information record that was originally sought is acquired (the empty sentence may be replied for the arbitrary purpose of the DB 37). The search client QC12 attempts an actual search of a process indicated by a circled number “4” a in the figure with respect to the actual search expression reception answer unit 101 of the relay type search mediation system DB 21 for which permission has been obtained. The DB 21 relays the actual search formula received by the real search formula reception / reply section 101 to the DBs 31 and 32 as the process indicated by the circle number “4” a as the relay-type original operation, and sends each answer (respectively). The content is limited to the extent specified by the actual information DB, and is aggregated), and the actual search expression reception reply unit 101 answers to the search client QC12 in a lump.

      Thereby, the real information databases DB 31 and 32 under the relay type search mediation system DB 21 provide an opportunity to provide the real information to the registration type searcher QC12. On the other hand, the registration type searcher QC12 can obtain desired real information from the real information database R under the relay type search mediation system DB21. Both of them only need to support each search and search method, and there is no need to be aware that a compatible method is used.

  FIG. 6 is a hardware configuration diagram of a plurality of systems for realizing the above.

  The systems that appear here are all inter-process linkages within the same device of multiple software running on the hardware of server / client computers connected by standard TCP / IP communication, and separate via communication. Operates through interaction with hardware.

  Each computer includes a TCP / IP communication device for interacting with another system individual. Except for QC12, other devices need to be connected to a network in a different area simultaneously with a plurality of individual systems, or to process communication sessions for different uses on the same network. It is essential to have The QC 12 can change to a single unit by changing the work every time, and sequentially switching the communication destinations. Therefore, the multi-session communication function is not essential. However, from the common sense of the current computer hardware configuration, a multi-session function is provided even if it is not desired.

  Similarly, it is essential for each computer to operate a plurality of software programs, which are sources for generating a plurality of communication sessions, while simultaneously cooperating with each other. Therefore, the central processing unit is at least required to have a multi-process function by connecting to a volatile storage device having a function of preventing inter-process area interference. Further, an internal communication device (data bus) for realizing this inter-process cooperation is necessary. In addition, a permanent storage device (hard disk) that constantly stores a software program to be operated and permanently holds data obtained by communication and process processing is required. However, all of these are common sense configurations of today's general-purpose computers and are not special ones.

  Note that the relay system I01 (DB21) and the real information DB31 are characterized as general-purpose server computers. This is because the amount of information handled is much larger than other client types, and the same type of process and communication session that are operated simultaneously operate in parallel while handling different contents. Therefore, these server computers are equipped with a large number of multi-process central processing units, a vast volatile storage device, and an enhanced internal communication device called an inter-process service bus that connects them in parallel at high speed. . Furthermore, the data communicated and processed here is maintained for the entire system lifetime, and is frequently read and written from the inside and outside so that a rewrite collision occurs. In order to deal with this, a permanent storage device of these server systems requires a database management system because a file system on a hard disk is insufficient. However, a general-purpose one is sufficient.

  The client system is used on the premise of face-to-face operation. In addition, work is performed while an operator operates a plurality of software programs. Therefore, it is desirable to provide a multi-window interpersonal dialogue device. However, this need not be multi-window depending on how the working software is made. Even so, current client computers are typically sold with an operating system based on multi-windows, so they have to be.

  Each computer has almost the same configuration even though the capability of the hardware element is strong or weak, whereas a plurality of different software programs are installed depending on their roles, and each of them operates sequentially or simultaneously. Each software program does not require a physical operation that deviates from a general method of using computer resources. As a process thread managed by a general-purpose operating system such as LINUX that manages the multi-session / process linkage described above, the memory area and internal communication and persistent storage are allocated, and the process thread is different based on the internal logic written as each software. Behave. In particular, software that runs on a server system is configured as a complex of software program elements that play multiple different roles internally, and each software element is also divided into the same one in parallel. It operates to process the contents of. Further, the same type or different type of software element receives the processing / communication result of another software element, and starts or requests the next software element to proceed the processing. Each exists as a thread on the central processing unit and the volatile storage device, so that the computing unit used for processing, the volatile or permanent (nonvolatile) storage area, and the communication destination to the inside or outside do not collide. The order and range of operations are protected and controlled by the operating system.

  The intermediary system I01 (DB21) may be responsible for enormous communication / data processing, including processing of advanced incidental services provided there. For this reason, in FIG. 6, as indicated by “(group)” in particular, hardware having the same software configuration is connected in parallel, or each software program is mounted on a plurality of individual hardware. May be configured in a cluster configuration that operates in a coordinated manner as if it were a single system.

  When different types of software are distributed and installed, the capabilities of the hardware device elements to be assembled may differ depending on the characteristics of the software processing. For example, the hardware in charge of the registration type search support software may have a cluster configuration in which the database management system unit and the database management system are distributed over a plurality of hardware when the summary records to be handled are enormous.

  Alternatively, the hardware in charge of the actual search relay / aggregation software decomposes the returned answer contents into XML element group units and executes the contents of each unit in order to execute the advanced incidental service inside. There is a method to activate and share a number of sub-threads that count and rewrite, and in order to achieve this efficiently, a mass cluster central processing unit and a high-speed volatile storage device connected by a high-speed internal communication bus are provided. The permanent storage device that does not contribute to the performance improvement can be omitted.

  On the other hand, when there are a large number of answer records, a powerful distributed cluster database may be assembled. When a large number of search clients are required to relay the actual information DB that is many times the number of search clients, the parallel processing of each session processing is not rate limiting, and the gate to the communication line becomes a bottleneck. Sometimes it becomes. In order to solve this problem, it is also possible to assemble a plurality of multi-session communication devices in one server hardware and enhance the communication performance until the entire bandwidth of the wide area network to which each is connected is used up.

  Even in the real information DB 31, a cluster database configuration may be used when storing and searching a huge amount of real information records. In the real information database server corresponding to the registration type system, which is an alternative that the present invention should overcome, it is necessary to install software programs for license negotiation and self-created summary records. Other software programs are commercially available in order to realize the operations defined by the existing standard search standards. That is, in order to cope with the registration type, it is necessary to construct and operate these software that is not commercially available on their own. If the whole structure of FIG. 6 is employ | adopted, real information DB group will be open | released from such an unnecessary effort.

  In either case, the service bus extends beyond the range of internal communication to a loosely coupled configuration using an XML Web service or the like on TCP / IP communication. A loosely coupled configuration based on a distributed cluster database is also commercially available. However, the TCP / IP network between the clusters at this time is a closed network separated from the wide area network. However, process traffic from a plurality of hardware logically connected directly to the wide area network via a load balancer or higher-order layer switch can flow to the intercluster closed network. Since the extended service bus and the cluster database are both well-known and well-known in current computer technology, detailed explanation of the operation is omitted.

  The internal logic specific to each software program installed in each hardware will be described in detail below as the internal operation of each functional unit. Further, the inter-process communication with the function unit or external hardware will be described in detail as a cooperative operation that connects the respective processes. However, for the functional elements based on the database management system, the operation is clearly indicated as recording, searching, and reading in the database.

  A TCP / IP network that links these hardware and realizes data communication is realized by interconnection of routers that allocate connections to communication destinations, but is too general, and therefore will not be described. There are cases where networks having wide and closed areas and different communication ranges are physically blocked by a router, or are virtually implemented as VPNs. The load balancer and higher layer switch described above are also components of the TCP / IP network, and are transparently unaware of each component computer group. These are also common sense of today's communication technology and will not be described.

  FIG. 7 is a block diagram showing the overall configuration of a search mediation system to which the present invention is applied.

  As shown in this figure, the present embodiment has the following constituent requirements. With these configuration requirements, a function for executing proxy registration is realized. Below, each component shown with a code | symbol and a name in a figure is demonstrated.

First function group (client management unit): function unit for client management as relay-type mediation system I01 101: actual search expression reception reply unit
The search search / reply interface equivalent to the real information DB, which is the basis of search mediation in the relay type search mediation system.

102: Search client account management section
Acts as a contact point for permission negotiations from the searcher, and reviews the letter of introduction and accepts registration as an actual searcher.

Second function group (registration type search support unit): function unit for search correspondence as registration type compatible mediation system DB 21 200: information holding registration type / compatibility function unit
It plays a role visible in the intermediary system 22 on the registration type side in FIG. 5 and the similar intermediary system DB 21 viewed from the searcher QC12. Actually, it is a partial interface of the mediation system I01 and does not exist as a single unit.

201: Registration type / location exploration support department
It responds to location searches from the registration-type brokerage system 22 and the searcher QC12.

202: Information holding registration type / compatible DB (registration book)
The summary record registered on behalf of the agency is held, and the presence / absence and contents of the corresponding registration are answered to the location search.

3rd function group (proxy registration function part): Function part of summary record proxy creation as registration type compatible intermediary system DB 21 301: Proxy consignment actual information DB group management part
The real information DB group that requests the use of the proxy registration of the service of the relay type search mediation system without managing the real information holding registration by itself on the registration type search mediation system is managed.

302: Permanent search expression generation unit
In response to an instruction from the real information DB management unit 301, a permanent search formula is created for reporting new addition / update records of the substitution destination DB regularly / timely.

303: Summary record creation section
A summary record is created by extracting a specific item “summary key” target item required by the registration service contract.
The summary record is registered in the registration type compatible DB 202 in place of the actual information DB.

304: Real information location response history DB
It holds the “location search action report” that records when the searcher responded to the searcher when the registration of the real information DB was rejected, and the identifier of the “introduction letter” added to this.

Fourth function group (relay processing unit): Retrieval relay / aggregation function unit 401 for the real information DB group as a relay / aggregation type 401: Request actual retrieval formula management unit
It manages which actual search from which searcher is requested to which group of real information DBs under the umbrella, and which search formula is to be answered from which real information DB.

402: Search formula request section
The search search / answer reception interface equivalent to the search client, which is the basis of search mediation in the relay search mediation system. When a synchronous quick response search request is made, it operates in unison with the receiving unit 403.
The real information DB 31 is requested to perform an actual search with the account of the brokerage system itself licensed in the subordinate real information DB 31.

403: Search result receiving section
A search result is received from the real information DB 31 or the like by asynchronous communication using permanent search.

  FIG. 8 outlines the processing flow of the proxy record creation / registration process in FIG. This is realized by the third function group and the fourth function group moving back and forth, and the respective function units operate in sequence, but the internal function of the identifier utilization system 41 that is the real information DB 31 that is a communication partner and the real information registration client Since the configuration is omitted in FIG. 7, an outline is shown in units of function groups.

  Hereinafter, the flow will be described in detail by adding a situation in which the individual function units in FIG. 7 cooperate.

  All the external communications shown in FIGS. 8 to 11 are realized by a protocol that regulates XML data transmission by HTTP-POS on TCP / IP represented by AS2 or ebXML Messaging Service. Other communication methods can also be realized. Internal communication is performed by a service bus including the loosely coupled extension described with reference to FIG.

1. Record creation by the identifier utilization system 50 and record registration in the DB 31 1) Setting of identifier handling work
The identifier usage recording means 52 acquires / sets background information of handling work and prepares for transfer to the usage record.

2) Creation of identifier handling business records
The identifier reading device 51 notifies the appearance of the identifier, and the identifier use recording unit 52 creates an identifier handling record with business background information added thereto.

3) Registration of identifier handling record
The identifier use recording means 52 sends the identifier handling record to the DB 31 that is in charge of registering, maintaining, and using the record.

2. Search relay consignment from DB31 to mediation system I01 and summary record agency registration 1) Application for search mediation consignment
The DB 31 applies to the proxy commissioned real information DB group management unit 301 with a disclosure instruction form designating a mediation target and commissions search mediation. The delegated real information DB group management unit 301 instructs the information holding registration compatible DB 202 to create a summary record account for the DB 31.

2) Permanent search issuance for summary record proxy creation
The delegated real information DB group management unit 301 instructs the permanent search formula generation unit 302 to create, request for, and update a permanent search formula in the real information DB 31 in charge. The permanent retrieval formula is usually created by copying a template for extracting the difference as it is regardless of the target identifier. The template may be modified according to the request from the real information DB.

3) Permanent search registration
The permanent search expression generation unit 302 requests the request search expression management unit 401 to cause the DB 31 to accept the permanent search with the account of the brokerage system itself. The request search formula management unit 401 instructs the search formula request unit 402 to relay the permanent search formula only to the DB 31, and causes the permanent search management unit of the DB 31 to register the regular search formula to be executed periodically and in a timely manner.

4) Permanent search response
As the operation of the permanent search management unit, the DB 31 that has changed the identifier usage record sequentially transmits the response as an asynchronous response to the search result receiving unit 403. The search result receiving unit 403 transfers the received asynchronous answer to the actual search expression management unit 401, and determines that the answer is a permanent search self-requested for proxy registration. (If it is not, it is sent to the merger reply process to the original client as a conventional relay type.)

5) Summary record temporary creation
The answer determined to be for proxy registration is forwarded to the summary record creation unit 303, where a summary key target item is detected and a temporary summary record that does not reflect the disclosure policy is created.

6) Completion of summary record
The summary record creation unit 303 notifies that the registration is in place of the DB 31, acquires the disclosure instruction form registered in the DB 31 from the delegated real information DB group management unit 301, and reflects the setting in the temporary summary record Let Instead of the actual access path to the DB 31, a URL that uses the registration type location search response unit 201 of the relay system I01 as the proxy permission negotiation window is written in the access path to complete the summary record.

7) Summary record agency registration
The summary record creation unit 303 registers the completed summary record in the information holding registration compatible DB 202 by clearly indicating that it is for the DB 31 account. The information holding registration compatible DB 202 completes one proxy registration with an acceptance time.

    FIG. 9 is a cooperation flowchart in which the compatible function group 200 (= DB 21 as a registration-type mediation system) in FIG. 7 performs search interaction with the registration-type search client QC12.

    In the description of FIG. 5, the QC 12 is directly connected in order to briefly explain the subsequent flow, which is a ripple search from the equivalent DB 22. In the registration method, a method is proposed in which not only the location of the real information DB but also the access path to the registration-type mediation system is answered and the searcher can leave the point to solve it by himself. Based on. Here, it is assumed that the QC 12 is not a subscriber of the DB 22, but this is assumed to permit a search under the guarantee of the partner DB 22 by cooperation of an introduction letter described later.

    Hereinafter, the flow will be described in detail by adding a situation in which the individual function units in FIG. 9 cooperate. The second function group is the destination of the summary record proxy registration in FIG. 8, and it is assumed that summary records are stored in the registration compatible DB 202.

S1: Search request
The QC 12 requests the DB 21 to search for the location of the actual information to be obtained. At this time, the QC 12 discloses the identity based on the identity guarantee of the DB 22 that is the partner of the DB 21 and sends the summary key to the registration type search corresponding unit 201.

S2: Summary record search execution
The registration type search corresponding unit 201 confirms that the searcher is based on the identity guarantee of the DB 22 and searches the summary record stored in the registration type compatible DB 202 with the received summary key.

S3: Disclosure judgment
The registration-type compatible DB 202 extracts the answer corresponding to the given summary key from the held summary records. The registration type search support unit 201 determines whether the searcher QC12 corresponds to the disclosure target person described in the extracted summary record, and excludes the non-corresponding record from the answer target.

S4: Location disclosure response and letter of introduction
The registration type search correspondence unit 201 merges only the summary records for which the QC 12 is a disclosure subject, and a “location disclosure introduction letter” (FIG. 5) that electronically signs that the search permission negotiation destination URL is disclosed to the QC 12 by the DB 21. The merger summary record is returned to the QC 12 with the attachment of 24).

S5: Re-search when unsuccessful
The QC 12 determines whether the expected number or the specific connection destination is included from the search permission negotiation destination URL that is considered to be the location of the answered real information DB group. Make corrections that make the disclosure of the time clearer and try again.

S6: Disclosure record and introduction letter registration
The registration-type search correspondence unit 201 records when and where the disclosure was made and what the identifier of the introduction letter signature was in the location response history list (described later with reference to FIG. 23) of the location response history DB 304. In addition, the search response fee is recorded in the charge management DB 110 (with an identity guarantee identifier added to the account of the affiliated DB 22 that guarantees the identity).

  Next, a process in which the QC 12 that has detected the location of the real information DB performs a search permission negotiation will be described with reference to FIG.

  The QC 12 acquires the URL of the destination of the search permission negotiation disclosed by the DB 21 of FIG. 24 and the location disclosure introduction letter that the DB 21 can use for the automatic search permission negotiation. However, actually, this is not a direct path to the final actual information DB 31 but a path to the account management unit 102 of the DB 21 serving as the proxy window.

  In FIG. 24, only the real information DB path is shown, but even if it is presented as https as in the example, the license negotiation destination is commonly used as a convention such as a port number below it or ~ / Negotiation /. If specified, there is no need to indicate the negotiation destination path separately. The QC12 can know that the domain or IP address expressed as the URL belongs to the operator of the search mediation system I01 by inquiring ICAN NIC, etc., but the business using the DB31 The direct path to the DB 31 from which the name can be estimated remains secret. Since QC12 is dissatisfied with this, since there is no other means for receiving the disclosure of the direct path to DB 31 based on the location disclosure policy of DB 31, permission negotiation is performed for the path to account management unit 102 of DB 21 There is only.

    S7: Application for permission negotiation (response denial): The QC 12 presents a letter of introduction and requests a search permission from the account management unit 102. If the account management unit 102 determines that an introduction letter without its own signature has been received, the account management unit 102 does not intentionally return a communication completion response of the HTTP-POST protocol or protects the mediation system I01. An error code can be returned to pretend that the DB 21 does not exist or is not a service type subject to search permission negotiation expected by the QC 12.

    S8: Referral letter referral: The account management unit 102, when it is possible to confirm from the electronic certificate that the referral letter attached to the search permission negotiation is issued by the DB 21, the location response history using the referral letter identifier as a key The location response history book in the DB 304 is searched.

    S9: Response history record search / permission determination: In the location response history DB 304, whether the identifier key of the introduction letter corresponds to the identifier of the “introduction letter” appended to the “location search action report” registered by the search correspondence unit 201 And responding to the account management unit 102 as to whether or not the searcher is a registered search mediation system that has passed the first screening for accepting the actual search.

        The account management unit 102 determines whether the disclosure identity presented by the QC 12 matches the searcher account requirement policy determined by the DB 21 itself.

  The searcher account requirement policy stipulates conditions to be permitted by the search mediation system as a searcher who can use the relay type search mediation service. For example, all identities are disclosed in real names, and legal existence and trust (payment) means are proved by a third party using an electronic signature, or identity attributes are partially disclosed to notify the real name. However, it is possible to stipulate that the search intermediary system of the partner company guarantees the existence and trust of the searcher and the authenticity of the disclosure attribute.

  How to determine the individual items used for the determination should be different for each search mediation service, but the items that determine whether or not it is possible may be shared by all search mediation services that are affiliated. desirable.

    S10: Refusal reply / decision deficiency slip: If the disclosure identity of QC12 does not conform to the searcher account requirement policy, the account management unit 102 returns a “decision deficiency slip” listing the deficiencies of the disclosure identity to QC12 and negotiates permission Terminate the session. A determination deficiency vote will also be described later.

    S11: Permission reply: When the account management unit 102 determines that the policy is met, an identifier is issued to the identity of the QC 12 or its identity guarantee, and the search account is provisionally registered. At the same time, only the summary key items included in the referral letter are set to search the temporary account for the scope limitation.

        Execute a real search with a limited account limited to temporary account identifiers and searchable summary key items = Send registration form to QC12 as a reply to license negotiation to perform full registration to search mediation system I01 To do.

    S12: Review of judgment: QC12 looks at the received judgment suggestion vote or the limited notice described in the registration form, and decides whether to correct the identification disclosure limit or accept the result.

    S13: Actual searcher registration application: When the QC 12 accepts a limited permission condition, it adds an identity disclosure range in the actual search to the registration form and requests the account management unit 102 to perform searcher registration.

        To get rid of the restrictions within the summary key range, you can publish your real name and apply for a full account. In this case, the payment means and the public key used for actual search transmission are also registered.

    S14: Actual search account issuance: The account management unit 102 sets the identity disclosure range of the QC 12 described in the registration form as a temporary account, and uses the access path to the actual search reception unit 101 that can perform the actual search as an account slip. Please answer with the answer. When the searcher registration is performed without revealing the real name, since the identity is broken from the public key of the normal searcher, the transmission key to I01 used for the real search and settlement (the back key of the secret key issued exclusively for QC12: However, it is not published.

  The process in which the QC 12 having acquired the actual information search account performs an actual search will be described with reference to FIG.

    S15: Actual search request: The QC 12 encrypts and signs the actual search expression with the passed back key and its own private key, and transmits it to the actual search reception unit 101. The actual search receiving unit 101 determines only whether the back key used in the transmitted actual search expression is for a registered searcher. If it is determined not to be legitimate, it does not return a response or an error code. Return and end the subsequent communication.

    S16: If the back key hash verification passes, the actual search reception unit 101 queries the account management unit 102 for the presented search account identifier.

    S17: The account management unit 102 answers the public key of the registrant corresponding to the account identifier and the search permission summary key. The actual search reception unit 101 decodes with the registered public key and confirms that the signature belongs to the registrant. Processing for the search range restriction and relay destination restriction will be described later.

    S18: The real search receiving unit 101 sends the real search formula to the request real search formula management unit 401 of the relay processing group 400 with the request form instructing the account information of the QC12, and forwards the real search formula to the proxy as a relay type. Start the search.

    S19: The relay processing group 400 sends the actual search formula to the DB 31 (others) using the account I01 and requests execution of the actual search.

    S20: The DB 31 extracts a handling record corresponding to the actual search formula and replies to the relay processing group 400. The request actual search expression management unit 401 of the relay processing group 400 determines that the answer is from the DB 31 and that the real requester is QC12.

    S21: Omitted because it will be described later as an option.

    S22: When the relay processing group 400 receives the reply by relaying the search formula other than the DB 31, it merges them, indicates that they are addressed to the QC 12, and transfers them to the actual search reception unit 101. The actual search reception unit 101 returns the merged actual information to the QC 12 in a lump. QC12 achieves the purpose of search and actual search.

    S23: The relay processing group 400 sorts the contents of the actual information provided to the QC 12 or the information provision fee as one answer for each reply source, and notifies the account management unit 102 of it.

    S24: The QC 12 settles the amount charged according to the reported payment means. (Omitted in the figure)

    S25: The proxy actual information DB group management unit 301 notifies the sales distribution of the response contribution to the DB 31.

  As described above, in accordance with the description of FIG. 8 to FIG. 10, the relay type creates a summary record from the group of real information DBs affiliated with the relay type location search method, and substitutes for the real information DB for the registration type search. The process of disclosing location is explained.

  Next, specific examples of summary records and summary keys will be described.

  The summary record and the summary key are exchange / retention data unique to the registration type search mediation method, and belong to the background art of the present invention. In both cases, a draft XML schema is proposed in the EU BRIDGE project as a research stage, but nothing has been established as a standard. The present invention uses the handling record of an article with an identifier as the subject of explanation, but it covers all things that can be specified by identifiers that are standardized in common in the industry, such as ISO-15559 and URI. Can do.

  Accordingly, FIG. 12 is a diagram showing an estimation example (virtual example) of an actual information record of an identifier handling record and a summary record for registration mediation, assuming an article handling record and a business slip having an identifier. . FIG. 13 is a diagram showing a virtual summary key and a real search expression / result in the present embodiment.

  At present, the registration-type search mediation system has not been standardized, so it has been decided what kind of identifier is to be mediated and what items are selected for the search specific key of the summary record. Absent. Since the summary key is premised on directly naming the contents of the item or restricting it with a wild card or the like, it is still unconfirmed.

  Hereinafter, what the summary record and the summary key are will be described as a process in which the registration type concept is established based on the virtual example suggested in FIG. 1 of the conceptual diagram of the registration type search mediation.

  The possession registration summary record is used for acquiring the individual identification (category / range) number and the actual information as the primary key corresponding to the summary key type that the DB 21 to 23, etc. are subject to inquiry, from the actual information record. It consists of a network path to the real information DBs 31 to 37 to which access permission is sought and the identification (classification / range) of searchers to be disclosed / non-disclosed / individually negotiated.

  First, description of the article tracking summary record in the upper part of FIG. 12 will be described.

1) From the actual information record of the article handling record, the individual identification number assigned to the article recognized as an object is extracted as a “main item” regardless of the application category. In the original handling record, it was separated from the individual product of the package itself and the container that carried it, but on the summary record it is merged as simply a classification of goods.
Other related source items will be dropped. Another summary record may be registered with these related items as main items. (Example: Searching for categories of goods handled in units of handling establishments, etc.)
2) When a search key is named for this main item or searched as a range, a network access path (for example, Web service URL) to the DB 33 that is answered as a real information holding destination is described.

    3) The person to be disclosed is designated by disclosure / non-disclosure or individual judgment classification, identification of company identifiers, or industry classification.

  In the example, a code is assumed in which the company identifier is a hyphen and the company number is connected to the affiliated business. In addition, the first two digits of the company number represent the industry classification, and a wild card “*” not specifying the affiliated business office is described. The first two digits may represent a country or region, or an industry division such as chemistry or transportation. However, this is only a hypothetical example, and the system of the upper classification and company number is diverse, such as GS1 Company Prefix, ISO / IEC15459, UN / CEFACT Partner identification code, and does not correspond directly to this, or only one of them is satisfied There are no patterns. In that case, the same effect can be obtained by using another wild card notation, or by creating a different target person table and referring to it. In any case, the searcher presents the identification company number, determines which restriction category it enters, and decides whether or not the URL can be disclosed.

  Next, description of the slip inquiry summary record in the lower part of FIG. 12 will be described.

    1) The main item from the business slip is simplified as a slip identification number, and the reference destination path and the disclosure target person are also described.

    2) The business slip inquiry service is different from the article handling record in the description items and search method, and therefore, a Web service with a different URL is described as an inquiry destination.

  Next, description of the summary key will be described with reference to FIG.

    1) The summary key is used to specify or range the description contents in the main item of the summary record, and clearly indicates the individual identifier and slip number of the object.

    2) For the summary key, it is possible to assume a search operation such that each summary record having a different main item or a reference access path extracted from a plurality of main items overlaps as a logical product.

  Further, the use of the summary key will be described with reference to FIG.

    1) When inquiring about the access path to the real information DB that holds the actual information that you want to find in the information holding registration DB, the actual search expression that you want to use consists of different types of information items and corresponds to the type of each main item Simplify to summary key.

    2) According to the disclosure policy of the actual information holder, the location response may be rejected depending on the identity (attribute) of the searcher. In that case, post search is impossible.

  The “access path response” in FIG. 13 is illustrated as being different from the summary record in FIG. 12 for the item tracking and slip details. The summary record for storage / retrieval is based on the premise that the summary key item is used as the search primary key, whereas the “access path response” for the search answer is the actual information that the searcher should contact from now on. The description method has been changed in order to inform that the possession access pass is the main item, and that the pass destination contains records of a plurality of summary key items simultaneously. The answer is a true result of whether or not the location has been disclosed, and the designation of the subject of the location disclosure is naturally deleted as an item that should not be disclosed to the outside.

  The summary record in FIG. 12 and the summary key and access path response in FIG. 13 use XSLT if the original actual record, the actual search expression, and the summary record are described in XML with a specified schema. Each can be easily converted. By adding supplementary information as XML elements / attributes such as a disclosure target person and type to each, it can be automatically created. Even if these are not XML, but are CSV data in which the order semantics of the fixed-length EDI data and row and column structures are defined, the order contents can be rearranged into another semantic order, and supplementary information can be put in a specific order. Equivalent replacement processing is possible.

  In the registration-type method proposed so far, it is assumed that the searcher is a subscriber of the search mediation system, and the introduced real information DB is also a member of the same search mediation system. However, this alone limits the scope of the search unless a search mediation system is the only one in the world.

  Therefore, the partnership search in FIG. 2 is being studied. When DB 23 receives a ripple search indirectly from DB 22, in order to make a disclosure determination with the original summary record of FIG. 12 and FIG. 13, DB 23 does not disclose all the QC12's identification company numbers, and DB 23 is subject to disclosure. It cannot be determined whether or not. Here, since the registered search mediation system DB23 of the partner who receives the ripple search with the original searcher QC12 does not have a direct contract relationship, the QC12 identifies itself to an unknown search mediation service operator that operates the DB23. There is a possibility that there is a concern whether it will be exposed to a group of real information DBs affiliated with the member who are originally irrelevant or another subscriber searcher.

  Therefore, as a means of resolving these concerns in the ripple search, the search mediation system to which the searcher is directly subscribed guarantees the searcher's identity to the other intermediary system of the partner, and the searcher's identity is fully opened. Although not shown, a method for realizing a partnership search by presenting only the background attribute is shown as part of the present invention.

  FIG. 14 is a diagram of an embodiment in which “identity” is added to the summary key for article tracking in FIG.

  When the QC12 itself conducts a secondary search by introducing a traverse or a direct introduction through a brokerage system of a direct subscriber (scenario for simplification in FIG. 9), the business type, Only present the background attributes as a business operator in the business area, there is no false, there is an entity that bears all costs related to the search and any subsequent legal responsibility, and that means of implementation can be provided, It shows that the DB 22 to which the QC 12 is directly subscribed guarantees. The “identity code” is a synonym for concealing the true identity company number of the QC 12, and its correspondence is known only by the DB 22 that issued it except for the QC 12. The identity code can be disposable only for the current search, or it can be permanent in the future. The DBs 21 and 23 that have received the ripple search use this identity code to recognize the concealed searcher until the search (and the search permission negotiation) is completed.

  The authenticity of the identity is secured by the public key hash signature of the mediation system that guarantees the identity. The QC 12 reports the contents of this description by joining the DB 22 to which it directly subscribes, and tells the DB 22 how far to identify itself when requesting a ripple search, thereby disclosing the contents of the notification. This part is created by selecting a background attribute item and obtaining a hash signature with the secret key of the DB 22 for the content.

  In a ripple search or a search from a searcher who is not a direct subscriber, the identity of the DB 23 or DB 21 is authentic and the authenticity of the signature of the DB 22 is that the hash value decoded with the public key of the DB 22 and the hash of the identity text It can be easily distinguished by matching the values. At this stage, the presented identity attribute is true, and it is guaranteed that the DB 22 can ask for the replacement of the search cost and the subsequent fulfillment of the obligation based on the identity guarantee inquiry identifier based on the partnership agreement.

  A process in which a searcher identity is used as a registered search will be described. The registration-type methods proposed so far are based on the premise that all identities are disclosed when searching and subsequent search permission negotiations and actual searches are performed. In the present invention, the search process of the registration-type search mediation method is as shown in the following 1) to 3) according to the degree of disclosure of the searcher's identity.

1) When searchers disclose all identity details:
When all of the identity attributes of the searcher himself (= identity company number) are disclosed, the disclosure / rejection target classification of FIG. 12 is applied as it is. Here, it is assumed that the notation to be disclosed is a code system in which a company-specific number follows a numeric code representing the industry category of a searcher. In contrast, the identity company number of the searcher guaranteed by the DB 22 is directly checked against this location disclosure policy.

2) When a searcher discloses only business category attributes without identity:
A search account for a pseudonym indicating that it is a proxy for a searcher who discloses only the business category in anonymity assured as a subscriber of the intermediary system DB22 of the registered registration type system, presenting an identification code, and seeking a search . The mediation system that has received the influence determines whether the searcher's disclosure identity attribute matches the code classification of the disclosure target person in FIG.

3) When a searcher makes all identities undisclosed:
It clearly indicates that it is searching on behalf of an anonymous searcher whose identity is guaranteed, and presents the identification code of the registration-type brokerage system D2 to request a determination. In the example of FIG. 12, when the identity code of the DB 22 that is the intermediary system on the request side is other than the specific disclosure target: 6874- *, it is not a disclosure target as it is. Disclosure Negotiation Target: If it is an identity code corresponding to 7 *-* / 93 *-*, the identity code = actual identity is notified to the summary record registrant DB 36 from D23, and it is judged whether or not it is possible by the judgment of the DB 36 itself. Is done. The DB 22 bundles searches under its umbrella as a representative of a specific industry or region = if an anonymous searcher QC12 is confident that the membership qualification is met, tracking goods to that industry or region group By assigning a specific disclosure target of the summary record to the identity code 6874- * of the DB 22, which is the representative, the anonymous search can be collectively granted to the group.

  However, when the partial disclosure of the identity attribute is not shared, the actual information location disclosure process can only be negotiated by exposing the entire identity of the searcher or anonymous. Since it is premised on the search for disclosure of records related to corporate business secrets, it is not actually possible to disclose to anonymous people indiscriminately, and such attempts will be rejected as obvious. Is natural.

  However, even if the true identity is exposed, it is very difficult to describe it in the summary record in advance as a subject of disclosure. Naturally, the searcher is not familiar with the installer of the actual information DB that registers the summary record or the owner of the actual information that registers the identifier handling record therein. Other than the notation based on this identity attribute, there is no practical means for listing such unknown searchers on the summary record as disclosure subjects prior to determination.

  Therefore, in practice, as long as we do not take a method such as classification based on the searcher attributes at least, the permission for disclosure of the location is obtained by inquiring the registered searcher identity one by one. There is no other way than judging from the registration source. Perhaps that decision is not feasible in an electronic system, for example, a person who does not know at all about the client, manually consulting the Koshin office, checking it against the company's examination standards, and making a final decision from a management perspective. Including the process, the immediate response, where the registration type is dominant, will be completely covered. On the contrary, the registration method itself can even become meaningless.

  On the other hand, in the present invention, a method for partially disclosing the identity attribute is also presented, and a method for preventing identification of who is interested in the matter is also presented. However, the identity disclosure policy and location disclosure policy used here are transferred as they are for use in relay-type search mediation described later. As described below, it is a relay-type advanced incidental function that restricts the disclosure content = the background attribute item of the restriction target designed for granularity filter processing realizes completely compatible operation even in the registration type search The background is what we can do.

  First, the outline of the relay type granular filter will be described.

  FIG. 15 is obtained by adding blocks related to the following granularity processing to the functional block diagram as the basis of the present invention of FIG. Each additional functional block will be described. In FIG. 15, functional blocks related to billing settlement and record creation / registration and message paths for internal / external communication, which are not directly related to the granularity processing and its application as a policy reflection described later, are omitted. In addition, if the registration type search correspondence group 200 for compatibility with the registration type search, the permanent search formula creation unit 302, the summary record creation unit 303, and the response history DB 304 are omitted, a search formula relay that can provide a granularity filter function as an auxiliary service.・ It will be the original form of an answer-intensive search system.

First function group: functional unit for client management as relay-type mediation system I01 104: granularity processing unit:
Based on the disclosure identity attribute of the searcher and the target classification registered by each real information DB, a rewrite “granularity filter” process is performed to reduce the information granularity, which is the detail of the content of the answer.

Third function group: Membership information DB policy reflection unit diverted to the creation of summary record agency 305: Disclosure policy for each real information DB: Information disclosure registered by each real information DB affiliated to a relay-type affiliate serving as an information provider Keep policy.

  FIG. 15 shows a process in which the particle size filtering process proceeds according to the command sheet of DB 31. This corresponds to a portion omitted as an option in the description of S21 in FIG.

1) Registration of disclosure policy setting directive:
The real information DB 31 registers the real information disclosure policy setting command form in the DB management unit 301. This is stored in the expanded disclosure policy DB 305.

  The actual information disclosure policy setting instruction form specifies how to combine the disclosure granularity level for each DB item shown in FIG. 17 for each searcher category in the composite table of FIGS. 17 and 18 in two layers. FIG. 17 itself is presented as a menu common to the user by the mediation system I01 that provides the granularity filter service, and is not included in the actual information disclosure policy setting command sheet itself. FIG. 18 includes two layers of a searcher category-specific class setting table (FIG. 18A) and a class definition table (FIG. 18B).

2) Registered identity attributes
The conventional searcher QC11 has registered his / her identity with the account management unit 102 as A003 in FIG. Also, the identity disclosure policy setting instruction form is reported, and the identity attribute to be disclosed is registered for each background attribute of the real information DB of the search relay destination in FIG.

3) Relay execution
The QC 11 sends to the reception unit 101 an actual information search formula with an example of negotiation conditions for relaxing the disclosure restriction in order to receive provision of actual information expected even when paying a price, as illustrated in FIG. The accepting unit 101 reports that it is an actual search from the QC 11, and through the relay processing unit, the negotiation condition is removed and the actual search formula is relayed to the group of real information DBs under the group.

  At this time, the requested actual search expression management unit 401 searches the disclosure policy DB 305 to obtain the disclosure policy setting slip of FIG. 18A, and specifies the disclosure identity of the QC 11 as an unconditional or class 1 target in the example. We will refrain from relaying here, as it is obvious that it is completely undisclosed from the beginning.

4) Particle size filter processing
Recognizing that there is a searcher from the answer from the DB 31, the requested actual search expression management unit 401 sends the actual information to the granularity processing unit 401. The granularity processing unit 401 acquires the disclosure identity setting of the QC 11 from the account management unit 102 and the disclosure policy setting slip (FIG. 18) of the DB 31 from the disclosure policy DB 305 by searching. The granularity processing unit 401 determines the granularity class to be applied by matching both of them in the class setting table of FIG. 18A, and drops the granularity processing rule for each class from the class definition table of FIG. 18B to the granularity level of FIG. Execute the granularity filter process that rewrites the contents of the item.

  The reason why FIGS. 17 and 18 are composed of a multi-layered table is that various filter classes having different disclosure levels are set for each information item and applied to searchers / searchers having various attributes. This is because it is set in any combination. By changing the level structure within a class, it can be applied to all subjects to whom this class is applied at the same time. If the business relationship with the subject changes, the class to be applied can be switched. The relationship can be shown explicitly.

  Of course, a flat table in which the level of FIG. 17 is directly written for each subject can be used, but it is foreseen that the determination of application of the level is often performed manually, and the maintenance becomes complicated. For the disclosure determination in the search mediation system, it may be read directly from a previously flatly developed table that is updated each time a setting is changed.

  The identity guarantee by partial disclosure of the background attribute of the disclosure identity of the searcher of the present invention is based on the identity disclosure policy of the searcher for this granularity processing. As a pair, a description will be given of a process in which the location disclosure policy of the actual information DB is reflected by the target person attribute designation for the granularity filter processing.

    1) The creation unit 303 that has received a permanent search response for creating a summary record from the DB 31 retrieves the disclosure policy setting slip of the DB 31 from the disclosure policy DB 305. The class level configuration table of FIG. 17 is traced from the disclosure subject person class table of FIG. 18, and the summary record is completed for all the target attributes that do not correspond to all non-disclosure of all information items, and is registered in the compatible DB 202 as a substitute. .

  At this time, unless each information item is completely undisclosed, location disclosure is performed because the path disclosed as the permission negotiation destination is the path to the brokerage system I01 itself, not the path to the actual information DB 31. Even if it reaches, the disclosure content including the identity of the DB 31 can be limited by the granularity filter as the intention of the DB 31, and the actual information accumulated by the DB 31 is sold even with such a coarse granularity. This is because the posterior merit unique to the relay type that the opportunity can be created is refrained from the rigorous rigorousness of the registration type.

    2) When the registration type searcher QC12 has performed a ripple search with the registered attribute searcher corresponding to the registered searcher QC12, as long as the disclosure attribute is guaranteed, the disclosure is set in the compatible DB 202. Go straight to the policy.

  Since this policy is set on the basis of post-granularity filtering as in 1), it is set based on a considerably looser standard than a normal registration type summary record, so the existence of the DB 31 with the account management unit 102 of the brokerage system I01 as a proxy window Are often kept secret and are subject to disclosure.

  The actual determination operation will be described with reference to FIGS.

  When the searcher of A001, which is the drug store chain in FIG. 19, receives a disclosure determination based on the policy of FIG. 18, even if his identity details are hidden, the disclosed industry attribute is the “drug store chain to be disclosed”. Therefore, the intermediary system I01 discloses the location (proxy agent) of the DB 31.

  If the real information DB 31 is a real information DB set up by a retailer and the searcher is A002, the search is not performed by exposing the real name, and here the disclosed industry classification is the object of non-disclosure. Since it is a certain “pharmaceutical industry”, the location is not disclosed in this, and the access path to the DB 31 is omitted in the reply. (The path to the actual information DB corresponding to other disclosures will be answered)

  In the policy shown in FIG. 17, the non-disclosure setting is absolutely not set for those who do not clarify the type of business, so the access path to the DB 31 is not included in the location response.

  In 6) in “2. Summary record proxy registration” in the summary record proxy creation process in FIG. 8, “Summary record creation unit 303 acquires the disclosure instruction form registered in DB 31 from real information DB group management unit 301. However, if the disclosure is not in accordance with the present invention, the disclosure target person's setting may be the name or the searcher's industry / regional division or the specific company's affiliated establishment. There is concern that the disclosure / non-disclosure may not be controlled as intended by the actual information holder because only the vague designation of the card can be specified. In particular, if a company identifier is allowed as a different code system, it is difficult to discriminate these for each system.

  As an example, the company code of GS1 has only high-order digits that identify the company's home country, and cannot specify the type of business. The JEDC standard company code has only high-order digits that identify the industry division and cannot specify the business area. Neither has a function to represent items that can be requirements for disclosure, such as business scale and capital / affiliation relationships.

  In contrast, in the present invention, in addition to the example illustrated in FIG. 19, any matter that should be considered as an information disclosure policy can be added and provided in detail. Can be requested.

  By newly providing the disclosure policy DB 305, the disclosure policy setting form can be easily used as a database record. This is not only for setting the disclosure policy for granularity filter processing and summary record delegation, but also for the disclosure policy for the summary record once registered. This is also effective when the correction is made later for the convenience of the DB 31. The process will be described for two scenes using FIG. 15 again.

    1. Revise the location disclosure policy set for existing summary records.

        1) The DB 31 sends a granularity disclosure policy change instruction form (format is the same as in FIG. 18) to the DB group management unit 301. The DB group management unit 301 registers this in the disclosure policy DB 305 and searches the registration compatible DB 202 to search for summary records corresponding to the changed disclosure policy.

        2) The DB group management unit 301 that has retrieved the summary record that is the policy change target notifies the summary record creation unit 303 of the primary key of the setting slip and the summary record, and instructs the re-registration of the change.

        3) Upon receiving the change instruction, the summary record creation unit 303 retrieves and acquires the setting slip from the disclosure policy DB 305 and the summary record from the registration-type compatible DB 202 using the primary key, and replaces the revised summary record with the rewritten policy with the replacement primary key Is explicitly registered in the registration type compatible DB 202.

        4) The disclosure policy DB 305 holds the disclosure policy setting form management table of FIG. In this way, the change command sheet is managed as a version number, and reflection status status management of incomplete / completed correction registration processing of each version is performed. The summary record creation unit 303 updates this status when correction is completed.

With this effect, the DB 31 not only creates a summary record for the registration type, but also instructs the change of the location disclosure policy as the registration type simply to change the setting of the relay type granularity filter without being aware of it. You can achieve it at the same time just by going.
The disclosure policy overwrite of the summary record stored in the registration compatible DB 202 may not be immediately reflected when the number of records is enormous. There is a second scene to deal with this.

    2. Summary records that are not in time for revision are temporarily revised with an unreflected revision policy.

        5) The search correspondence unit 201 reads that the summary record acquired from the registration compatible DB 202 is that of the DB 31, and then searches the management policy setting form management table of FIG. Get the reflection status status of the policy setting vote. If the status is not completed, the policy setting slip itself is acquired.

        6) Verify that the disclosure policy written here is consistent with the disclosure policy of the acquired summary record. When there is a conflict, it is confirmed that the creation / modification time of the summary record is older than the recording time of the disclosure policy, and the disclosure determination is performed according to the new policy setting form.

        7) The summary record that is determined not to be updated in time is updated by the search correspondence unit 201 with a new disclosure policy and registered in the registration-type compatible DB 202.

  Temporary correction can be omitted originally. In order to reduce the processing, only the status of the reflection status of the batch correction in the disclosure policy DB 305 can be referred to first, and can be skipped if not necessary, or can be reliably executed if necessary.

  Here, the introduction letter in this embodiment will be described.

  The referral letter is a search that has passed the primary disclosure examination as the location disclosure target person specified by the real information DB, as it alleviates the trouble of the search permission negotiation between the parties, which is unavoidable after the registration type search. It is proposed that it is sent to the real information DB disclosed by the mediation system. However, as with the summary record, no standard has yet been established that defines the description and handling. As a similar technology, OpenID has been standardized, but this is intended to allow service and customer gathering among member sites for the general public, and is highly confidential business information that depends on individual content. In an application in which a certain identifier handling record is disclosed between companies, it is necessary to determine whether or not to disclose specific information to an unknown party, which is difficult to apply.

  Even if the referral letter is standardized, it is up to each implementation to determine how the real information DB that received the location introduction processes this referral letter. When the searcher fully discloses his / her identity and requests permission negotiations, as described above, the letter of introduction helps to establish communication at the beginning of the negotiation, but the actual judgment depends on the other party. In order to anonymously disclose only a part of the identity attribute and seek negotiations, it is more important than the introduction letter to share the identity attribute described above and the mutual trust mechanism for authenticity.

  In the registration method, it may be possible to use a method of trusting the letter of introduction heavily, but in that case, even if there is a mechanism of identity guarantee, the judgment on whether or not to disclose in the primary examination will not be serious. I do not get. Moreover, for the real information DB side, there is still a burden that it is necessary to execute serious management by itself, what is allowed to be acquired and what is allowed when the licensed searcher actually searches.

  The relay-type search intermediary system can act as a proxy party for this licensing negotiation, and can also act as a granularity filter that handles disclosure restrictions depending on the contents thereafter. It can be processed by itself, and the standard for issuing referral letters can be moderated. This is merely diverting the same framework to the agency reply that receives the search permission negotiation and the actual search on behalf of the actual information DB to which the relay type intermediary system belongs.

  The referral letter itself has some utility in the registration type searcher and the real information DB, but in the present invention based on the relay type, the referral letter issuing history list in FIG. The actual purpose is to limit the search of the searcher, and issuance of a letter of introduction to the searcher is not very important.

  Here, the introduction letter and identity in this embodiment will be described.

  FIG. 23 is an example of an introduction letter as a part of the actual information location access path issued by the search mediation system assumed in the present invention. The letter of introduction takes the form of adding an item as a letter of introduction for each actual search path as part of the access path response message that is the search answer. The structure of this message takes into consideration that the searcher can grasp the number of disclosure destinations or rejection sources as the existence identified for each corresponding summary key set. Each referral letter item is managed individually by the intermediary system by generating “serial number” which is an identifier as a referral letter. This indicates that an introduction letter is not issued for the entire access path response but is issued to each disclosure destination, and is valid only for the disclosure destination. Basically, it is the same as time stamp authentication, and by attaching a hash signature of this item part, the search mediating system as the signer proves authenticity, thereby guaranteeing distribution. The reason for determination can be described in the letter of introduction. When the location is disclosed, which permission condition is applied for each summary key is indicated by the codes C1 and S1 that should be shared under different rules. In the case of a non-disclosure refusal response, the reason for determining why the non-disclosure was made is notified. Based on this reason, the rejected searcher can determine how far the identity is exposed to reach the desired information, or know that there is no further hope.

  FIG. 24 is an example of an introduction letter including an identification letter part used for search permission negotiation, in which the introduction letter part of the access path response in FIG. 23 and the identification letter part of the search summary key in FIG. It is. Here, the temporary identity identifier and the disclosure attribute issued by the directly joined search mediation system DB 22 used when searching for the partial identity disclosure are used as they are. When permission negotiations are unsuccessful, there may be cases where permission is granted by increasing disclosure attributes while maintaining a temporary identity identifier. Therefore, the searcher Q12 asks the registration type search mediation system DB 22 to join to reissue the identity whose disclosure attribute is increased, and obtains a new electronic signature for the disclosure attribute increased by the same temporary identity identifier. In some cases, the permission negotiation can be successful while being identified with the disclosed searcher identified in the letter of introduction. In the relay-type search mediation system, the location access path to be disclosed is not the actual information DB but the relay system itself, and even if the search permission is granted for the time being, let's post-process the actual search expression to be accepted and the actual information to be supplied In general, there is no need to distinguish between location disclosure and search permission determination. However, the policy is changed depending on the situation caused by the time difference between the search response and the search permission, such as the information disclosure policy setting form of FIG. 18A being corrected from the point of location disclosure determination or the tie-up with the DB 22 being canceled. There is also a case. In this way, the letter of introduction and identity provide a way to deal with some of these changes.

  The location response history book of FIG. 22 has an item of “original information DB path” which is not described in the introduction letter. This is the access path itself of the actual information text that the relay-type search mediation system grasps at the time of the registry search and informs the searcher only of the proxy window and conceals it. The feature of the present invention lies in answering by replacing the proxy window.

  The relay-type search mediation system I01 effectively uses the location response history book, which is an introduction history of this letter of introduction, for search permission and subsequent search restrictions. A procedure is established in which the search expression restriction omitted in the description of S17 in FIG. 11 is executed by this location response history book.

1) Referral letter verification As S7 in FIG. 10, the account management unit 102 searches the location response history list from the identity identifier and the identifier of the referral letter presented when the searcher QC12 requests permission negotiation, and discloses them to the QC12. The original real information DB path that holds the summary key and the actual information that is the basis of the summary key is confirmed.

2) Issuance of restricted account In the search account provisional registration after permission determination after S10 in FIG. 10, the disclosure summary key and its original actual information DB path are recorded in the account of QC12, and the main registration in S13 and S14 is advanced.

3) Restricted Account Inquiry As a response to the actual search account inquiry S16 from the QC12 of FIG. 11, the summary key disclosed in the QC12 and the list of the actual information DB path are delivered in S17.

4) Real search formula restriction correction The real search accepting unit makes the identifier handling record to be searched satisfy the logical product with the summary key group to which all items are passed for the requested real search formula. Modify to be limited.

5) Relay Destination Restriction After the restriction correction to the actual search expression, the actual search receiving unit 101 specifies the actual information DB corresponding to the summary key originally acquired as the actual information DB path for the relay processing group 400. Ask them to relay only this.

6) Limited Relay Execution The relay processing group 400 omits the normal relay target determination described in the explanation of FIG. 15 3) supplementary relay execution, and only to the real information DB group originally corresponding to the real information DB path. Executes real search relay.

  By the above measures, mediating with minimum risk to the real information DB group that joins guest searchers who are not subscribers of the original relay type search relay service connected through registration type search and who do not disclose their identities. Can do. Thereafter, content restriction is further imposed by the granularity filter processing corresponding to the disclosure identity of the searcher QC12, and information protection is strengthened. Even at this time, even if there is no specific instruction in the disclosure policy setting table from the real information DB, the information content of the same category that does not correspond to the summary key determined by the search as a measure of the granularity processing unit 104 of the relay type search assembly system It is also possible to apply the strongest granularity processing, such as deleting. Since the secondary and tertiary information protection functions can be fully utilized, the relay-type intermediary system compatible with the registration-type search can execute the initial disclosure determination under moderate conditions.

  In this way, the real information DB corresponding only to the conventional real search method can be registered without any modification by joining the search-type relay / answer-intensive search mediation service with the registration-type compatible function. Participate in a type-based search mediation network.

  Here, a second embodiment obtained by partially modifying the embodiment described above will be described below.

  In a form different from the embodiment of FIG. 5, there is a form in which a real information DB group corresponding only to a conventional standard belonging to a relay type participates in registration type search mediation.

  FIG. 25 is a block diagram showing a form in which the service of the relay search mediation system itself is indirectly registered in the registration mediation system as a real information holder under the search network operating in the registration type search mediation system of the present embodiment. It is.

  In the present embodiment, the real information DB groups 41 to 44 that cannot directly correspond to the registration type search mediation system (not necessary) belong to the relay type search mediation system I02. By registering the location of the actual information as a service of the relay search mediation system itself, the actual search is received through the service of the relay search mediation system I02, and is under the control of the relay search mediation system. The DBs 41 to 44 can directly receive incidental services such as a granularity filter of the relay type search mediation system.

  Here, the difference from FIG. 5 is that the summary record created on behalf is secondarily registered in the registry database of the registration type search mediation system DB 24, and the location of the information held in the real information database under the relay type is stored. In the search inquiry, the DB 24 indirectly takes the form of replying the access path to the relay type search mediation system I01 which is a proxy window of these real information DBs.

  This is because the relay-type mediation system has the same actual search reception / reply section as the group of real-information DBs under its control. This is realized by the system also appearing to be completely equivalent to a normal real information DB. However, this is different from FIG. 5, in the case of external registration, when there is a change in the disclosure policy described later, there arises a problem that the modified registration of the disclosure policy change is required for the past registration.

  In the registration type method, it is necessary to strictly determine whether or not location disclosure is possible. However, in the present invention, the search permission negotiation destination of the actual information after the search that is actually answered and the subsequent real search destination are not access paths to the real actual information DB 31, but a disclosure determination is made. This is the access path itself to the relay type search mediation system I02 itself, which is the agent. Therefore, if any one of the summary records that have been verified as being disclosure targets is determined to be applicable to the disclosure target, it is not possible to disclose the access path to the mediation system I02 as an OR set thereof. No. Even if the location of the brokerage system is disclosed for the minimum reason, the actual search destination does not extend to the non-disclosure actual information DB, and even the fact that the actual location and the actual information are retained Since it can be completely hidden from the searcher, the subsequent contact point can be disclosed under extremely loose conditions.

C ... Searcher (client)
I ... Mediation system R, 31-38 ... Real information database (DB)
11, 12 ... Search client

Claims (12)

A search mediation system that mediates search when searching a plurality of databases with different founders from a user terminal,
In the database information register provided for the search of the user terminal, a request for registration of the information to be searched is received from the real information DB side, and an agency commissioned real information DB group management unit that performs this processing;
Means for generating information to be registered in the register;
A search mediation system comprising:   The search mediation system according to claim 1, further comprising a disclosure policy DB classified by actual information DB used for information granularity filter processing as a mediation-type incidental function. It has a request search formula management unit and a search formula request unit that are the backbone of the relay type search mediation system,
The search mediation system according to claim 1 or 2, further comprising a search expression receiving unit that determines that the mediation system itself is a requester of an answer.   Identify respondents, refer to the disclosure policy DB by actual information DB, obtain an information disclosure policy setting slip, create a summary record for holding registration, inquire about unset disclosure policies, and act as holding registration The search mediation system according to any one of claims 1 to 3, further comprising a summary record creation unit. By amending the location disclosure policy set for existing summary records,
5. The search mediation system according to claim 4, wherein summary records created in the past are rewritten to reflect a new disclosure policy. By revising summary records that are not in time for revision with an unreflected revision policy,
5. The search mediation system according to claim 4, wherein summary records created in the past are rewritten to reflect a new disclosure policy.   7. The information holding registration type compatible function part, which appears to be a registration type relay system completely from a registration type external system, and a real information search corresponding part for judging whether or not an answer is possible. The search mediation system according to any one of the above.   The search mediation system according to any one of claims 1 to 7, further comprising an actual information location response history DB that records a result history of whether or not an answer is possible.   9. A search client account management unit that performs transaction billing through a brokerage service, and a billing management DB that settles expenses required for proxy registration processing and information granularity filter processing. The search mediation system as described in any one. A search mediation system that mediates search when searching a plurality of databases with different founders from a user terminal,
A register for registering a summary of information held in the real information database to be brokered;
A proxy registration function unit that searches the real information database, acquires information held by the real information database, and registers the summary in the registry;
A registration type search corresponding unit that makes a location response with reference to the registration book in response to a registration type search request;
An account management unit that issues a permission (rejection) notification based on a determination as to whether or not the disclosure identity of the requester matches the searcher account requirement policy for an actual search permission request of the registration type method;
An actual search expression reception reply unit that accepts an actual search request of a registration type method and answers a search result of the real information database;
A relay processing unit that searches the real information database in response to a relay request of the real search expression reception answer unit and obtains a search result;
A search mediation system comprising: A search mediation system that mediates search when searching a plurality of databases with different founders from a user terminal,
An agency registration function unit that searches the real information database that is the mediation target, acquires information held by the real information database, and registers the summary in the registry of the higher-level registration-type search intermediary device;
An account management unit that issues a permission (rejection) notification based on a determination as to whether or not the disclosure identity of the requester matches the searcher account requirement policy for an actual search permission request of the registration type method;
An actual search expression reception reply unit that accepts an actual search request of a registration type method and answers a search result of the real information database;
A relay processing unit that searches the real information database in response to a relay request of the real search expression reception answer unit and obtains a search result;
A search mediation system comprising:   A software program that causes a computer to function as the search mediation system according to any one of claims 1 to 11.

Images