Abstract: Device for measuring at least one first force (19) generated within a brake system (20) of a vehicle (9). The brake system (20) comprises at least caliper (16) and at least one brake disc (4). The at least two load pins (12, 13), connecting the caliper (16) and the vehicle (9) are arranged to measure the first force (19). A converting means (21) is arranged to convert a basic force (22) into the first force (19) to be measured.

Abstract: A first query execution plan generated for a query on a second time the query was processed by a database is compared against a dynamically generated second query plan generated based on statistics only dynamic feedback for the second time the query is processed by the database. A determination is made on the second time as to whether to cache the first query execution plan, the second query execution plan, or no plan for third or more times the query is processed by the database. The query can be non-parameterized or parameterized.

Abstract: A system for performing a medical procedure on a patient includes an articulating probe assembly and at least one tool. The articulating probe assembly comprises an inner probe comprising multiple articulating inner links, an outer probe surrounding the inner probe and comprising multiple articulating outer links, and at least two working channels that exit a distal portion of the probe assembly. The at least one tool is configured to translate through one of the at least two working channels. A feeder controls the articulating probe assembly.

Abstract: A first query execution plan generated for a query on a second time the query was processed by a database is compared against a dynamically generated second query plan generated based on statistics only dynamic feedback for the second time the query is processed by the database. A determination is made on the second time as to whether to cache the first query execution plan, the second query execution plan, or no plan for third or more times the query is processed by the database. The query can be non-parameterized or parameterized.

Abstract: Techniques for improving complex database queries are provided. A determination is made whether to adopt a static or dynamic query execution plan based on metrics. When the dynamic query execution plan is used, a request fragment of the request is planned and the corresponding plan fragment is executed. The processed fragment provides feedback related to its processing to the remaining request and the process is repeated on the remaining request until the request is completed.

Abstract: Techniques for finding a column with column partitioning are provided. Metadata for a container row is expanded to include information for searching ranges of partitioned column values. The metadata identifies offsets to specific ranges and specific columns within a specific range. The offsets also identify where compressed data for a desired column resides. Thereby, permitting partitioned columns having compressed data to be located without being decompressed and decompressed on demand as needed.

Abstract: Techniques for improving complex database queries are provided. A determination is made whether to adopt a static or dynamic query execution plan based on metrics. When the dynamic query execution plan is used, a request fragment of the request is planned and the corresponding plan fragment is executed. The processed fragment provides feedback related to its processing to the remaining request and the process is repeated on the remaining request until the request is completed.

Abstract: Techniques for finding a column with column partitioning are provided. Metadata for a container row is expanded to include information for searching ranges of partitioned column values. The metadata identifies offsets to specific ranges and specific columns within a specific range. The offsets also identify where compressed data for a desired column resides. Thereby, permitting partitioned columns having compressed data to be located without being decompressed and decompressed on demand as needed.

Abstract: A method of searching a multilevel partitioned database includes receiving a query data from the multilevel partitioned database. At least for one level partitions are dynamically included. For some levels, partitions may also be statically included for execution of the query. The query is the executed over the partitions that are both dynamically and statically included. In one example, the cost of joining two tables in a multilevel partitioned database includes determining level partitions that can be statically included, estimating level partitions that will be dynamically considered for the join, and determining a cost as a function of the estimated statically included level partitions and estimated dynamically included level partitions.

Abstract: Techniques for extending horizontal partitioning to column partitioning are provided. A database table is partitioned into custom groups of rows and custom groups of columns. Each partitioned column is managed as a series of containers representing all values appearing under the partitioned column. A logical row represents a row of the table logically indicating each column value of a row. Compression, deletion, and insertion within the containers are managed via a control header maintained with each container.

Abstract: Techniques for processing operations on column partitions of a table in a database are provided. A table includes a control column partition. Each delete container of the control column partition representing multiple rows in the table (or a row partition, if any), and each row represented by a bit flag within a bit string. Rows of the table set for deletion have their corresponding bits within a particular delete container set to indicate those rows are deleted.

Abstract: A method and apparatus of analyzing a target system comprises receiving information relating to an environment of the target system and storing cost data based on the environment information. The plan and its estimated performance for a query may be determined based on the cost data. The environment information may pertain to the environment of a parallel system (e.g., a multi-node parallel system, a single-node parallel system having plural central processing units or a system running plural virtual processors) that is running a parallel database. The cost data may identify a number of nodes in the target system, a number of central processing units in each node of the target system, and other types of system information. The cost data may be stored in a relational table having a plurality of rows. Each row of the relational table may correspond to a different target system.

Abstract: Techniques for extending database date statistics are provided. A data dictionary houses existing date statistics for information housed in a column of a database table. The existing statistics housed in the data dictionary are used to project estimated statistics for the column for a target date that is not yet represented in the data dictionary and the data dictionary is updated with the estimated statistics.

Abstract: A method of searching a multilevel partitioned database includes receiving a query data from the multilevel partitioned database. At least for one level partitions are dynamically included. For some levels, partitions may also be statically included for execution of the query. The query is the executed over the partitions that are both dynamically and statically included. In one example, the cost of joining two tables in a multilevel partitioned database includes determining level partitions that can be statically included, estimating level partitions that will be dynamically considered for the join, and determining a cost as a function of the estimated statically included level partitions and estimated dynamically included level partitions.

Abstract: Techniques for extending database date statistics are provided. A data dictionary houses existing date statistics for information housed in a column of a database table. The existing statistics housed in the data dictionary are used to project estimated statistics for the column for a target date that is not yet represented in the data dictionary and the data dictionary is updated with the estimated statistics.

Abstract: A database system extrapolates from date statistics maintained on a table in the system. In doing so, the system receives at a current date a date value in relation to which statistics are required, calculates a highest date for the date statistics, and compares the date value with the highest date. If the date value is greater than the highest date, then the system repeatedly reduces the date value by a fixed time period until the date value is less than or equal to the highest date. The system then calculates cardinality and number of unique values based on the reduced data value.

Abstract: A funeral vehicle (1) comprises a sidecar (2) in the form of a hearse having a chassis (4) carrying a wheel (6) and a superstructure (8) mounted on the chassis and defining a reception area (10) for a coffin (12).

Abstract: A method, computer program, and database system are disclosed for executing database queries. The database includes a first table (T1) having a primary key (PK) column and a first correlated value column (CV1) and a second table (T2) having a foreign key (FK) column related to the primary key column of the first table and a second correlated value column (CV2). One implementation of the method includes preparing a database query for execution based at least in part on application of a derived constraint rule (DCR) having the form, (PK=FK)?CV2+C1?CV1?CV2+C2, where C1 and C2 are constants and “?” means “implies,” to produce an execution plan. A frequency of errors due to changes in DCRs is taken into account when preparing the execution plan. The plan is then executed.

Abstract: A partition elimination system is provided for a database. The database uses a multi-level partitioning definition. The partition elimination system includes an interface for receiving data indicative of a plurality of level-specific elimination lists. Each list is respectively associated with one of the levels in the definition. A processor is responsive to the data for providing a single combined partition elimination list. Typically the level-specific elimination lists provide a minimum selection of level-specific partition pairs and the combined partition elimination list provides a minimum selection of combined partition pairs.

Abstract: A funeral vehicle (1) comprises a sidecar (2) in the form of a hearse having a chassis (4) carrying a wheel (6) and a superstructure (8) mounted on the chassis and defining a reception area (10) for a coffin (12).