Abstract: The present invention relates a database access system comprising: a plurality of database servers, each of which accommodates a database; and an application server which is connected to the above-mentioned plurality of database servers. The application server comprises a plurality of local transaction managers, each of which corresponds to each of the databases, and individually processes transactions for updating the corresponding database; and a distributed transaction manager which individually provides commands for database updating to the transaction managers.

Abstract: A method and apparatus for locating and for maintaining the locations of files within a directory tree structure. A file location request is received from a program module and a response is generated containing a file location identifying the location of one or more files within a directory tree structure. The file location request contains search criteria that identifies at least one file. If the file location of the component file has changed or has never been searched, then an attempt is made to locate the file and the new file location is returned. All file locations are stored in a file location cache so that subsequent searches can be minimized. When either the search criteria does not exist in the file location cache or the directory originally containing the sought file has been modified, the requested file location is searched for and the file location cache is updated.

Abstract: Two-way counts utilizing sparse representation of a data set. In one embodiment, a computer-implemented method such that a data set is first input. The data set has a plurality of records. Each record has at least one attribute, where each attribute has a default value. The method stores a sparse representation of each record, such that the value of an attribute of the record is stored only if it varies from the default value. A data model is then generated, utilizing the sparse representation. Generation of the data model includes initially extracting two-way counts from the sparse representation. Finally, the model is output.

Abstract: An architecture for automated data analysis. In one embodiment, a computerized system comprising an automated problem formulation layer, a first learning engine, and a second learning engine. The automated problem formulation layer receives a data set. The data set has a plurality of records, where each record has a value for each of a plurality of raw transactional variables. The layer abstracts the raw transactional variables into cooked transactional variables. The first learning engine generates a model for the cooked transactional variables, while the second learning engine generates a model for the raw transactional variables.

Abstract: A method of full-text scanning for matches in a large dictionary of keywords is described, suitable for SDI (selective dissemination of information). The method is applicable to large dictionaries (hundreds of thousands of entries) and to arbitrary byte sequences for both patterns and sample streams. The approach employs Boyer-Moore-Horspool skipping, extended to pattern collections and digrams, followed by an n-gram hash test, which also identifies a subset of feasible keywords for conventional pattern matching at each location of a putative match.

Abstract: A database access method includes receiving a data request at a switcher system from another computer, selecting a connection to a database system from among a collection of connections, and communicating with the database system across the selected connection to fulfill the data request. A computer program residing on a computer readable medium includes instructions for causing a computer to receive a data request from another computer, select a connection to a database system from among a number of connections to the database system, and communicate with the database system across the selected connection to fulfill the data request. A network of interconnected computing devices may include network elements configured by the computer program to implement the invention.