A method and apparatus for processing count queries in a database system is provided. The database server determines whether it is possible for the target data specified in a count query to contain null values. If the target data cannot contain null values, the count query is converted into a count star query. Count star queries are executed by counting the number of records that store the target data without actually reading and evaluating the target data. If an index for the table that stores ...

System and methods are described for efficient storage and processing of non-uniform data records. An exemplary embodiment includes a Databank system having a Database Engine, a Database Engine API (Application Program Interface), a Databank Engine, a Databank Engine Class Interface, and a Databank (storage). The Databank storage itself comprises a Descriptor Table (Form Definition) and a Data Repository. The Descriptor Table comprises a plurality of field descriptors for characterizing user inf...

A method and apparatus for processing reports is disclosed. After receiving a current report request, a duplicate job detection (DJD) key is generated based upon the current report request. The DJD key is then compared to DJD keys associated with previous report requests to determine whether the currently requested report has been previously requested. If the currently requested report has been previously requested, then a saved report generated in response to the previous report request is retr...

A method and apparatus for processing reports is disclosed. After receiving a current report request, a duplicate job detection (DJD) key is generated based upon the current report request. The DJD key is then compared to DJD keys associated with previous report requests to determine whether the currently requested report has been previously requested. If the currently requested report has been previously requested, then a saved report generated in response to the previous report request is retr...

Method and apparatus for optimizing the processing of join queries based on join cardinality. Embodiments implement the methods in query optimizers in relational database management systems. A good join order for a multiple join query is found with a metric that compares the relative merits of candidate join orders as a whole. Embodiments estimate the join selectivity of foreign key--foreign key joins, where both participating tables are foreign keys with respect to a primary or unique key of on...

An information associating apparatus comprising a query extraction unit which compiles for at least each search user the queries that were used in a past predetermined time interval taken from data comprising queries used in order to search for information from a database; a preprocessing unit which calculates the parameters necessary for calculating the association degree between key words included in queries extracted for each search user by said query extraction unit, and an association degre...

A computer implemented method performs constrained searching of an index of a database. The information of the database is stored as a plurality of records. A unique location is assigned to each indexable portion of information of the database. Index entries are written to a memory where each index entry includes a word entry representing a unique indexable portion of information, and one or more location entries for each occurrence of the unique indexable portion information. The index entries ...

Evaluation of workspace-local queries on a repository that supports versioning is enabled by tracking which versions of resources that are stored in the repository are associated with particular workspaces. A mapping is created and maintained for each workspace and each workspace-enabled table, i.e., a repository table that supports multiple versions of resources in the table. The mapping, such as a bit vector, is indexed by resource identifier. A set bit indicates that a particular resource ver...

Reducing memory and/or storage requirements of a repository in a resource variable value save and retrieve operation implemented in computer hardware and/or software is accomplished by minimizing the number of repository entries saved by creating and saving repository entries only for resource variables that have non-normal values, and by discarding repository entries when the values of the resource variables corresponding to those entries have returned to the normal value. The number of reposit...

Example embodiments improve the lookup times and modification costs of indexing on a dynamically sorted list by using a combination of data structures to determine index values for secondary keys and vice versa. More specifically, exemplary embodiments provide a combination of a binary tree (e.g., a balanced binary tree) with a lookup table (e.g., linear dynamic hash table) to provide scalable retrieval of entries by either an array index or a secondary key. For example, given a key, a hash ther...