Abstract: A reference string set including a group of strings is set. At least two specific tuples of substring triples is found inside the reference string set of strings. Each tuple is considered as a candidate for representing a related concept. Each concatenation of the substrings triples is an explicit member of the reference string set. Each middle substring of the substring triples is unequal to another middle substring within the substring triples found inside the reference string set. Each prefix substring is equal to all other prefix substrings within the substring triples found inside the reference string set. Each suffix substring is equal to all other suffix substrings within the substring triples found inside the reference string set. Either the prefix substring or the suffix substring is not empty.

Abstract: A conceptualization method uses maximum or other substrings of a string pattern to find specific N-tuples of substring triples with N?2 and m=1 . . . N inside a reference set (SET_r_i) of strings (STR_n_i). Each N-tuple is considered as a candidate for representing related concepts. Each concatenation of the substrings triples is an explicit member of the reference set (SET_r_i). Each middle substring out of middle substrings is unequal to another middle substring out of middle substrings within the substring triples found inside the reference set (SET_r_i). Each prefix substring (X_i) is equal to all other prefix substrings (X_i) within the substring triples found inside the reference set (SET_r_i). Each suffix substring (Z_i) is equal to all other suffix substrings (Z_i) within the substring triples found inside the reference set (SET_r_i). Either the prefix substring (X_i) or the suffix substring (Z_i) is not empty.

Abstract: Processing is provided for operating an in-memory database, wherein transaction data is stored by a persistence buffer in an FIFO queue, and update processor subsequently: waits for a trigger; extracts the last transactional data associated with a single transaction of the in-memory database from the FIFO memory queue; determines if the transaction data includes updates to data fields in the in-memory database which were already processed; and if not, then stores the extracted transaction data to a store queue, remembering the fields updated in the in-memory database, or otherwise updates the store queue with the extracted transaction data. The process continues until the extracting is complete, and the content of the store queue is periodically written into a persistent storage device.

Abstract: A method of analyzing a string-pattern includes defining a minimum length (Lmin—1) of substrings (STR_A_B) to be considered; defining a maximum length (Lmax—1) of substrings (STR_A_B) to be considered; with a computer, searching the string-pattern for substrings (STR_A_B) with a length in an interval between the minimum length (Lmin—1) and the maximum length (Lmax—1); counting an occurrence (Occ_A_B) of each substring (STR_A_B) found with a length in the interval between the minimum length (Lmin—1) and the maximum length (Lmax—1); and pruning away a number of the substrings (STR_A_B) that meet one or more criteria. The criteria are selected from the group consisting of (1) being contained inside the maximum substring (STR_A_C) in a subset (SET_A) of substrings (STR_A_B), (2) being shorter than the maximum substring (STR_A_C), (3) occurring with a same frequency as the maximum substring (STR_A_C), and combinations thereof.

Abstract: A method and systems for providing XML data is disclosed. In accordance with an embodiment of the invention, a second data processing system, which is connected to a first data processing system via a network, receives a first request over the network from the first data processing system. The first request comprises specifications for subsequent transfers of XML data from the second data processing system to the first data processing system. The specifications specify for which type of XML documents to be transferred in subsequent transfers to the first data processing system which excerpts of XML data shall be sent. An acknowledge message, sent to the first data processing system from the second data processing system, indicates the latter's ability to provide the excerpts of XML data for the types of XML documents in the subsequent data transfers.

Abstract: System and computer program product for processing a text search query in a collection of documents. A full posting index is generated that has first index terms and a full posting list for each first index term, enumerating occurrences of the first index terms in the documents of the collection. A text search query includes search conditions search terms. The search conditions are translated into conditions on the first index terms to provide translated conditions. At least one short posting index is generated, which includes second index terms and a short posting list for each second index term, enumerating documents in which the second index terms occur. Filter conditions and complementary conditions are generated to represent the translated conditions. The filter conditions approximate the translated conditions, and are processed using the short posting index. The complementary conditions are processed using the full posting index to provide a query result.

