Abstract: A data partitioning apparatus receives stream data and stores with previous-and-subsequent information that specifies data previous and subsequent to the data. Then, for groups, each of which contains the data that are stored and that are partitioned into the number of the groups, the data partitioning apparatus stores top information specifying data located at the top in a corresponding group and end information specifying data located at the end in the corresponding group. Then, when new data is stored, the data partitioning apparatus specifies data previous and subsequent to the new data and stores the new data by associating it with the previous-and-subsequent information that specifies the data previous and subsequent to the new data. Then, when data is inserted, the data partitioning apparatus updates information for each group such that the difference between the number of data belonging to each group is equal to or less than one.

Abstract: An apparatus includes a unit dividing a region into blocks having a predetermined bit length and generating addition data having the predetermined bit length corresponding to coordinate data, a unit storing storage data having the predetermined bit length, a unit generating composite data having a bit length twice the length of the predetermined bit length by connecting the addition data to the storage data, and storing the composite data, and a unit repeating an operation of designating the bit length of the composite data as the predetermined bit length, instructing to generate the addition data, and instructing to generate and store the composite data. The number of different bits between a bit string of a location corresponding to the input coordinate data and a bit string of a reference location tends to increase as a distance between the location corresponding to the coordinate data and the reference location increases.

Abstract: The matching apparatus 100 stores, with respect to a branching pattern included in event patterns 140a, a reception time of an event that serves as the branching point in a source node that indicates the transition destination of the event, connects the source node to the branch node by a transition with an interval condition, connects the branch nodes to the link node that indicates the linking point at which these branch nodes are linked together, and thereby generates NFAs 140b. Then, the matching apparatus 100 compares event streams 140c with the NFAs 140b to determine whether the event streams 140c includes the event patterns 140a.

Abstract: A matching device builds a parse tree from an event pattern. The matching device builds an automaton by, while traversing the parse tree, joining child nodes of an AND node in parallel to the AND node and joining child nodes of an OR node in parallel to the OR node. The matching device performs matching of determining whether an event stream includes the event pattern by comparing the event stream with the automaton.

Abstract: An apparatus extracts an area having a highest score or a lowest score that is calculated based on evaluation values of points from a target area including a set of a plurality of points that can be distributed at two-dimensional coordinates. It determines whether the area extracted and an area overlapping a plurality of the target areas intersect with each other, and deletes an area having a lower score or a higher score out of the areas determined to intersect with each other. It selects an area having a highest score or a lowest score out of the areas extracted at the extracting and not deleted at the determining.

Abstract: A search device used to search for a search keyword from an object to be searched based on an automaton generated in accordance with the search keyword, includes: a first memory region; a second memory region; an information generation part that generates third information from first information and second information; a determination part; and a selection part, wherein: a first state corresponding to the first information is read from the first memory region; fourth information and a second state corresponding to the third information are read from the second memory region; the determination part determines whether or not fifth information including the first information and the second information matches with the fourth information; and the selection part selects the first state when not match in the determination and when matches in the determination, selects the second state.

Abstract: A search device creates as many stack frames as the number obtained by adding one to the number of search condition character strings contained in an out-of-search-condition character string in a stack, sequentially inputs character strings in a text into automaton data, determines whether the character strings in the text hit the search condition character string or the out-of-search-condition character string to push correspondence to the stack or to change correspondence into non-correspondence, and determines whether the text is to be searched.

Abstract: A computer-readable recording medium stores therein an information retrieving program that causes a computer to execute acquiring a document to be searched and having a hierarchical structure; generating a path schema related to the acquired document; receiving input of a retrieval keyword, a retrieval condition for the retrieval keyword, and a retrieval equation specifying a retrieval range for the retrieval keyword; generating a single automaton that includes a hierarchy retrieval automaton that retrieves a hierarchy of the generated path schema and a hit keyword retrieval automaton that retrieves a hit keyword satisfying the retrieval condition, the single automaton making state transition between a hit hierarchical node where the hit keyword in the hierarchy retrieval automaton is present and a set of nodes representing the hit keyword; retrieving, from the document and using the single automaton, the hit keyword within the retrieval range; and outputting a retrieval result.

Abstract: A retrieval device according to the present embodiment associates one tag key with one node and removes a node not having a tag key when a trie tree generating unit generates a trie tree. Moreover, because a tag key having a low priority is registered in a node close to a root node when the trie tree generating unit registers tag keys in the nodes of the trie tree, the retrieval device can narrow down a node region that is a comparison target when a trie tree searching unit performs a retrieval process.

Abstract: In a search device according to the present invention, a path trie generation unit generates an input path trie from XML data, a path trie display unit outputs the input path trie to an output unit such as a display, so that a user can specify Join points and combining conditions. An instruction reception unit generates a query serving as a command statement to combine each piece of XML data based on the Join points and the combining conditions that are specified by the user.

