JP4291634B2 - Network service search device and network service search method - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention makes it possible to divide and transmit search conditions within the limit range of data length, and to combine search results indicated by responses to the divided search conditions, thereby limiting the data length. The present invention provides a network service search method that realizes a detailed network service search independent of the range.
[0002]
[Prior art]
In recent years, in response to a user instruction, a client terminal used by a user causes a print request to be made to one of a plurality of network service devices that provide a network service (for example, a print service) existing on the network. The client terminal searches the currently available network service device from the network, and displays the currently available network service list on the screen as the search result, thereby enabling the user to select one of the network services. . That is, the network service device that realizes the network service selected by the user is specified.
[0003]
For example, a client terminal transmits a UDP (User Datagram Protocol) packet by multicast on a network as a search condition for searching for a network service desired by a user, thereby connecting a plurality of networks connected to the network that has received the packet. The service device responds to the client terminal when the search condition can be satisfied. Therefore, the client terminal satisfies a search condition desired by the user, displays a list of network services provided by the currently available network service device on the screen, and the user selects one network service from the list. Can do.
[0004]
[Problems to be solved by the invention]
However, in the conventional network service system as described above, although the data size of the UDP packet is intended to transmit a small amount of data, which differs depending on the specifications of the network communication, the data length indicating the search condition is limited. . For this reason, it has not been possible to search for network services on the network using detailed search conditions that do not depend on the data length limitation. That is, there is a problem that an extremely large number of network services are searched or a network service cannot be searched at all.
[0005]
Accordingly, the problem of the present invention is that it is possible to divide and transmit search conditions within a limited range of data length, and to combine search results indicated by responses to the divided search conditions, It is an object of the present invention to provide a network service search method that realizes a detailed network service search that does not depend on the data length limit range.
[0006]
[Means for Solving the Problems]
In order to solve the above problems, the present invention The A plurality of second search conditions are created by dividing the first search condition for searching for a desired service provided through the network so as not to be longer than a predetermined data length, Generate a search condition structure tree indicating the relationship between the plurality of second search conditions, and the search condition structure tree stores whether or not the same search condition as the second search condition exists in another search condition structure tree If the same search condition is found, the search condition structure tree identifier is registered, and the same search condition is not found. the above Send the second search condition to the network service device connected to the network service search device, For each second search condition From the above network service device The search result according to the received second search condition is accumulated in the storage area, and the first search condition is restored from the plurality of second search conditions, and in accordance with a logical operation specified by the first search condition. The search result corresponding to the second search condition to be calculated is acquired from the storage area, and the search result corresponding to the first search condition is acquired by combining the acquired search results. Composed.
[0007]
In such a network service search method, when the first search condition is larger than the predetermined data length, it is divided and transmitted as the second search condition, so that the entire first search condition can be transmitted. In addition, since the search results corresponding to the divided search conditions can be synthesized as if the divided search conditions were restored according to the structure tree of the first search condition, services that satisfy the initial search condition are identified. can do. Further, it is possible to realize a detailed search that does not depend on a predetermined data length.
[0008]
The present invention also provides ,Up The division is First search condition above A structure tree having the first search condition as a node and the logical operator as a node so as to divide the first search condition when the first search condition is larger than a predetermined data length, and the structure tree information indicating the data structure of the structure tree Are stored in the storage area, and the restoration is performed based on the structural tree information stored in the storage area.
[0009]
In such a network service search method, a structure tree is created using a logical operator as a node. However, since the division is performed when the divided end portion is larger than a predetermined data length, the division is performed so as not to shorten more than necessary. Can not be. Accordingly, since search conditions are not transmitted to the network more than necessary, search efficiency can be improved.
[0010]
Furthermore, the present invention On The division can be configured to recursively perform the division using the current route as a node when the second search condition after division is larger than the predetermined data length.
[0011]
In such a network service search method, a structure tree corresponding to a predetermined data length is created, so that the structure tree is not hierarchized more than necessary.
[0012]
In addition, the present invention On The division can be configured to create a structure tree having the first search condition as a logical product and a logical sum as nodes.
[0013]
Furthermore, the present invention On The predetermined data length can be configured to be the data length of the UDP data bucket.
[0014]
In such a network service search method, a structure tree corresponding to the data length of the UDP data bucket is created, and a second search condition corresponding to the data length of the UDP data bucket is obtained. Therefore, the first search condition is the UDP data bucket. Even if the data length is longer than the above, a detailed search equivalent to the first search condition can be performed.
[0015]
The present invention also provides ,Up The terminal part of the structure tree can be transmitted to the network as the second search condition to be transmitted.
[0016]
In such a network service search method, nodes are not transmitted unnecessarily, that is, unnecessary logical operators are not transmitted, so that the efficiency of data transfer can be improved.
[0017]
Furthermore, the present invention provides ,Up One of the plurality of second search conditions divided by using the logical sum indicated by the first search condition as a node is transmitted to the network, and is specified by the search result according to the second search condition. The function profile indicating the function that can be provided by the service is acquired from the address, and the second search condition that is divided but not transmitted by using the logical sum as a node and the function indicated by the function profile are obtained. By collating, it can comprise so that the search result according to said 1st search condition may be acquired. In addition, the present invention On It is determined whether or not the search results according to the second search condition are equal to or greater than a predetermined number, and based on the determination results, the logical sum is used as a node but is not transmitted but is not transmitted. The second search condition can be configured to collate the function indicated by the function profile.
[0018]
In such a network service search method, when the first search condition is divided into a plurality of second search conditions by logical sum (AND), only one second search condition is transmitted. Can be made more efficient. Moreover, since the function profile acquired based on the search result according to the second search condition and the other second search condition that has not been transmitted are collated, the number of function profiles to be collated can be suppressed, The matching process can be performed efficiently.
[0019]
Furthermore, the present invention provides ,Up In correspondence with the identification information for identifying the structure tree in the storage area, a storage location of the created structure tree information and a list of contents of the second search condition within the predetermined data length The storage location of the second search condition list shown, the storage location of the search result list showing the search result list for each of the second search conditions, and the storage location of the node information showing the partial search conditions below each node The table can be configured to manage the first search condition.
[0020]
In addition, the present invention On The second search condition is transmitted to the network as a search request according to a predetermined message exchange protocol, and the search result is transmitted to the network as a search response according to the predetermined message exchange protocol only when the second search condition is satisfied. Can be configured. Or the present invention On The second search condition is transmitted to the network as a search request according to a predetermined Internet communication protocol, and the search result is transmitted to the network as a search response according to the Internet communication protocol only when the second search condition is satisfied. can do.
[0021]
Furthermore, the present invention provides ,Up One or more service providing devices that can provide a service via the network, and a plurality of service providing devices that provide a service existing on the network based on the first search condition specified by the application In a system including one or more client terminals that search for a service providing device that satisfies a first search condition, the service providing device creates the plurality of second search conditions, and the service providing device The search result received from the client terminal according to the search condition is stored in a storage area, and the search result according to the first search condition is acquired by combining the search result acquired by the service providing device. Can be configured.
[0022]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, embodiments of the present invention will be described with reference to the drawings.
[0023]
A network service search method according to an embodiment of the present invention is used to transmit a small amount of data constituting a network. For example, a search condition divided by multicast using a UDP (User Datagram Protocol) packet is transmitted. The hardware configuration of a plurality of network service devices and a plurality of client terminals that transmit search results for the divided search conditions will be described with reference to FIGS.
[0024]
FIG. 1 is a diagram showing a hardware configuration of a network service device according to an embodiment of the present invention. In FIG. 1, a network service device 100 is a device that is controlled by a computer and executes print processing, and includes a CPU (Central Processing Unit) 11, a ROM (Read-Only Memory) 12, and a RAM (Random Access Memory) 13. A non-volatile random access memory (RAM) 14, a real-time clock 15, an Ethernet (registered trademark) I / F (Ethernet (registered trademark) Interface) 21, a USB (Universal Serial Bus) 22, and an IEEE ( The Institute of Electrical and Electronics Engineers) 1284 23, a hard disk I / F 24, a video I / F 25, and an RS-232C I / F 26 are connected to the system bus B.
[0025]
The CPU 11 controls the network service device 100 according to a program stored in the ROM 12. For example, an area is allocated to the RAM 13 for resources connected to the interfaces 21 to 26. The nonvolatile RAM 14 stores information necessary for processing by the CPU 11 until the network service device 100 is powered off. The real-time clock 15 measures the current time and is used by the CPU 11 to synchronize processing.
[0026]
An Ethernet (registered trademark) interface cable such as 10BASE-T or 100BASE-TX is connected to the Ethernet (registered trademark) I / F 21. A USB interface cable is connected to the USB 22. An IEEE1284 interface cable is connected to the IEEE1284 23.
[0027]
A hard disk 34 is connected to the hard disk I / F 24, and document data of a document to be serviced (for example, document data to be printed) or image data after printing processing is transmitted to the hard disk I via the network. Stored in the hard disk 34 via / F24. A printer engine 35 is connected to the video I / F 25, and image data is transmitted to the printer engine 25 via the video I / F 25, and an image is formed on a printable medium such as paper based on the image data. . An operation panel 36 is connected to the RS-232C I / F 26 to display information to the user and acquire input information or setting information from the user.
[0028]
FIG. 2 is a block diagram showing a hardware configuration of the client terminal according to the embodiment of the present invention. In FIG. 2, a client terminal 300 is a device that is controlled by a computer and executes print processing. The client terminal 300 is a CPU (central processing unit) 51, a memory unit 52, a display unit 53, an input unit 54, and a communication unit 55. And a storage device 56 and a driver 57, which are connected to the system bus B3.
[0029]
The CPU 51 controls the client terminal 300 according to a program stored in the memory unit 52. The memory unit 52 includes a RAM and a ROM, and stores programs executed by the CPU 51, data necessary for processing by the CPU 51, data obtained by processing by the CPU 51, and the like. Further, a partial area of the memory unit 52 is allocated as a work area used for processing by the CPU 51.
[0030]
The display unit 53 displays various information required under the control of the CPU 51. The input unit 54 includes a mouse, a keyboard, and the like, and is used by a user to input various information necessary for the client terminal 300 to perform processing. The communication unit 55 is an apparatus for controlling communication with a plurality of network service devices 100 when the client terminal 300 is connected to the plurality of network service devices 100 via, for example, a LAN (Local Area Network). It is. The storage device 56 is composed of, for example, a hard disk unit, and stores programs for executing various processes, document data, and the like.
[0031]
A program for realizing the search processing performed by the client terminal 300 is provided to the client terminal 300 by a storage medium 58 such as a CD-ROM, for example. That is, when the storage medium 58 storing the program is set in the driver 57, the driver 57 reads the program from the storage medium 58, and the read program is installed in the storage device 56 via the system bus B3. . When the program is activated, the CPU 51 starts its processing according to the program installed in the storage device 56. The medium for storing the program is not limited to a CD-ROM, and any medium that can be read by a computer may be used. The program for realizing the printing process according to the present invention may be downloaded via the network 40 by the communication unit 55 and installed in the storage device 56.
[0032]
A functional configuration of a network service search system for realizing a search process in the network service search method according to an embodiment of the present invention will be described with reference to FIG. FIG. 3 is a diagram illustrating a functional configuration example of the network service search system. In FIG. 3, for convenience of explanation, the network service search system 100 will be described with a minimum configuration, and the following description will be made with a configuration in which the network service device 100 and the client terminal 300 are connected via the network 20.
[0033]
The network service device 100 that provides print processing as a network service mainly includes a print service processing unit 110 that executes print processing in response to a print request and a BMLinkS processing unit 120.
[0034]
The print service processing unit 110 controls the printer engine 35 in FIG. 1 according to the print conditions specified by the print request received from the client terminal via the network 20, and forms an image on a predetermined medium based on the document data. Output. In the present embodiment, the print service processing unit 110 that provides the print service to perform the print process is illustrated, but the present invention is not limited to the print process. For example, a service processing unit that provides processing such as FAX and copying as a network service may be used.
[0035]
The BMLinkS processing unit 120 is an inter-device interface protocol that realizes common communication control among office equipment devices such as a printer, a FAX, and a copier, and analyzes a search condition transmitted from the client terminal 300, and the search condition When the device satisfies the condition, a process of transmitting a search response indicating the search result to the client terminal 300 is performed.
[0036]
The BMLinkS processing unit 120 further includes an HTTP server 121, a search request monitoring unit 122, a search request determination unit 123, and a function profile 200.
[0037]
The HTTP server 121 transmits a response indicating the function profile 200 in response to the function profile acquisition request from the client terminal 300. When a print request is received from the client terminal 300, the print service processing unit 110 is notified and a response indicating the result of the print process is transmitted to the client terminal 300.
[0038]
The search request monitoring unit 122 monitors a search request transmitted from the client terminal 300 via the network 20. When receiving the search request, the search request monitoring unit 122 notifies the search request determination unit 123.
[0039]
The search request determination unit 123 refers to the function profile 200 indicating the functions of services that can be provided, and determines whether it is possible to provide a function that satisfies the search conditions specified by the search request. A search response indicating the search result is provided to the client terminal 300 only in the case. The search result indicates information that can specify a network service device and information that specifies a search condition.
[0040]
The function profile 200 is data describing functions indicating functions that can be provided by the network service device 100 in the XML (eXtensible Markup Language) format, and is stored in the hard disk 34 shown in FIG. Referenced by the search request determination unit 123.
[0041]
The client terminal 300 mainly includes an application 301 and a search processing unit 310.
[0042]
The application 301 displays a GUI (Graphical User Interface) on the display unit 53 in response to a request from the user or another program, and generates a search condition. The application 301 notifies the search request analysis unit 311 of the generated search condition, and provides a GUI that allows the user to select one of the network services based on the search result received from the search result synthesis unit 315 based on the search condition. .
[0043]
The search processing unit 310 is a processing unit that receives a search condition as an initial search condition from the application 301, divides the initial search condition, and notifies the application 301 of a search result obtained by multicasting with a UDP packet. A search request analysis unit 311, a search condition structure tree storage area 312, a search execution control unit 313, a search request transmission unit 314, a search result synthesis unit 315, and a profile search unit 320.
[0044]
The search request analysis unit 311 divides the initial search condition passed from the application 301 and generates a search condition structure tree indicating the relationship between the divided individual search conditions. At this time, the initial search conditions are recursively divided until the individual search conditions after the division are equal to or smaller than the specified size. The search conditions indicated by the generated search condition structure tree are referred to as individual search conditions. The search request analysis unit 311 stores the search condition structure tree in the search condition structure tree storage area 312.
[0045]
The search condition structure tree storage area 312 is a storage area for storing and managing the search condition structure tree, and exists in the storage device 56. The search condition structure tree storage area 312 stores the search condition structure tree generated by the search request analysis unit 311. The search condition structure tree is generated by the search request analysis unit 311 for each initial search condition. The search condition structure tree storage area 312 stores search results received from the network service device 100.
[0046]
The search execution control unit 313 transmits the individual search condition corresponding to the leaf portion in the search condition structure tree on the network 20 by the search request transmission / reception unit 314. At this time, transmission processing is performed according to one of the following operation modes. There are an operation mode for transmitting all the individual search conditions obtained by dividing the initial search condition, and an operation mode for transmitting a part of the plurality of individual search conditions obtained by dividing the initial search condition. .
[0047]
In the operation mode in which a part of a plurality of individual search conditions is transmitted, for example, the search request analyzing unit 311 divides the initial search condition by only the AND operator, and the created individual search conditions are sequentially searched from the top. To 314. The search results are updated in the search condition structure tree storage area 312 and are combined with the search results based on the individual search conditions so far, and when the number of services in the search results falls below a certain number, a list of target services Then, the remaining list of individual search conditions is transmitted to the profile search unit 320.
[0048]
The search request transmission / reception unit 314 transmits the individual search conditions notified from the search execution control unit 313 by multicast using UDP packets according to BMLinkS.
[0049]
The profile search unit 320 receives the target service list and the individual search condition list from the search execution control unit 313, acquires the function profile 200 from each network service device 100, and acquires the acquired function profile 200, individual search condition list, and the like. Perform a search by matching Based on the target service, the function profile 200 is acquired from the network service device 100, and a list of services satisfying all of the individual search conditions is configured for each function profile. The search result is stored in the search condition structure tree storage area 312.
[0050]
As described above, by narrowing down the target service by the profile search unit 320 and then making a request for acquiring the function profile 200 to the corresponding network service device 100, a search result without waste can be acquired. . In order to realize such processing, the profile search unit 320 includes a function profile acquisition unit 321 and a search condition matching unit 322.
[0051]
The function profile acquisition unit 321 makes an acquisition request for the function profile 200 to the target network service device 100 based on the service list, and receives the function profile 200 from the network service device 100 in response to the acquisition request. Then, the function profile 200 is notified to the search condition matching unit 322.
[0052]
The search condition collation unit 322 collates the content of the function profile 200 received from the network service device 100 by the function profile acquisition unit 321 with the individual search condition list, and the collation result is the search condition structure tree storage area 312 as a search result. To accumulate.
[0053]
Further, the profile search unit 320 includes a function profile acquisition unit 321 and a search condition matching unit 322. In the search processing unit 310, the search request transmission unit 314 and the function profile acquisition unit 321 constitute a BMLinkS processing unit 330 that executes a predetermined search process (discovery function) defined by BMLinkS.
[0054]
FIG. 4 is a diagram illustrating a configuration example of a communication protocol. 4, in order from the lowest layer, IP (Internet Protocol) 131, UDP (User Datagram Protocol) 132 in the first layer, TCP (Transmission Control Protocol) 133 in the second layer, and HTTP (Hypertext in the third layer) Transfer Protocol (134), XML (eXtensible Markup Language) 135 in the fourth layer, and SOAP (Simple Object Access Protocol) 136 in the fifth layer.
[0055]
In such a communication protocol configuration, the divided search conditions are transmitted by the UDP 132 as a UDP packet.
[0056]
In the network service search system 1000 according to the present invention, communication may be performed using the HTTP 134, and the SOAP 136 and the XML 135 can be omitted.
[0057]
An initial search condition designated from the application 301 will be described with reference to FIG. FIG. 5 is a diagram illustrating an example of the initial search condition. In FIG. 5, an initial search condition 40 indicates a search condition desired by a user by hierarchically combining AND, OR, and NODE test expressions.
[0058]
The AND test is described as AND (test expression 1, test expression 2), and indicates that both the search condition indicated by test expression 1 and the search condition indicated by test expression 2 are satisfied.
[0059]
The OR test is described as OR (test expression 1, test expression 2), and indicates that either one of the search condition indicated by test expression 1 and the search condition indicated by test expression 2 should be satisfied. .
[0060]
The NODE test is described as NODE (root, value), and the route specifies the tag of the function profile described in XML, and the value corresponding to the tag is specified by the value. Therefore, the route (tag) Indicates that is the specified value. The route is described as tag = “tag name”, and the value is described as val = “value”. The NODE test is the smallest leaf that cannot be divided in the search condition structure tree.
[0061]
In the initial search condition 40, it is specified that the test expression 41 indicated by AND satisfies both the test expression 42 indicated by OR and the test expression 45 indicated by AND. The test formula 42 is further represented by a test formula 43 indicated by NODE and a test formula 44 indicated by NODE.
[0062]
That is, in the test expression 43, the tag name “finishings” designates the value “staple-left-upper”, and the search condition is that “finishing can be stapled to the upper left”. Further, in the test formula 44, the tag name “finishings” specifies the value “punch”, and the search condition is “drilling in finishing”. Therefore, according to the test formula 42, it is specified as a search condition that “stapling at the upper left in finishing” or “drilling in finishing” can be performed.
[0063]
Similarly, in the test formula 46 indicated by OR, the tag name “location” specifies the value “tokyo-office, sales-division” by the test formula 47 indicated by NODE, and by the test formula 48 indicated by NODE, Since the tag name “location” specifies the value “ohsaka-office, marketing-division”, the network service device 100 that provides the service is the “Tokyo Office Sales Department” or “Osaka Office Marketing”. It is specified as a search condition that it is installed in “department”.
[0064]
Further, in the test expression 49 indicated by OR, the tag name “media” designates the value “A4” by the test expression 49-1 indicated by NODE, and the tag name “2” is specified by the test expression 49-2 indicated by NODE. Since “media” designates the value “letter”, it is designated as a search condition that “medium is A4” or “medium is letter” size.
[0065]
Accordingly, in the test formula 45 indicated by AND, “the network service device 100 providing the service is installed in the“ sales department of the Tokyo office ”or“ the marketing department of the Osaka office ”, and , ““ Medium is A4 ”or“ medium is letter ”size” is designated as a search condition.
[0066]
After all, the test expression 41 indicated by AND is, as the initial search condition 40, “It can be stapled at the upper left in finishing” or “Punching in finishing” ”and“ Network service device providing service ” 100 is “installed in the sales department of the Tokyo office” or “the marketing department of the Osaka office” and “the medium is A4” or “the medium is a letter” size ”. Is specified.
[0067]
Next, an example of the function profile 200 referred to for determining whether or not the search condition is satisfied will be described with reference to FIG. FIG. 6 is a diagram illustrating an example of a function profile of a network service device. In FIG. 6, the device profile 200 mainly includes a description 201 indicating a device profile for specifying the network service device 100 and a description 202 indicating a function profile that can be provided as a service. Description 201 is <device-profile> indicates that it is a description indicating a device profile. <functional-profile> indicates that the description indicates a functional profile.
[0068]
In description 201, From <device-info> Various pieces of device information for specifying the network service device 100 are indicated by the description up to </ device-info>. <modelName> Color Laser 1111 </ modelName> indicates that the printer model name is “Color Laser 1111” <deviceID> 456789 </ deviceID> indicates that the device ID is “456789” <vendorName> RRR </ vendorName> indicates that the sales company name is "RRR"<location> XXX-YY-ZZ, Ohta-ku, Tokyo, Japan </ location>.
[0069]
The description 202 mainly indicates a description 207 indicating the presence or absence of a color function, a description 210 indicating a list of media sizes that can be provided, and a description 220 indicating a list of finishes that can be provided.
[0070]
Description 207 is <color> true </ color> indicates that there is a color function.
[0071]
From <media-size> Description 210 up to </ media-size> From <supportedValue></supportedValue> description 211 showing a list of media sizes that can be provided, From <defaultValue> A description up to </ defaultValue> indicates a description 215 indicating the medium size as an implicit value. The description 211 describes each medium size. From <value> In this example, “A4”, “B5”, and “A3” can be provided as media sizes. Similarly, the description 215 From <value></value> indicates the medium size as an implicit value, which is “A4”.
[0072]
From <finishings> The description 220 up to </ finishings> is similar to the description 210, From <supportedValue></supportedValue> description 221 showing a list of finishing that can be provided, From <defaultValue></defaultValue> describes a description 225 indicating finishing as an implicit value. Description 221 describes each finishing From <value></value> indicates that “staple”, “punch”, and “none” can be provided in this example. Similarly, the description 225 From <value></value> indicates finishing as an implicit value, and indicates “none (no finishing)”.
[0073]
This function profile 40 can be used to determine whether or not the search condition “stapling at the upper left in finishing” is satisfied as shown by the test expression 43 of the initial search condition 40 as shown in FIG. Each of the descriptions 220 showing the correct finishing If there is a matching finish that matches each finishing method specified by <value>, it is determined that the search condition is satisfied, and if there is no matching finishing, it is determined that the search condition cannot be satisfied. The
[0074]
In this case, from the description of “tag =“ finishings ”” in the test formula 43, Specify <finishings> and from “val =” staple-left-upper ” Judge whether "staple" exists in the value specified by <value>. Since “staple” is possible by the description 222, it is determined that there is a matching finishing, and therefore, it is determined that the search condition according to the test formula 43 is satisfied.
[0075]
Next, the structure of the search condition structure tree when the initial search condition is divided by a predetermined byte that enables transmission of the search condition will be described with reference to FIG. FIG. 7 is a diagram illustrating an example of a search condition structure tree when divided by predetermined bytes. The reference numerals shown in FIG. 7 are shown in correspondence with the reference numerals shown in FIG.
[0076]
In FIG. 7, AND, OR, and NODE indicated by the test expressions 41 to 49 are nodes of the search condition structure tree. A node indicated by one or more NODE tests among these nodes is called a leaf. In order to divide the initial search condition tree by a predetermined byte, a leaf is indicated by only one NODE test as in test expressions 43, 44, 47, and 48, and two or more NODE tests as in test expression 49. May be indicated. Test formulas 43, 44, 47, 48, and 49 are transmitted from the client terminal 300 to the network service device 100 as individual search conditions.
[0077]
Next, a search condition structure tree management method in the search condition structure tree storage area 312 will be described with reference to FIGS.
[0078]
FIG. 8 is a diagram illustrating a data configuration example of the search condition structure tree storage area. In FIG. 8, in the table 400, a pointer to the storage location of the structure tree information representing the search condition structure tree and the search conditions (that is, leaves) divided within a predetermined byte range are listed as individual search conditions. A pointer to the storage location of the search condition list, a pointer to the storage location of the search result list indicating a list of search results received from the network service device 100, and the storage location of the node additional information that manages the node identification information A pointer is managed for each tree identifier that specifies the initial search condition.
[0079]
For example, in the case of the tree identifier 13, the table 400 indicates pointers to the structural tree information 410, the individual search condition list 430, the search result list 450, and the node addition information 470 of the tree identifier 13.
[0080]
The structural tree information 410 of the tree identifier 13 is managed by a data structure as shown in FIG. 9, for example. FIG. 9 is a diagram illustrating a data structure example of structural tree information. In FIG. 9, structural tree information 410 includes a node ID for identifying a node, a binary operator indicating AND or OR, and a node indicating test expression 1 when the node is a binary operation by AND or OR. The relationship between the own node (parent node) and the descendant node is indicated by the record having the ID and the node ID indicating the test expression 2.
[0081]
Further, when the node is a leaf, the node ID for identifying the node, the LEAF indicating the leaf, the individual search condition ID for specifying the leaf, and the end of the search condition structure tree are indicated. An individual search condition transmitted to the client terminal 300 is specified by a record having empty data.
[0082]
In the data structure example of FIG. 9, for example, the node identified by the node identifier “344” is a test node that performs an AND operation on the test expression 1 and the test expression 2. The test expression 1 of the node identifier “344” is indicated by the node identifier “345”, and the test expression 2 is indicated by the node identifier “348”.
[0083]
The node identified by the node identifier “346” is indicated by LEAF to be a leaf. The search condition transmitted by the individual search condition ID “1001” is specified.
[0084]
Each node is associated with the data structure of the record as described above, and a search condition structure tree as shown in FIG. 7 is expressed.
[0085]
FIG. 10 is a diagram illustrating a data structure example of the individual search condition list. In FIG. 10, the individual search condition list 430 of the tree identifier 13 shows a search condition ID for identifying the search condition for each search condition, and node information indicating a description of the search condition in association with the search condition ID.
[0086]
For example, the test formula 43 shown in FIG. 7 is stored as node information in association with the search condition ID “1001”, and the test formula 44 shown in FIG. 7 is stored as node information in correspondence with the search condition ID “1002”. 7 is stored as node information in association with the search condition ID “1003”, and the test expression 48 in FIG. 7 is stored as node information in association with the search condition ID “1004”. Then, the test formula 49 shown in FIG. 7 is stored as node information in association with the search condition ID “1005”.
[0087]
FIG. 11 is a diagram illustrating a data structure example of the node addition information. In FIG. 11, node addition information 450 of the tree identifier 13 indicates a node identifier other than a leaf and a partial search condition corresponding to the node identifier.
[0088]
For example, the partial search condition corresponding to the node identifier “344” is the test expression 41 indicated by AND of the initial search condition 40 illustrated in FIG. 5, that is, the initial search condition 40 as a whole corresponds.
[0089]
FIG. 12 is a diagram illustrating a data structure example of the search result list. In FIG. 12, the search result list 470 stores the search results received from the network service device 100 by connecting them with pointers for each search condition ID. Then, while reproducing the initial search condition 40, the search results are combined to obtain an overall result. In the overall result, the search results obtained while reproducing the initial search condition 40 are connected and stored by a pointer.
[0090]
Next, a search request when a search request for a search condition transmitted from the client terminal 300 to the network 20 is made according to SOAP will be described with reference to FIGS.
[0091]
FIG. 13 is a diagram illustrating an example of a search request by SOAP when the search condition ID is 1001. In FIG. 13, the search request 500 for the search condition ID “1001” is composed of a description 501 related to the requested HTTP and a description 510 related to SOAP indicating the request content.
[0092]
In the description 501 regarding HTTP, since the HTTP command 502 is “SEARCH”, it indicates that this HTTP is a search request. The description 506 indicates that the structure tree ID of the search condition structure tree is “13”, and the description 507 indicates that the search condition ID for identifying the individual search condition is “1001”.
[0093]
In the description 510 about SOAP, according to the description 514 <m: search xmlns: m = "http://deviceSearch.rrr.co.jp/search"> indicates that the search method is specified, From <condition> A search condition corresponding to the search condition ID “1001” is specified by the description 515 up to </ condition>.
[0094]
For example, The description 517 indicated by <NODE> indicates that it is one search condition not involving binary operation, <name> finishings </ name> description 518 and <value> staple-left-uppper </ value>, a tag 519 according to the description 519 The function profile 40 is used to verify whether there is a description that supports “staples in the upper left” in correspondence with <finishings>.
[0095]
FIG. 14 is a diagram illustrating an example of a search request by SOAP when the search condition ID is 1005. In FIG. 14, the search request 520 for the search condition ID “1005” is composed of a description 521 related to the requested HTTP and a description 530 related to SOAP indicating the request content, as in the search request 500 shown in FIG.
[0096]
The HTTP description 521 is the same as the HTTP description 501 shown in FIG. 13, but the description 527 indicates that the search condition ID for identifying the individual search condition is “1005”.
[0097]
In the description 530 about SOAP, From <condition> A search condition corresponding to the search condition ID “1005” is specified by the description 535 up to </ condition>.
[0098]
For example, According to the description 536 indicated by <OR>, It is specified that one of the two search conditions indicated by <NODE> is satisfied. A description 537 and a description 538 indicated by <NODE> indicate that each is one search condition not involving a binary operation. In description 537, <name> media </ name> description 5371 and <value> A4 </ value> describes the tag 5372 It is verified using the function profile 40 whether or not there is a description that supports an “A4” size medium (for example, paper) in association with <media>. In the description 538, <name> media </ name> description 5381 and <value> letter </ value> describes the tag 5382 It is verified using the function profile 40 whether there is a description that supports a “letter” size medium (for example, paper) in correspondence with <media>.
[0099]
FIG. 15 is a diagram illustrating an example of a search response by SOAP when the search condition ID is 1001. In FIG. 15, the search response 600 for the search condition ID “1001” is composed of a description 601 related to HTTP that responds and a description 610 related to SOAP indicating the response content.
[0100]
In the description 601 related to HTTP, the description 606 indicates that the structure tree ID of the search condition structure tree is “13”, and the description 607 indicates that the search condition ID for identifying the individual search condition is “1001”. ing.
[0101]
The description 608 indicated by “Location: http://192.168.1.45/printService” is the network service device 100 as a device that satisfies the search condition identified by the search condition ID “1001” of the structural tree ID “13”. Specifies the URL “http://192.168.1.45/printService” that identifies the print service provided by.
[0102]
Further, a description 609 indicated by “DeviceProfileUrl: http // 192.168.1.45 / printService / profile” specifies a URL “http // 192.168.1.45 / printService / profile” that specifies the function profile of the network service device 100. Yes. With this description 609, the client terminal 300 can acquire the function profile 40 from the network service device 100 as necessary.
[0103]
In the description 610 about SOAP, From <m: searchResponse> Information of the network service device 100 is indicated by a description 615 shown up to </ m: searchResponse>. For example, <deviceId> bc589 The description 616 indicated by </ deviceId> indicates that the ID of the network service device 100 is “bc589”.
[0104]
In the client terminal 300, the information obtained from the descriptions 608, 609, and 616 is linked by a pointer corresponding to the search condition ID “1001” in the search result list 470, as shown in FIG.
[0105]
Next, a case where a search request and a search result by SOAP described in FIGS. 13 to 15 are performed by HTTP will be described with reference to FIGS.
[0106]
FIG. 16 is a diagram illustrating an example of an HTTP search request when the search condition ID is 1001. In FIG. 16, the search request 700 for the search condition ID “1001” is composed of a description 701 relating to the requested HTTP and a description 709 relating to the request contents.
[0107]
In the description 701 related to HTTP, since the HTTP command 702 is “SEARCH”, this indicates that this HTTP is a search request. The description 706 indicates that the structure tree ID of the search condition structure tree is “13”, and the description 707 indicates that the search condition ID for identifying the individual search condition is “1001”.
[0108]
In the description 709 concerning the request contents, it is described as “NODE (tag =“ finishings ”, val =“ staple-left-uppper ”)”, and it is one search condition that does not involve binary operation by “NODE”. Is displayed, and "tag =" finishings "" and "val =" staple-left-uppper "" The function profile 40 is used to verify whether there is a description that supports “staples in the upper left” in correspondence with <finishings>.
[0109]
FIG. 17 is a diagram illustrating an example of an HTTP search request when the search condition ID is 1005. In FIG. 17, the search request 710 for the search condition ID “1005” is composed of a description 711 related to the requested HTTP and a description 719 related to the request content, as in the search request 700 shown in FIG.
[0110]
The description 711 related to HTTP is the same as the description 701 related to HTTP shown in FIG. 16, but the description 717 indicates that the search condition ID for identifying the individual search condition is “1005”.
[0111]
In the description 719 regarding the request contents, “OR (NODE (tag =“ media ”, val =“ A4 ”), NODE (tag =“ media ”, val =“ letter ”))” ”is described, and“ OR ” The following two “NODE” indicate that each is one search condition not involving a binary operation. Tag by the description of “NODE (tag =“ media ”, val =“ A4 ”)” It is verified using the function profile 40 whether or not there is a description that supports an “A4” size medium (for example, paper) in association with <media>. Also, the tag “NODE (tag =“ media ”, val =“ letter ”)” It is verified using the function profile 40 whether there is a description that supports a “letter” size medium (for example, paper) in correspondence with <media>.
[0112]
FIG. 18 is a diagram illustrating an example of an HTTP search response when the search condition ID is 1001. In FIG. 18, the search response 800 for the search condition ID “1001” is composed of a description 801 related to the HTTP that responds.
[0113]
In the description 801 related to HTTP, the description 806 indicates that the structure tree ID of the search condition structure tree is “13”, and the description 807 indicates that the search condition ID for identifying the individual search condition is “1001”. ing.
[0114]
The description 808 indicated by “Location: http://192.168.1.45/printService” is the network service device 100 as a device that satisfies the search condition identified by the search condition ID “1001” of the structural tree ID “13”. Specifies the URL “http://192.168.1.45/printService” that identifies the print service provided by.
[0115]
Furthermore, a description 809 indicated by “DeviceProfileUrl: http // 192.168.1.45 / printService / profile” specifies a URL “http // 192.168.1.45 / printService / profile” that identifies the function profile of the network service device 100. Yes. With this description 809, the client terminal 300 can acquire the function profile 40 from the network service device 100 as necessary.
[0116]
The description 816 indicated by “DeviceId: bc589” indicates that the ID of the network service device 100 is “bc589”.
[0117]
In the client terminal 300, the information obtained from the descriptions 808, 809, and 616 is linked by a pointer corresponding to the search condition ID “1001” in the search result list 470, as shown in FIG.
[0118]
Next, an outline of a combining process for combining the search results accumulated in the search result list 470 with an operator based on the initial search condition 40 will be described with reference to FIG. FIG. 19 is a diagram illustrating an example of a join process using an operator.
[0119]
FIG. 19A shows an example of a join process when the operator is AND, and is common to the search results accumulated for the right search condition and the search results accumulated for the left search condition. This indicates that the existing search result is a search result by the combination process. In this example, the combination processing by the product set is performed, and the device ID and the IP address are “bc589” and “192.168.1.45”, “ggf45” and “192.168.1.52”. It becomes a search result.
[0120]
FIG. 19B shows an example of join processing when the operator is OR, and at least one of the search results accumulated for the right search condition and the search results accumulated for the left search condition. It is shown that the search result existing in is a search result by the combination processing. In this example, the union combination process is performed, and the device ID and the IP address are “er564g” and “192.168.1.21”, “a1234” and “192.168.1.21”, “Bc589” and “192.168.1.45” and “ggf45” and “192.168.1.52” are the search results.
[0121]
Next, search condition division and transmission processing executed by the search processing unit 310 of the client terminal 300 will be described with reference to FIG. FIG. 20 is a flowchart for explaining search condition division and transmission processing.
[0122]
In FIG. 20, the search processing unit 310 initializes the search result list 450 when the client terminal 300 is activated, for example (step S11). When the search request analysis unit 311 acquires a search request from the application 301 (step S12), the search request analysis unit 311 executes a search condition division and a structure tree generation process specified by the search request (step S13).
[0123]
The search execution control unit 313 creates a leaf list for transmission based on the individual search condition list 430 created by the search condition division and the structure tree generation process (step S14). The search execution control unit 313 sequentially selects leaves (that is, search conditions divided within a predetermined byte range) from the created leaf list (step S15), and generates a search request for the leaves (step S16). The search execution control unit 313 instructs the search request transmission / reception unit 314 to transmit a search request, and the search request transmission / reception unit 314 transmits the UDP request to the network 20 by multicast according to the instruction.
[0124]
When the search processing unit 310 receives a search response to the transmitted search request, the search processing unit 310 performs reception and synthesis processing of the search result indicated by the search response (step S18). The search execution control unit 313 determines whether all the leaves have been transmitted (step S19). When all the leaves have been transmitted, the search condition division and transmission processing ends.
[0125]
On the other hand, if all the leaves have not been transmitted, it is determined whether or not to search using the function profile 200 (step S20). If the function profile is not used, the process returns to step S15, and the same processing as described above is repeated. On the other hand, when the function profile is used, it is determined whether or not the number of services in the search result list 450 is equal to or less than the predetermined T (step S21). If it is less than or equal to the predetermined T, the process returns to step S15, and the same processing as described above is repeated.
[0126]
The determination process in step S21 is divided into a plurality of individual search conditions by the AND test in the initial search condition 40, and only one of the individual search conditions is transmitted to the network 20, and a search result corresponding to the individual search condition ( That is, when the number of services) exceeds a predetermined number, the remaining individual search conditions are matched with the function profile according to the search condition structure tree, and the remaining individual search conditions are transmitted and the search results are received. No processing is required.
[0127]
On the other hand, if it is not less than the predetermined T, the search execution control unit 313 requests the profile search unit 320 to perform function profile search processing using the function profile. The profile search unit 320 copies the search result list 450 to the function profile search target list (step S22), and executes function profile search processing (step S23). The profile search unit 320 copies the function profile search result obtained by the function profile search process to the search result list 450 (step S24), and ends the process in the profile search unit 320. When the processing in the profile search unit 320 ends, the search condition division and transmission processing by the search processing unit 310 ends.
[0128]
Next, search condition division and structural tree generation processing by the search request analysis unit 311 will be described with reference to FIGS. FIG. 21 to FIG. 23 are flowcharts for explaining search condition division and structural tree generation processing. In FIG. 21, the search request analysis unit 311 sets the initial search condition 40 acquired from the application 301 to the search condition p (step S111), sets the maximum length of the search condition to L (step S112), and sets the node list to be divided. Initialization is performed (step S113).
[0129]
The search request analysis unit 311 generates a node k corresponding to the search condition p (step S114), and adds the node k to the division target node list (step S115).
[0130]
The search request analysis unit 311 determines whether the division target node list is empty (step S116). When the division target node list is empty, the search request analysis unit 311 ends the search condition division and the structure tree generation process. On the other hand, if the division target node list is not empty, the first element from the division target node list is taken out as the node kc, and the extracted node kc is deleted from the division target node list (step S117).
[0131]
The search request analysis unit 311 sets the search condition corresponding to the node kc to pc (step S118). The search request analysis unit 311 determines whether or not the same search condition as the search condition pc exists in another search tree from the individual search condition list 430 of each tree (including the current tree) in the search condition structure tree storage area 312. Search is performed (step S119).
[0132]
The search request analysis unit 311 determines whether a node having the same search condition has been found (step S120). When a node having the same search condition is found, the structure tree identifier to which the searched additional information belongs is registered in the information of the node kc (step S121), the process returns to step S116, and the same processing is repeated.
[0133]
When a new initial search condition is received from the application 301 by the processing of steps S119, S120, and S121, and the initial search condition is divided, it is necessary to transmit this individual search condition if it is already the same as the individual search condition. There is no. Therefore, the number of search request transmissions can be reduced and the search efficiency can be improved.
[0134]
On the other hand, if a node having the same search condition is not found, the search condition pc is registered in the node additional information as additional information of the node kc (step S122). The search request analysis unit 311 determines whether the search condition pc is equal to or less than L bytes (step S123). When the search condition pc is L bytes or less, the search request analysis unit 311 registers the search condition pc in the individual search condition list 430 (step S127), and adds a link to the leaf to the node kc of the structural tree information (step S127). S128), the search condition division and the structure tree generation process are terminated.
[0135]
On the other hand, if the search condition pc is not less than or equal to L bytes, the search request analysis unit 311 sets the partial search conditions divided by the operator to p1 and p2, respectively, if the search condition pc is an AND or OR operation (step S125). , P1 and p2 are sequentially set as the search condition p, and step S114 is recursively called (step S126), and the search condition division and transmission process are terminated.
[0136]
Next, the function profile search process executed by the profile search unit 320 will be described with reference to FIG. FIG. 24 is a flowchart for explaining the function profile search process.
[0137]
24, the profile search unit 320 initializes the function profile search result (step S131), and sequentially selects each service in the function profile search target list (step S132). The profile search unit 320 determines whether or not the function profile acquisition processing has been performed for all services in the function profile search target list (step S133).
[0138]
When the function profile acquisition process is not performed for all services, the profile search unit 320 acquires the function profile from the network service device 100 that provides the selected service by using the function profile acquisition unit 321 (step S134). When the function profile acquisition unit 321 receives the function profile 200 from the network service device 100, the function profile acquisition unit 321 notifies the search condition matching unit 322.
[0139]
The search condition matching unit 322 matches the function profile 200 acquired from the function profile acquisition unit 321 with the structural tree (step S135). When not collating, the search condition collating unit 322 returns to Step S132 and repeats the same processing as described above. On the other hand, in the case of matching, the search condition matching unit 322 adds the selected service to the function profile search result (step S137), returns to step S132, and repeats the same processing as described above.
[0140]
On the other hand, when the function profile acquisition process is performed for all services in the determination process in step S133, the function profile search process is terminated.
[0141]
Next, search result reception and synthesis processing executed by the search processing unit 310 and the search result synthesis unit 315 will be described with reference to FIG. FIG. 25 is a flowchart for explaining search result reception and synthesis processing.
[0142]
In FIG. 25, when receiving a search response to the search request (step S151), the search processing unit 310 determines whether it is after a timeout (step S152). If not after the time-out, the search processing unit 310 acquires a tree identifier and a search condition ID from the search response (step S153).
[0143]
The search processing unit 310 links the network service device information to the search condition ID of the search result list corresponding to the tree identifier (step S154), and the search result combining unit 315 executes search result combining processing (step S155). ). The search result combining unit 315 updates the search result screen displayed on the display unit 55 based on the processing result in the search result combining process (step S156). The search processing unit 310 returns to step S151 and repeats the same processing as described above.
[0144]
On the other hand, if it is after the time-out by the determination processing in step S152, the search processing unit 310 ends the search result reception and synthesis processing.
[0145]
Next, search result composition processing executed by the search result composition unit 315 will be described with reference to FIG. FIG. 26 is a flowchart for explaining search result composition processing.
[0146]
In FIG. 26, the search result composition unit 315 starts from the root portion of the structural tree, performs a search with depth priority, and selects the first leaf (step S171). The search result synthesis unit 315 determines the selected leaf as the current node (step S172) and obtains a partial search result for the current node (step S173).
[0147]
Then, the search result composition unit 315 determines whether or not the node is a leaf (step S174). If the node is a leaf, the search result combining unit 315 acquires the search result stored in the search result list corresponding to the node (step S175), and ends the search result combining process.
[0148]
On the other hand, if the node is not a leaf, it is determined whether the search result for the child node of the node is stored in the search result table (step S176). If not saved, the process returns to step S171, and the same processing as described above is repeated. On the other hand, if it is stored, the partial results for each child node are combined with the AND or OR operator specified in these main nodes (step S177), and the search result composition processing is terminated.
[0149]
According to the above embodiment, the search condition divided in a predetermined byte range can be transmitted and received from each network service device 100 according to the structure tree information 410 indicating the data structure of the search condition structure tree of the initial search condition 40. Therefore, the user can specify an appropriate service desired by a detailed search that does not depend on the limit range of the data length. For example, the search can be performed according to detailed search conditions such as whether or not color copying is possible and whether or not stapling is possible.
[0150]
In the above embodiment, the client terminal 100 combines the search results acquired by the search response and creates a list of services that satisfy the initial search condition 40 requested from the application 301. However, the network service device 100 Each time the search condition divided from the same client terminal 300 is received, the side determines whether or not the divided search condition is satisfied by checking with the function profile 200, and all the divided search conditions are determined. After the conditions are satisfied, a combination process for combining the respective determination results is performed in accordance with the operators indicated by the divided search conditions. When the determination result obtained by the combination process satisfies the initial search condition 40, the search result is sent to the client terminal. May be transmitted. With such a configuration, the processing at the client terminal 300 can be reduced.
[0151]
In the above embodiment, the number of search request transmissions can be reduced by storing the individual search condition list shown in FIG. 10 already sent to the network 20 and the search result list 470 shown in FIG. This can reduce the search efficiency.
[0152]
As described above, according to the present invention, when the initial search condition is larger than the predetermined data length, it is divided and transmitted as the individual search condition (leaf), and therefore the entire initial search condition can be transmitted. In addition, the search results corresponding to the individual search conditions can be combined as if to restore the divided initial search conditions according to the search condition structure tree of the initial search conditions. can do. Further, it is possible to realize a detailed search that does not depend on a predetermined data length.
[0153]
In addition, a search condition structure tree is created using logical operators as nodes, but the division is performed when the divided end portion is larger than the predetermined data length, so do not perform division so as not to shorten it more than necessary. Can do. Accordingly, since search conditions are not transmitted to the network more than necessary, search efficiency can be improved.
[0154]
Further, since the search condition structure tree corresponding to the predetermined data length is created, the search condition structure tree is not hierarchized more than necessary.
[0155]
In addition, since the search condition structure tree corresponding to the data length of the UDP data bucket is created and the individual search condition corresponding to the data length of the UDP data bucket is obtained, the initial search condition is larger than the data length of the UDP data bucket. Even if it exists, a detailed search equivalent to the initial search condition can be performed.
[0156]
Furthermore, since the nodes are not transmitted unnecessarily, that is, unnecessary logical operators are not transmitted, the efficiency of data transfer can be improved.
[0157]
Further, when the initial search condition is divided into a plurality of individual search conditions by logical sum (AND), only one individual search condition is transmitted, so that the transmission process can be made efficient. In addition, since the function profile acquired based on the search result corresponding to the individual search condition is collated with other individual search conditions that have not been transmitted, the number of function profiles to be collated can be suppressed, and the efficiency Can be verified.
[0158]
【The invention's effect】
As described above, since the initial search condition is divided within a predetermined byte range, the search condition divided by multicast can be transmitted, and the entire initial search condition can be transmitted. In addition, since the search results corresponding to the divided search conditions can be synthesized as if the divided search conditions are restored according to the search condition structure tree of the initial search conditions, a service that satisfies the initial search conditions can be combined. Can be identified.
[0159]
[Brief description of the drawings]
FIG. 1 is a diagram illustrating a hardware configuration of a network service device according to an embodiment of the present invention.
FIG. 2 is a block diagram showing a hardware configuration of a client terminal according to an embodiment of the present invention.
FIG. 3 is a diagram illustrating a functional configuration example of a network service search system.
FIG. 4 is a diagram illustrating a configuration example of a communication protocol.
FIG. 5 is a diagram illustrating an example of an initial search condition.
FIG. 6 is a diagram illustrating an example of a function profile of a network service device.
FIG. 7 is a diagram illustrating an example of a search condition structure tree when divided by predetermined bytes.
FIG. 8 is a diagram illustrating a data configuration example of a search condition structure tree storage area;
FIG. 9 is a diagram illustrating a data structure example of structural tree information.
FIG. 10 is a diagram illustrating an example of a data structure of an individual search condition list.
FIG. 11 is a diagram illustrating an example of a data structure of node addition information.
FIG. 12 is a diagram illustrating an example of a data structure of a search result list.
13 is a diagram showing an example of a search request by SOAP when the search condition ID is 1001. FIG.
14 is a diagram illustrating an example of a search request by SOAP when the search condition ID is 1005. FIG.
FIG. 15 is a diagram illustrating an example of a search response by SOAP when the search condition ID is 1001;
16 is a diagram illustrating an example of an HTTP search request when the search condition ID is 1001. FIG.
FIG. 17 is a diagram illustrating an example of an HTTP search request when the search condition ID is 1005;
18 is a diagram showing an example of an HTTP search response when the search condition ID is 1001. FIG.
FIG. 19 is a diagram illustrating an example of join processing by an operator.
FIG. 20 is a flowchart for explaining search condition division and transmission processing;
FIG. 21 is a flowchart for explaining search condition division and structural tree generation processing;
FIG. 22 is a flowchart for explaining search condition division and structural tree generation processing;
FIG. 23 is a flowchart for explaining search condition division and structural tree generation processing;
FIG. 24 is a flowchart for explaining function profile search processing;
FIG. 25 is a flowchart for explaining search result reception and synthesis processing;
FIG. 26 is a flowchart for explaining search result composition processing;
[Explanation of symbols]
100 Network service equipment
110 Print Service Processing Unit
120 BMLinkS processing unit
121 HTTP server
122 Search request monitoring unit
123 Search request determination unit
200 Function profile
300 client terminals
301 Application
311 Search request analysis part
312 Search condition structure tree storage area
313 Search execution control unit
314 Search Request Transmission / Reception Unit
315 Search result composition part
320 Profile search part
321 Function profile acquisition unit
322 Search condition matching part
330 BMLinkS processing unit