Abstract: A method, system and computer program product implementing the method are provided to process a text search query in a collection of documents. A full posting index is generated for the documents in the collection. The full posting index comprises one or more first index terms and a full posting list for each first index term, enumerating the occurrences of the first index term in the documents. In addition to the full posting index, at least one additional posting index is generated for the documents. The additional posting index is related to a defined document part and comprises one or more second index terms and a restricted posting list for each second index term, enumerating all occurrences of the second index term in the document part of the documents of the collection. The text search query is performed using the additional posting index.

Abstract: A computerized method for predicting/completing the addressee field in an electronic mail system, in which user-related history information, including the user's sent and/or received mail, is analyzed, using text mining and/or data mining techniques, for associating the most probable addressee for a given e-mail letter.

Abstract: A conceptualization method uses maximum or other substrings of a string pattern to find specific N-tuples of substring triples with N?2 and m=1 . . . N inside a reference set (SET_r_i) of strings (STR_n_i). Each N-tuple is considered as a candidate for representing related concepts. Each concatenation of the substrings triples is an explicit member of the reference set (SET_r_i). Each middle substring out of middle substrings is unequal to another middle substring out of middle substrings within the substring triples found inside the reference set (SET_r_i). Each prefix substring (X_i) is equal to all other prefix substrings (X_i) within the substring triples found inside the reference set (SET_r_i). Each suffix substring (Z_i) is equal to all other prefix substrings (Z_i) within the substring triples found inside the reference set (SET_r_i). Either the prefix substring (X_i) or the suffix substring (Z_i) is not empty.

Abstract: A method of analyzing a string-pattern includes defining a minimum length (Lmin—1) of substrings (STR_A_B) to be considered; defining a maximum length (Lmax—1) of substrings (STR_A_B) to be considered; with a computer, searching the string-pattern for substrings (STR_A_B) with a length in an interval between the minimum length (Lmin—1) and the maximum length (Lmax—1); counting an occurrence (Occ_A_B) of each substring (STR_A_B) found with a length in the interval between the minimum length (Lmin—1) and the maximum length (Lmax—1); and pruning away a number of the substrings (STR_A_B) that meet one or more criteria. The criteria are selected from the group consisting of (1) being contained inside the string-pattern in a subset (SET_A) of substrings (STR_A_B), (2) being shorter than the string-pattern, (3) occurring with a same frequency as the string-pattern, and combinations thereof.

Abstract: A method and systems for providing XML data is disclosed. In accordance with an embodiment of the invention, a second data processing system, which is connected to a first data processing system via a network, receives a first request over the network from the first data processing system. The first request comprises specifications for subsequent transfers of XML data from the second data processing system to the first data processing system. The specifications specify for which type of XML documents to be transferred in subsequent transfers to the first data processing system which excerpts of XML data shall be sent. An acknowledge message, sent to the first data processing system from the second data processing system, indicates the latter's ability to provide the excerpts of XML data for the types of XML documents in the subsequent data transfers.

Abstract: System and computer program product for processing a text search query in a collection of documents. A full posting index is generated that has first index terms and a full posting list for each first index term, enumerating occurrences of the first index terms in the documents of the collection. A text search query includes search conditions search terms. The search conditions are translated into conditions on the first index terms to provide translated conditions. At least one short posting index is generated, which includes second index terms and a short posting list for each second index term, enumerating documents in which the second index terms occur. Filter conditions and complementary conditions are generated to represent the translated conditions. The filter conditions approximate the translated conditions, and are processed using the short posting index. The complementary conditions are processed using the full posting index to provide a query result.

Abstract: A method, system, and computer program product are provided for processing a text search query in a collection of documents. A full posting index is generated. The full posting index comprises one or more first index terms and a full posting list for each first index term, enumerating occurrences of the first index term in the documents of the collection. A text search query comprises search conditions on search terms. These search conditions are translated into conditions on the search terms to provide translated conditions. At least one short posting index is generated. The short posting index comprises one or more second index terms and a short posting list for each second index term, enumerating the documents in which the second index term occurs. Filter conditions and complementary conditions to represent the full content of the translated conditions are generated, wherein the filter conditions approximate the translated conditions.

