Abstract: A method of representing a dataset having a plurality of elements characterized by a plurality of relations, the method comprising the following steps. A first step includes, slicing at least a portion of the dataset into a plurality of slices, each of the slices comprises a portion of the plurality of elements. A second step includes, for each element of the plurality of elements, assigning a set of identifiers, each identifier of the set being characterized by a position within the set, the position representing one of the slices. A third step includes, for each element of the plurality of elements, assigning an interval, the interval representing at least one relation of the element to at least one element of the plurality of elements.

Abstract: A search system, an information-providing system and an information search method. “Response information” such as a checkmark for indicating exclusion and a message added by a customer terminal and “additional information” added by a supplier terminal to a commodity retrieved by a search for data in a commodity database of a server based on search criteria input through the customer terminal are associated and stored with “session-specific information” in a session-specific database. When the supplier terminal accesses the server, the “response information” input by the customer terminal is transferred to the supplier terminal. When the customer terminal accesses the server, the “additional information” added by the supplier terminal is transferred to the customer terminal.

Abstract: A system (10) for sorting search results according to a buyer profile (47) during the matching phase of an electronic commerce transaction includes a database containing a buyer profile (47) associated with a buyer (20), the buyer profile (47) comprising a record of the number of times each of multiple sort criteria has appeared in at least some previous events involving the buyer (20). A server (40) receives multiple search results communicated from one or more seller databases (32) in response to an under-constrained search query in which exact attribute values are not specified for one or more attributes. The server (40) accesses the buyer profile (47) to determine an order of display based on the number of times one or more sort criteria in the buyer profile (47) applicable to the search results have appeared in the previous events involving the buyer (20). The server (40) sorts the search results according to the determined order of display and communicates the sorted search results to the buyer (20).

Abstract: A database query optimizer processes an expression in a database query, and generates therefrom an operand list and a corresponding truth table that may be represented by a list of binary characters, where the operand list and corresponding truth table represent a disjunct normal form for the expression. Each expression is stored once it is processed into its operand list and corresponding list of binary characters. New queries are processed into component expressions, and each expression is checked to see if the expression was previously processed and stored as a processed expression. If so, the operand list and list of binary characters for the previously-stored expression may be used in processing the current expression. If there is no previously-stored expression that corresponds to the current expression, the previously-stored expressions are checked to see if any correspond to a complement of the current expression.

Abstract: A system is provided that is accessible through a computer network and is used for collecting and tracking process capability data for manufacturers of parts. The recipient of the parts can input information on the characteristics of the parts that require process capability data into the system. The manufacturer of the parts can then access the system and enter process capability data relative to a specific part and characteristic. The system can then be used by both recipients and manufacturers to generate reports on the process capability status for all parts, processes, characteristics and manufacturers.

Abstract: A method, computer program and database system are disclosed for performing an outer join of at least a first table T1 and a second table T2. The join has join conditions. Each of the tables has an associated Star Map, S1 and S2, respectively. Each Star Map includes bitmap entries which have locations indexed by the hash of one or more values associated with one or more join key columns of its associated table. A bitmap entry in a Star Map, if set, indicates the presence of a row in its associated table that has entries in the one or more join key columns that together hash to the location of the bitmap entry.

Abstract: A method and system for searching for data in at least two databases. To allow simultaneous access to two or more databases, a search term is entered. On the basis of the entered search term, the predecessor or a plurality of predecessors and the successor or a plurality of successors to the search term and, if available, the search term itself from each of the databases are stored in a search table, and the search term, if stored in the search table, or that term from the predecessor or plurality of predecessors and successor or plurality of successors stored in the search table which comes closest after the entered search term is displayed.

Abstract: A method is provided for allowing a database search that prevents an owner of the database or someone intercepting the database search in the network from knowing the contents of the query, without requiring any particular processing on the part of the database. Client 20 accesses database server 10 which stores sequence patterns and inquires whether the sequence patterns stored in the database server 10 exist in a predetermined sequence. Client 20 comprises sequence processing section 21 for dividing a search sequence subjected to search to create multiple subsequences; and query issuing section 22 for issuing a query to database server 10 using the created multiple subsequences individually as a query sequence.

Abstract: Methods and data structures are disclosed for carrying out identifying differences between large files comprising many lines (or other units of comparison such as rows, words, paragraphs, sentences, etc.). The disclosed methods and data structures facilitate and carry out a streamlined, yet thorough comparison of two files to identify differences between them. The streamlining is achieved by pre-processing the files prior to submitting them to any known longest common subsequence (LCS) search engine. The output of the LCS generator is post-processed to compensate for changes to the sequences introduced by the pre-processing stage.

Abstract: A computerized data mining method for determining a prediction model for a dependent data mining variable based on a multitude of independent data mining variables, comprising replacement of the independent data mining variable with potential values from a global range by a multitude of independent local data mining variables, each relating to potential values from a sub-range of the global range. The method further comprises an initialization step and a looping sequence that includes steps of determining for every independent local data mining variable not yet reflected in the current prediction model a multitude of partial regression functions, determining for each of the partial regression functions a significance value, selecting the most significant partial regression function and the corresponding not yet reflected local data mining variable, and adding the most significant partial regression function to the current prediction model.