Abstract: A machine-executable attribute extraction method comprising: extracting, vis-à-vis a plurality of documents in the archival memory (that also stores registration dates and attributes of the documents) having registration dates falling within a desired time period, feature words for each attribute value of the corresponding attributes of the plurality of documents; registering, into the work memory, the desired time period, and the extracted feature words for each attribute value of the corresponding attributes of the plurality of documents; determining, amongst the extracted feature words in the work memory, first feature words for which the attribute has a first attribute value and second feature words for which the attribute has a second attribute value; calculating a similarity between the first feature words and the second feature words; judging whether the similarity satisfies a condition; and outputting the second attribute value when the similarity satisfies the condition.

Abstract: A search device includes an accelerator and a CPU. The accelerator includes a plurality of search cores and a scheduler. The scheduler is configured to distribute target text to the search cores in units of records ordered by record sequence number, and the search cores are configured to perform automaton matching on the distributed records in a parallel fashion. The CPU is configured to construct an automaton in accordance with a search expression input thereto, and to perform logical expression evaluations in order of the record sequence number on matching results obtained on a record-by-record basis.

Abstract: A retrieval device, from semi-structured data formed by item elements and value elements, creates aggregated structure information from the semi-structured data by aggregating the plurality of child item elements having the same name and directly connected to parent item elements having the same name, into one child item element. The device receives a retrieval request with an output condition and a constraint condition specified on the aggregate structure information. The device determines whether or not a plurality of query are created according to the retrieval request by checking a branch point at the common item elements between the output condition and the constraint condition in the aggregated structured information. And the device outputs a re-aggregate structure information corresponded to the query showing the branch point which is not expressed in the aggregate structure information to the display device.

Abstract: A search device used to search for a search keyword from an object to be searched based on an automaton generated in accordance with the search keyword, includes: a first memory region; a second memory region; an information generation part that generates third information from first information and second information; a determination part; and a selection part, wherein: a first state corresponding to the first information is read from the first memory region; fourth information and a second state corresponding to the third information are read from the second memory region; the determination part determines whether or not fifth information including the first information and the second information matches with the fourth information; and the selection part selects the first state when not match in the determination and when matches in the determination, selects the second state.

Abstract: A method and apparatus for allowing a computer to search a hierarchical structure document by creating a list in which a true flag indicating that conditions of a predicate of a search formula are satisfied or a false flag indicating that the conditions of the predicate of the search formula are not satisfied is set to a predicate node of the document data based on the search formula, and scanning the list to search for data designated by the search formula from the document data.

Abstract: A search device creates as many stack frames as the number obtained by adding one to the number of search condition character strings contained in an out-of-search-condition character string in a stack, sequentially inputs character strings in a text into automaton data, determines whether the character strings in the text hit the search condition character string or the out-of-search-condition character string to push correspondence to the stack or to change correspondence into non-correspondence, and determines whether the text is to be searched.

Abstract: When a searching apparatus accepts a search condition including a logical condition formed of variables, transition table is created by using a BDD method. In the transition table, a combination of a bit string indicative of true or false of a variable at each level for arriving from a starting-point variable to an arrival variable and the starting-point variable is associated with the arrival variable. Then, a true/false decision on the search condition of the search target data is made by, with an arrival variable of a transition destination being taken as the starting-point variable, extracting a bit string of a predetermined number of digits from the starting-point variable from among logical bit strings of the search target data and specifying the arrival variable as the transition destination based on the combination and the transition table.

Abstract: A computer-readable recording medium stores therein an information retrieving program that causes a computer to execute acquiring a document to be searched and having a hierarchical structure; generating a path schema related to the acquired document; receiving input of a retrieval keyword, a retrieval condition for the retrieval keyword, and a retrieval equation specifying a retrieval range for the retrieval keyword; generating a single automaton that includes a hierarchy retrieval automaton that retrieves a hierarchy of the generated path schema and a hit keyword retrieval automaton that retrieves a hit keyword satisfying the retrieval condition, the single automaton making state transition between a hit hierarchical node where the hit keyword in the hierarchy retrieval automaton is present and a set of nodes representing the hit keyword; retrieving, from the document and using the single automaton, the hit keyword within the retrieval range; and outputting a retrieval result.

Abstract: When a search device receives a query from a terminal device, the search device specifies portions of OR condition containing OR operators from the query. The search device judges whether reverse axes and OR operators are contained in the specified portions of OR condition. When reverse axes and OR operators are contained, the search device divides the query into subqueries using the OR operators contained in the portions of OR condition as division points.

Abstract: A cache system includes processing units operative to access a main memory device, caches coupled in one-to-one correspondence to the processing units, and a controller coupled to the caches to control data transfer between the caches and data transfer between the main memory and the caches, wherein the controller includes a memory configured to store first information and second information separately for each index, the first information indicating an order of oldness of entries in each one of the caches, and the second information indicating an order of oldness of entries for the plurality of the caches, and a logic circuit configured to select an entry to be evicted and its destination in response to the first and second information when an entry of an index corresponding to an accessed address is to be evicted from a cache corresponding to the processing unit that accesses the main memory device.