Abstract: Methods, program products, and systems for automatically searching data in multiple data fields are described. A user can view data retrieved from a database and formatted based on a layout. While viewing the data, the user can perform a search using one or more search terms. A system can automatically examine the database and identify on which tables and on which data fields of the tables to perform the search. The system can identify searchable tables and data fields by analyzing the database schema as well as characteristics of the tables and data fields.

Abstract: Methods, program products, and systems for automatically searching data in multiple data fields are described. A user can view data retrieved from a database and formatted based on a layout. While viewing the data, the user can perform a search using one or more search terms. A system can automatically examine the database and identify on which tables and on which data fields of the tables to perform the search. The system can identify searchable tables and data fields by analyzing the database schema as well as characteristics of the tables and data fields.

Abstract: Methods, program products, and systems for automatically searching data in multiple data fields are described. A user can view data retrieved from a database and formatted based on a layout. While viewing the data, the user can perform a search using one or more search terms. A system can automatically examine the database and identify on which tables and on which data fields of the tables to perform the search. The system can identify searchable tables and data fields by analyzing the database schema as well as characteristics of the tables and data fields.

Abstract: A system, method, and a computer program product for caching multi-dimensional data based on an assumption of locality of reference. A user sends a query for data. A described compilation module converts the query into a set of cubelet addresses and canonical addresses. In the described embodiment, if the data corresponding to the cubelet address is found in a data cache, the data cache returns the cubelet, which may contain the requested data and data for “nearby” cells. The data corresponding to the canonical addresses is extracted from the returned cubelet. If the data is not found in a data cache, a fault handler queries a back-end database for the cubelet identified by the cubelet address. This cubelet includes the requested data and data for “nearby” cells. The requested data and the data for “nearby cells” are in the form of values of measure attributes and associated canonical addresses.

Abstract: A system and method for answering a relational database query is presented. According to an embodiment of the present invention, a database query is received. It is then determined whether that query can be rewritten in such a manner as to be able to utilize a precomputed view, such that an answer to the rewritten query is equivalent to an answer to the original query. If the query can be rewritten, it is determined whether the rewritten query can more efficiently derive the answer than the original query. The query which has the most efficiently derived answer is the query which is utilized to derive that answer.

Abstract: Server-integrated methods and apparatus for processing precomputed views for answering user queries on a database are described. In accordance with one embodiment, a system for answering user queries on a database stored on a server includes a query processing system integrated into the server and configured to respond to user queries, and a query processing system integrated into the server and configured to process precomputed results of user queries on the database. In another aspect, a method of answering user queries on a database stored on a server includes responding to user queries received at the server, and processing, at the server, precomputed results of user queries on the database.

Abstract: Methods and apparatus for processing precomputed views for answering user queries on a database are described. In accordance with one aspect, a user database query on precomputation strategy effectiveness is responded to by defining, based upon user database query history, an analysis space consisting of a subset of all possible views for the database, and by characterizing the views in the analysis space. In accordance with a second aspect, a structure is imposed on an analysis space consisting of a subset of all possible views for the database based upon the capabilities of a query rewriting facility, and the views in the analysis space are characterized. In accordance with a third aspect, an analysis space consisting of a subset of all possible views for the database is defined, and a cost formula is applied to the analysis space based upon a user-defined subset of the data contained in the database.

Abstract: The invention features methods and apparatus for processing precomputed views for answering user queries on a database. In accordance with one aspect, a user query on the database is analyzed, and a candidate view based upon the user query is generated.

Abstract: A system, method, and a computer program product for caching multi-dimensional data based on an assumption of locality of reference. A user sends a query for data. A described compilation module converts the query into a set of cubelet addresses and canonical addresses. In the described embodiment, if the data corresponding to the cubelet address is found in a data cache, the data cache returns the cubelet, which may contain the requested data and data for “nearby” cells. The data corresponding to the canonical addresses is extracted from the returned cubelet. If the data is not found in a data cache, a fault handler queries a back-end database for the cubelet identified by the cubelet address. This cubelet includes the requested data and data for “nearby” cells. The requested data and the data for “nearby cells” are in the form of values of measure attributes and associated canonical addresses.

Abstract: Server-integrated methods and apparatus for processing precomputed views for answering user queries on a database are described. In accordance with one embodiment, a system for answering user queries on a database stored on a server includes a query processing system integrated into the server and configured to respond to user queries, and a query processing system integrated into the server and configured to process precomputed results of user queries on the database. In another aspect, a method of answering user queries on a database stored on a server includes responding to user queries received at the server, and processing, at the server, precomputed results of user queries on the database.

Abstract: A system and a method maintain a precomputed view corresponding to detail data in a database server by: determining a maintenance plan to refresh the precomputed view when detail data is changed; integrating the maintenance plan with a query execution plan in the database server; and executing the query execution plan.

Abstract: Hybrid target indexes are employed for skewed data set domains. Such hybrid indexes contain multiple value representations within a given index. The representations can be optimized for particular keys in highly skewed data set domains. For example, a hybrid target index on customer states might employ a bitmap to represent the index value for a California key and also employ, in the same index, an uncompressed list of row-IDs to represent the index value for a Delaware key.

Abstract: Methods and apparatus for processing precomputed views for answering user queries on a database are described. In accordance with one aspect, a user database query on precomputation strategy effectiveness is responded to by defining, based upon user database query history, an analysis space consisting of a subset of all possible views for the database, and by characterizing the views in the analysis space. In accordance with a second aspect, a structure is imposed on an analysis space consisting of a subset of all possible views for the database based upon the capabilities of a query rewriting facility, and the views in the analysis space are characterized. In accordance with a third aspect, an analysis space consisting of a subset of all possible views for the database is defined, and a cost formula is applied to the analysis space based upon a user-defined subset of the data contained in the database.

Abstract: A system and method for answering a relational database query is presented. According to an embodiment of the present invention, a database query is received. It is then determined whether that query can be rewritten in such a manner as to be able to utilize a precomputed view, such that an answer to the rewritten query is equivalent to an answer to the original query. If the query can be rewritten, it is determined whether the rewritten query can more efficiently derive the answer than the original query. The query which has the most efficiently derived answer is the query which is utilized to derive that answer.