Abstract: A graphical user interface (GUI) tool is presented to a user for interacting with an underlying database. The GUI tool includes a field selection and attribute selections for the field. The user selects a field and an attribute for that field and is presented with a first list of values retrieved from the database for the selected attribute. Next, the user selects a filter for the attribute within the GUI tool and a second reduced list of values is presented to the user within the GUI tool representing the filtered first list of values acquired by applying the filter.

Abstract: A temporary computer-stored first-unit intermediate result is generated while executing a first unit of work on a computer-based database management system. The first-unit intermediate result has properties. It is determined that the properties of the first-unit intermediate result are similar to properties of a second-unit intermediate result to be generated for a second unit of work when the second unit of work is executed on the computer-based database management system. In response, the first-unit intermediate result is saved for use in executing the second unit of work.

Abstract: A method, computer program, and database system are disclosed for identifying a second source of a request sent to a database management system by a first source. A database message is received from the first source. The database message includes a second value for a second source-identifying parameter. The second value identifies a second source. The second value for the second source-identifying parameter is stored in a log.

Abstract: The present invention relates to a system for capturing a business context of a user's interaction with a website. The system has a web server containing web pages and a web log. A web log filter extracts data from the web log associated with the address associated with the business context. A data analysis creation tool is in communication with a shared configuration table in the enterprise data warehouse, wherein the data analysis creation tool has executable instructions for creating a logical data model for mapping the extracted data to the enterprise data warehouse. A method for the same is also provided.

Abstract: A spatial feature is considered for storage in a database system running on a computer. The spatial feature includes a polygon, P. The polygon includes an outer ring, OR, and the area within the outer ring. The polygon includes an interior ring contained within the polygon. The computer removes the interior ring from the polygon. The computer determines a line along which to split the polygon without regard for the location of the inner ring within the polygon. The computer splits the polygon into two polygons, SP1 and SP2, along the line. The computer applies the interior ring to the two split polygons by invoking a point set difference between the interior ring and the two split polygons. The computer stores the split polygons in the database system on the computer.

Abstract: Techniques are presented for automatic language translation and management. A master language data structure houses information in a base language and houses linkages to the information for translations in a plurality of different languages. The information and translations are created, updated, managed, and distributed from the master language data structure on demand.

Abstract: A database system is capable of processing a query and providing a progress indicator of the processing of the query based on at least a first cost factor. Initially, an estimate is set for the first cost factor. During processing of the query, the estimate of the first cost factor is updated to enable refinement of the progress indicator.

Abstract: A method, computer program, and computer network are disclosed for transferring data to a database system. The method includes preparing a plurality of input records, each including a plurality of fields and a selector configurable to represent a plurality of states. For each input record of the plurality of input records, the following steps are performed. A state represented by the selector for an input record is read. Based on the state represented by the selector, a subset of the fields for the input record is transferred to the database system.

Abstract: A computer system programmed as a database receives a query Q1. Q1 includes a predicate. The predicate includes a reference to a current timestamp of time TT1. The database has R data structures. The computer system creates a plan, Plan 1, to execute Q1. Plan 1 includes the identification of a first set of data structures, P1, to be accessed in executing Plan 1, at the current timestamp of time TT1. The number of data structures in P1 is less than R. The computer system determines that Plan 1 is valid for a period of time. The computer system stores in a cache Plan 1 and an indication that Plan 1 is valid for the period of time.

Abstract: Embodiments of the present invention provide a database system that is optimized by using hardware acceleration. The system may be implemented in several variations to accommodate a wide range of queries and database sizes. In some embodiments, the system may comprise a host system that is coupled to one or more hardware accelerator components. The host system may execute software or provide an interface for receiving queries. The host system analyzes and parses these queries into tasks. The host system may then select some of the tasks and translate them into machine code instructions, which are executed by one or more hardware accelerator components. The tasks executed by hardware accelerators are generally those tasks that may be repetitive or processing intensive. Such tasks may include, for example, indexing, searching, sorting, table scanning, record filtering, and the like.

Abstract: Techniques are presented for tracking status within object chains. Global objects are associated with unique identifiers and each dependent local object created within the context of a particular global object receives that particular global object's identifier. A unique counter value is maintained for each status type of each global object. The local object facilitates communicating changes in its status using the received global identifier, and the counter values are updated accordingly for the affected global object.