Claims (13)

By dividing the first search condition for searching for a desired service provided via a network so as not larger than the predetermined data length to create a plurality of second search condition, each other of said plurality of second search condition Means for generating a search condition structure tree indicating the relationship between
If the search condition structure tree storage area where the search condition structure tree is stored is searched for whether the same search condition as the second search condition is not in another search condition structure tree, and the same search condition is found, Means for registering a search condition structure tree identifier;
When the same search condition is not found, the second search condition is transmitted to the network service device connected to the network service search device, and the second search condition received from the network service device for each of the second search conditions. Means for accumulating corresponding search results in the storage area;
While restoring the first search condition from the plurality of second search conditions, the search result according to the second search condition to be calculated from the storage area according to the logical operation specified by the first search condition acquires the network service search apparatus having a means for obtaining a search result according to said first search condition by combining the obtained the search result. The division creates a structure tree having the first search condition as a node as the logical operator so as to divide the first search condition when the first search condition is larger than a predetermined data length. Store the structure tree information indicating the data structure of the tree in the storage area,
The network service search device according to claim 1, wherein the restoration is performed based on the structural tree information stored in the storage area. 3. The network service search device according to claim 2, wherein the division is performed recursively using the current route as a node when the second search condition after division is larger than the predetermined data length. 4. The network service search apparatus according to claim 2, wherein the division creates a structure tree having the first search condition as a logical product and a logical sum as nodes. The network service search device according to any one of claims 1 to 4, wherein the predetermined data length is a data length of a UDP data bucket. The network service search device according to any one of claims 2 to 5, wherein an end portion of the structural tree is transmitted to the network as the second search condition to be transmitted. Sending one of the plurality of second search conditions divided by setting the logical sum indicated by the first search condition as a node to the network;
If the number of the second search condition the retrieval result corresponding to is equal to or greater than a predetermined number, according to the search condition parse tree, shown with the rest of the second search condition, a functional profile that indicates a possible providing function by the service The network service search device according to claim 1, wherein a search result corresponding to the first search condition is acquired by collating with the function. Determining whether the search results according to the second search condition are a predetermined number or more,
8. The method according to claim 7, wherein, based on the determination result, the second search condition that is divided but not transmitted by using the logical sum as a node is collated with the function indicated by the function profile. Network service search device . Corresponding to identification information for identifying the structural tree in the storage area, a storage location of the generated structural tree information and a list of contents of the second search condition within the predetermined data length The storage location of the second search condition list shown, the storage location of the search result list showing the search result list for each of the second search conditions, and the storage location of the node information showing the partial search conditions below each node 9. The network service search device according to claim 2, wherein the first search condition is managed by a table. The second search condition is transmitted to the network as a search request according to a predetermined message exchange protocol,
The network service search device according to any one of claims 1 to 9, wherein the search result is transmitted to the network as a search response according to the predetermined message exchange protocol only when the second search condition is satisfied. The second search condition is transmitted to the network as a search request according to a predetermined Internet communication protocol,
10. The network service search device according to claim 1, wherein the search result is transmitted to the network as a search response according to the Internet communication protocol only when the second search condition is satisfied. By dividing the first search condition for searching for a desired service provided via a network so as not larger than the predetermined data length to create a plurality of second search condition, each other of said plurality of second search condition Generate a search condition structure tree indicating the relationship between
If a search condition structure tree is searched for whether or not the same search condition as the second search condition exists in another search condition structure tree, and the same search condition is found, the search condition structure tree Register an identifier,
When the same search condition is not found, the second search condition is transmitted to the network service device connected to the network service search device, and the second search condition received from the network service device for each of the second search conditions. The corresponding search results are accumulated in the storage area,
While restoring the first search condition from the plurality of second search conditions, the search result according to the second search condition to be calculated from the storage area according to the logical operation specified by the first search condition And a search result corresponding to the first search condition is obtained by synthesizing the acquired search results. One or more service providing devices capable of providing a service via the network, and a plurality of service providing devices that provide a service existing on the network based on the first search condition specified by the application In a system including one or more client terminals that search for a service providing device that satisfies a first search condition, the service providing device creates the plurality of second search conditions, and the service providing device The search result received from the client terminal according to the search condition is stored in a storage area, and the search result according to the first search condition is acquired by combining the search result acquired by the service providing device. The network service search method according to claim 12 .

Images