Abstract: A log retrieval support device 30 specifies a rare series that is an abnormal event group in a log recording a plurality of events executed in a predetermined system, generates a condition for regarding that there is a log having the same event group as each of the rare series, and specifies the number or ratio of logs having the same event group as each of the rare series among a plurality of logs recording a plurality of events executed in the predetermined system on the basis of the conditions. The log retrieval support device generates a new condition obtained by partially relaxing the condition in the case where the number or ratio is less than a predetermined value and generates a new condition obtained by partially limiting the condition in the case where the number or ratio is the predetermined value or more.

Abstract: A document retrieval system includes a storage device and a retrieval server. The storage device stores document data including documents compressed so as to correspond to a plurality of divided document groups, indexes indicating correspondence relations between partial character strings for retrieving the documents and first identifiers indicating the documents, and a first correspondence table in which the document groups are divided into document small groups, and second identifiers which indicate the document small groups correspond to the partial character strings.

Abstract: A data search method and system are provided in which data including a suitable reply to a query can be retrieved through a concept search. A data search method for searching for a text group that is similar to an inquiry text from data storing a plurality or text groups into which a plurality of texts are grouped includes: obtaining first information that is likely to be a search object and an appearance frequency of the first information with respect to each of the text groups and classifying the first information as second information that is a search object if the appearance frequency of the first information is less than or equal to a predetermined frequency; extracting third information included in the inquiry text; searching for the third information from the second information with respect to each of the text groups; and outputting the identifiers of a predetermined number of text groups with a higher number of hits on the third information included in the inquiry text.

Abstract: This string search method for a computer that searches documents for a specified string includes the following steps: a first step in which the specified string is divided into a plurality of characters or strings, including a first character or string and a second character or string; a second step in which a plurality of sets are created by grouping a plurality of documents in units; a third step in which a determination is made as to whether or not the first character or string appears in that set; a fourth step in which a determination is made as to whether or not the second character or string appears in that set; and a sixth step in which, if first appearance information and second appearance information were both added to one of the plurality of sets, namely a first set, a detailed search is performed on said first set.

Abstract: A character string search system is provided with: a storage device in which, in a first search, an attribute of a searcher who has input a search term for the first search, and a term group composed of one or more search terms used in the first search are associated with one another as rules and are stored; a processor; and a display device. The processor specifies a first rule including a search term input by a searcher in a second search, from among the rules stored in the storage device, and specifies a second rule, including a searcher having an attribute close to the attribute of the searcher in the second search, from among the first rules.

Abstract: A document retrieval system includes a storage device and a retrieval server. The storage device stores: document data including documents compressed so as to correspond to a plurality of divided document groups; indexes indicating correspondence relations between partial character strings for retrieving the documents and first identifiers indicating the documents; and a first correspondence table in which the document groups are divided into document small groups, and second identifiers which indicate the document small groups correspond to the partial character strings.

Abstract: This string search method for a computer that searches documents for a specified string includes the following steps: a first step in which the specified string is divided into a plurality of characters or strings, including a first character or string and a second character or string; a second step in which a plurality of sets are created by grouping a plurality of documents in units; a third step in which a determination is made as to whether or not the first character or string appears in that set; a fourth step in which a determination is made as to whether or not the second character or string appears in that set; and a sixth step in which, if first appearance information and second appearance information were both added to one of the plurality of sets, namely a first set, a detailed search is performed on said first set.

Abstract: It is possible to efficiently use an index search in a database search and to reduce the amount of processing of an actual data search. A computing machine has a storage unit which stores an index definition including information representing an index creation range of a search index created for a data group, and a control unit. The control unit detects, from a search target range included in a search request for the data group and an index definition, the inclusion relationship of at least a part of one of the search target range and the index creation range. When the inclusion relationship is detected, the control unit first executes an index search using the search index in response to the search request, then executes an actual data search in the search target range for document data excluding data, for which success or failure of a search request has been finalized by the index search, and outputs a search result.

Abstract: A data search method and system are provided in which data including a suitable reply to a query can be retrieved through a concept search. A data search method for searching for a text group that is similar to an inquiry text from data storing a plurality or text groups into which a plurality of texts are grouped includes: obtaining first information that is likely to be a search object and an appearance frequency of the first information with respect to each of the text groups and classifying the first information as second information that is a search object if the appearance frequency of the first information is less than or equal to a predetermined frequency; extracting third information included in the inquiry text; searching for the third information from the second information with respect to each of the text groups; and outputting the identifiers of a predetermined number of text groups with a higher number of hits on the third information included in the inquiry text.