Abstract: A system, method, and computer-readable medium for optimization of query processing in a parallel processing system are provided. Skewed values and non-skewed values are treated differently to improve upon conventional DISTINCT and aggregation query processing. Skewed attribute values on which a DISTINCT selection or group by aggregation is applied are allocated entries in a hash table. In this manner, a processing module may consult the hash table to determine if a skewed attribute value has been encountered during the query processing in a manner that precludes repetitive redistribution of rows with highly skewed attribute values on which a DISTINCT selection or group by aggregation is applied.

Abstract: A system, method, and computer-readable medium for optimized processing of queries that feature maximum or minimum equality conditions are provided. A table on which the query is applied is scanned a single time. Rows of the table distributed to respective processing modules are scanned by the processing modules. Each processing module maintains identification of any rows distributed to the respective processing module that have attribute values that equal the maximum or minimum attribute value locally identified by the processing module. Subsequently, a global aggregation mechanism is invoked to compute the query result without requiring an additional rescan of the table. Further, the disclosed mechanisms may be extended to compute top N queries featuring maximum or minimum equality conditions.

Abstract: Techniques are presented for hierarchical report tool session management. A user interacts with a hierarchical reporting tool during a first session and reaches a specific nested level within the tool for a particular hierarchy being accessed by the user. At some point in time the user exits the tool (normally or abnormally). The specific nested level is maintained on behalf of the user. So, when the user initiates a second and subsequent session with the tool, the user is presented with the specific nested level when the tool is started for that subsequent session.

Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system. For example, table and column descriptors are embedded in the machine code database instructions. For ease of installation, the hardware accelerators employ a standard interconnect, such as a PCle or HT interconnect. The processing elements implement a novel dataflow design and Inter Macro-Op Communication (IMC) data structures to execute the machine code database instructions. The hardware accelerator may also comprise a relatively large memory to enhance the hardware execution of the query/operation tasks requested.

Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system. For example, table and column descriptors are embedded in the machine code database instructions. For ease of installation, the hardware accelerators employ a standard interconnect, such as a PCle or HT interconnect. The processing elements implement a novel dataflow design and Inter Macro-Op Communication (IMC) data structures to execute the machine code database instructions. The hardware accelerator may also comprise a relatively large memory to enhance the hardware execution of the query/operation tasks requested.

Abstract: A tree-structured database is collapsed into a two-column table. The two-column table includes a characteristic key value for a given leaf node in the first column and the system identification (SID) relating to the characteristic key value in the second column and also identifying the node that leads to the characteristic key value. Data is presented by coupling the characteristic key value with a transaction table. A query that is formulated in an infocube may be translated to a relational data base query, collapsed, and reformulated into an infocube result set, or vice versa.

Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system. For example, table and column descriptors are embedded in the machine code database instructions. For ease of installation, the hardware accelerators employ a standard interconnect, such as a PCle or HT interconnect. The processing elements implement a novel dataflow design and Inter Macro-Op Communication (IMC) data structures to execute the machine code database instructions. The hardware accelerator may also comprise a relatively large memory to enhance the hardware execution of the query/operation tasks requested.

Abstract: Several methods and a system for analyzing ordered data using pattern matching over an indefinitely long ordered sequence of rows in a relational database are disclosed. In one embodiment, a method of a server includes receiving an ordered data in a relational database. The method further includes matching a pattern specified in a query on ordered data in a relational database in a single pass in constant space for overlapping mode of results. The method also includes creating an output data in the single pass in constant space for overlapping mode of results based on the matching of the ordered data with the pattern in the relational database query.

Abstract: A method, apparatus, and article of manufacture for accessing data in a computer system. Compression and decompression functions are associated with a column of the table, in order to perform compression of decimal, numeric or date data stored in the column when the data is inserted or updated in the table, and in order to perform decompression of the data stored in the column when the data is retrieved from the table. The compression function compresses and stores the data in a fixed-length compressed field in the column without a length value, and the fixed-length compressed field has a size that is determined by a range of values for the data stored in the fixed-length compressed field. The decompression function retrieves and decompresses the data from the fixed-length compressed field.