Abstract: A technique for representing the structure of hierarchically-organized data in a non-hierarchical data structure, such as a relation. The hierarchically-organized data is represented as a tree, and each node in the tree is assigned a position identifier that represents both the depth level of the node within the hierarchy, and its ancestor/descendant relationship to other nodes. The data represented by each node, as well as its position identifier, is stored in a row of a relational database, thereby capturing the hierarchical structure of the data in such relational database. A technique is provided for the compressed storage of position identifiers in a format that allows an efficient bytewise comparison of position identifiers to determine relative order and ancestry.

Abstract: A document delivery system that provides first content and second content to a reader over a network, such as the Internet. The delivery system selects content for the reader based upon profile information. The profile information may relate to any one or more of the first content, the second content, and the reader. In addition to providing the first and second content to the reader, the delivery system also provides at least the profile information used to select the first content and second content for delivery to the reader.

Abstract: The invention features a method and system for identifying a plurality of tags using an efficient memoryless protocol. The system includes a reader and a plurality of tags. The reader is adapted to maintain an ordered set of query strings; select a string from the set of query strings; broadcast a query message containing the selected string or a portion of the selected string to the tags; and receive a response from one of the tags. The tags operate without batteries and are adapted to respond to the selected string broadcast by the reader. Accordingly, the tag identification methods are efficient in terms of both time and communication complexities.

Abstract: Database system query optimizers use several techniques such as histograms and sampling to estimate the result sizes of operators and sub-plans (operator trees) and the number of distinct values in their outputs. Instead of estimates, the invention uses the exact actual values of the result sizes and the number of distinct values in the outputs of sub-plans encountered by the optimizer. This is achieved by optimizing the query in phases. In each phase, newly encountered sub-plans are recorded for which result size and/or distinct value estimates are required. These sub-plans are executed at the end of the phase to determine their actual result sizes and the actual number of distinct values in their outputs. In subsequent phases, the optimizer uses these actual values when it encounters the same sub-plan again.

Abstract: Colors are associated with source locators such as URLs that identify sources found by a search, in order to enable a searcher to see at a glance how closely the search results match keywords that convey the searcher's intended search criteria. A browser prompts keyword entry, reads the keywords, associates colors with the keywords to form a color code, and displays a color code map that explains the color code to the searcher. The browser sends the keywords to a search engine. The search engine performs a search, and sends to the browser source locators that identify sources of interest such as web pages, along with occurrence data indicative of how often each of the keywords appears in each of the sources. For each source locator, the browser formulates a correlation indicator, which includes a visual area that is colored according to the color code and the occurrence data for occurrence of each keyword.

Abstract: A method for managing documents in a system comprising at least one electronic data processing installation for processing data by means of at least one data bank. A peripheral driver for electronic data processing installations which allows implementation of such a method. One aim is for simplifying and optimizing document management in electronic data processing systems by means of a data bank. For this purpose, document management is handled by a peripheral driver which is specific to the operating system and connected to the data bank. A improved embodiment of the invention, a data file system is provided for document management and the documents are managed by means of extended index features. The contents, of these extended index features is generated automatically or entered manually.

Abstract: A method and device for translating telecommunication network Internet Protocol addresses by using a leaky-controlled memory. In substance, a hash computer and a memory with locations for the keys (or addresses) to be stored and corresponding locations for the updating date of the key memory location are used in combination. Should a memory address (a(j)) such that KEY=K[a(j)] be not found, a memory address corresponding to an instant and/or to an updating date elder that a certain value is occupied. In the inverse translation process, the selected address (a(j)) is received and the memory is accessed updating again the time information by inserting the current instant and/or date.

Abstract: Data integration including extracting a first native record having a first native format from a first native repository through a first adapter, the first adapter loosely coupled for data integration to a data integration application, the first native format having a datatype; transforming the first native record having first native format to a first native record having dynamic common format, the dynamic common format being a subset of a dynamic common model, the dynamic common model comprising mappings to and from the dynamic common format for all native records in all datatypes; transforming the format of the first native record having dynamic common format to a first native record having second native format; and inserting through a second adapter, also loosely coupled to the application, the first native record the second native format into a second native repository.

Abstract: A system and method for developing a pharmacovigilance database from source data and reference data. The unedited source data contains verbatim terms. The method includes parsing source data into a relational safety database; performing cleanup on the relational safety database; and mapping verbatim terms from the cleaned safety database to at least one token from at least one reference source. Cleanup includes removing redundant entries, correcting misspellings, removing irrelevant non-alpha characters and noise words, and relocating dislocated terms. Mapping verbatim terms to tokens includes nominating tokens from the source data, choosing tokens from the reference sources, and linking chosen tokens to corresponding verbatim terms. In one embodiment, the history of clean-up and mapping is saved as the pedigree of the verbatim-to-token mapping.

Abstract: An enterprise business planning system includes a database having a relational data area and a transactional data area, and a server to store within the transactional data area contribution data received from a set of enterprise contributors. The server publishes the contribution data from the transactional data area to the relational data area. The transactional data area may include a set of contribution slots and a set of aggregations slots hierarchically related in accordance with an enterprise model. The relational area includes a set of related tables defined in accordance with the model. The transactional data area supports real-time interaction with the enterprise contributors, while the relational data area allows detailed statistical analysis and report generation.