Abstract: According to the present invention a method and an infrastructure are provided for processing a text search query in a collection of documents (100). Therefore, a full posting index (200) is generated, stored and updated for each document added to the collection (100). Said full posting index (200) comprising a set of index terms and a full posting list for each index term of said set, enumerating all occurrences of said index term in all documents of the collection (100). In addition to said full posting index (200) at least one additional posting index (400, 500, 600) is generated, stored and updated for each document added to the collection (100). Said additional posting index (400, 500, 600) is related to a defined document part and comprises a set of index terms and a restricted posting list for each index term of said set, enumerating all occurrences of said index term in said document part of all documents of the collection (100).

Abstract: A method, system and computer program product implementing the method are provided to process a text search query in a collection of documents. A full posting index is generated for the documents in the collection. The full posting index comprises one or more first index terms and a full posting list for each first index term, enumerating the occurrences of the first index term in the documents. In addition to the full posting index, at least one additional posting index is generated for the documents. The additional posting index is related to a defined document part and comprises one or more second index terms and a restricted posting list for each second index term, enumerating all occurrences of the second index term in the document part of the documents of the collection. The text search query is performed using the additional posting index.

Abstract: A method and system for improving text searching is disclosed. The method and system provides a network of document relationship and utilizes the network of document relationships to identify the region of documents that can be used to satisfy a user's request. In a preferred embodiment, the text searching method in accordance with the present invention augments a conventional text search by using information on document relationships and metadata. The text searching method and system improves upon conventional text search techniques by incorporating relationship metadata to define regions to search within. In the present invention the definition of a region is not limited to just categories as it includes neighborhoods around individual documents and sets which have been user defined.

Abstract: Provided is a method for processing queries in a database in which data records have a parametric object and an extension of a nonparametric data type. A query includes a parametric condition for the parametric object of the data records and a nonparametric condition for the nonparametric extension of the data records. Parametric information of each data record is translated into constructs of the data type of the extension. A parametric result set of data records for the parametric condition is generated. The parametric condition of said query is translated into a filter condition for said constructs of the data type of the extension. The nonparametric condition of said query and said filter condition are employed to generate a nonparametric result set. The parametric result set and the nonparametric result set are joined to obtain a result set.

Abstract: A method for the generation of large volumes of text documents comprises the steps of collecting a set of unstructured text documents as training documents and choosing a language model (21). New documents are generated by using the language model and its parameters and by using additional words beyond the words contained in the training documents (25). A n-gram model or a probabilistic deterministic context-free grammar (PCFG) model may be used as language model. For the generation of structured documents a language model for modelling the text is combined with a probabilistic deterministic finite automata (PDFA) for modelling the structure of the documents. The combined model is used to generate new documents from the scratch or by using the results of an analysis of a set of training documents.

Abstract: A method and system for improving text searching is disclosed. The method and system provides a network of document relationship and utilizes the network of document relationships to identify the region of documents that can be used to satisfy a user's request. In a preferred embodiment, the text searching method in accordance with the present invention augments a conventional text search by using information on document relationships and metadata. The text searching method and system improves upon conventional text search techniques by incorporating relationship metadata to define regions to search within. In the present invention the definition of a region is not limited to just categories as it includes neighborhoods around individual documents and sets which have been user defined.

Abstract: The present system processes a text search query on a collection of documents in which a text search query is translated into conditions on index terms. The system groups documents in blocks of N and generates and stores a block posting index enumerating blocks in which the index term occurs in at least one document of the block. The system generates and stores intrablock postings for each block and each index term. The intrablock postings comprise a bit vector of length N representing the sequence of documents forming the block. Each bit indicates the occurrence of the index term in the corresponding document. The conditions of a given query are processed using the block posting index to obtain hit candidate blocks and identify the hit documents fulfilling the conditions.