Abstract: A data collection storage area includes messages created as information on at least one theme, each of the messages not indicating that the message is about one of the at least one theme. A computer includes: a unit creation module reorganizing the messages stored in the data collection storage area into at least one data unit including at least one of the messages to indicate that each of the at least one data unit is about one of the at least one theme; an index creation module creating an index from the messages included in the at least one reorganized data unit; a search execution module identifying a data unit matching a search condition based on the created index and the search condition upon receipt of the search condition to search the messages; and a result output module outputting a search result based on the identified data unit.

Abstract: A method for creating an index for searching a structured document having a document data-structure stored, in a computer. The method to be performed in the computer for creating an index includes the steps of: analyzing a structured document to extract a document data-structure in the structured document; normalizing the extracted document data-structure to create a logical structure index composed of a plurality of elements having a hierarchical structure; extracting an appearance number of each element in the created logical structure index; and extracting elements for creating the index, based on the logical structure index, by comparing the extracted element appearance number and a first predetermined threshold.

Abstract: In registering operation of a document to be searched for, a document identifier management table for managing a range of a document identifier stored for each page and a page identifier of the page is created, and an individual-search-server's search range management table for managing the range of the document identifier in charge of each search server is created. In searching operation of each search server of the document to be searched for, the individual-search-server's search range management table is referred to acquire a range of the allocated document identifier. For each index key forming a query term specified as a query condition, the document identifier management table is referred to to acquire the page identifier storing the document identifier of the allocated range. The searching operation is carried out by referring to a page shown by the acquired page identifier.

Abstract: Provided is a data management method. Data corresponds to an entry including a reference to another entry and is managed in a set which is a collection of pieces of the data. The set corresponds to a linked list where the entry corresponding to the data is linked in order of addition of the data. The entry includes an insertion time sequence number inserted into the linked list and information indicating if the data has been deleted from the set. In that case, the entry is separated from the linked list at a predetermined timing. The linked list is traced to refer to the data. When the insertion time sequence number of the reference entry is later than the insertion time sequence number of the entry which has already been referred to, it is judged that the reference entry has been separated from the linked list.

Abstract: There is provided a data management method for managing data stored in a parallel database system in which a plurality of data servers manage data. The parallel database system manages: correspondence information between a characteristic of the data and each of the plurality of data servers that manages the data; and a data area corresponding to the characteristic of the data. The data management method comprising the steps of: extracting the characteristic of the data from data to be stored in the data area; storing the data in the data area based on the extracted characteristic of the data; specifying a corresponding data area based on the characteristic of the data stored in the data area by referring to the correspondence information; and accessing, by each of the plurality of data servers, the specified data area.

Abstract: Information that individual elements (characteristic character strings) indicative of characteristics of a registered document appear in the registered document is stored in advance. When calculating similarity of the registered document, a query designated by a searcher is analyzed. The query is represented by a characteristic vector having the individual elements which take the relation between a plurality of words into consideration. Pieces of appearance information of the individual words contained in the query are counted. The counted appearance information is compared with a searching index to calculate similarity between documents.

Abstract: A method for creating an index for searching a structured document having a document data-structure stored, in a computer. The method to be performed in the computer for creating an index includes the steps of: analyzing a structured document to extract a document data-structure in the structured document; normalizing the extracted document data-structure to create a logical structure index composed of a plurality of elements having a hierarchical structure; extracting an appearance number of each element in the created logical structure index; and extracting elements for creating the index, based on the logical structure index, by comparing the extracted element appearance number and a first predetermined threshold.

Abstract: In registering operation of a document to be searched for, a document identifier management table for managing a range of a document identifier stored for each page and a page identifier of the page is created, and an individual-search-server's search range management table for managing the range of the document identifier in charge of each search server is created. In searching operation of each search server of the document to be searched for, the individual-search-server's search range management table is referred to acquire a range of the allocated document identifier. For each index key forming a query term specified as a query condition, the document identifier management table is referred to to acquire the page identifier storing the document identifier of the allocated range. The searching operation is carried out by referring to a page shown by the acquired page identifier.

Abstract: Information that individual elements (characteristic character rings) indicative of characteristics of a registered document appear in the registered document is stored in advance. When calculating similarity of the registered document, a query designated by a searcher is analyzed. The query is represented by a characteristic vector having the individual elements which take the relation between a plurality of words into consideration. Pieces of appearance information of the individual words contained in the query are counted. The counted appearance information is compared with a searching index to calculate similarity between documents.