Oracle International Corporation

Other

Todd Guay

Geoffrey Wilson

Jay Rossiter

Gregory P Smith

Jonathan Fredericks Soule

Vipul Manubhai Shah

Gaylen D Royal

Gregory Scott Smith

Yong Feng

Ari Wolfe Mozes

Dimitris Nakos

Yao Feng

Cheryl Mrozienski

Jonathan Riel

A table tennis assembly apparatus is provided. The table tennis assembly apparatus may provide a base substrate and an overlaying cutting substrate. Along at least one peripheral of the base substrate may be a bar panel and or one or more clamps. Each clamp is for urging a first force distributor to sandwich a table tennis blade, in a uniform manner, against a glued table tennis rubber supported by the base substrate. After a predetermined amount of time a user may swap the first force distributor for a smaller second force distributor, enabling the user to trim the table tennis rubber around the perimeter of the blade.

Table tennis assembly tool

Techniques for making aggregated entries in a database table which aggregate information from other entries in tables in the database system. The techniques permit the aggregated entries to contain not only metric values aggregated from the other entries by techniques such as averaging in which the individual values are lost, but also sets of individual values from the other entries. One area of application for the techniques is the roll up tables used in the management systems for database management systems to reduce the size of historic information about events that have occurred in the database management system. Each roll up entry in a roll up table is an aggregated entry that contains information about some number of events. A roll up entry that uses the techniques contains a representation of a set whose values are the occurrence times of the events that are represented by the rollup record. Among the techniques that can be used to represent the set of occurrence times are a comma list of the occurrence times and a bit map which has a bit for each second in a day. Roll up entries that contain such representations of sets of occurrence times may be analyzed to determine whether occurrences of events are related, and if they are, the fact of the relationship can be used to design filters that can be applied in the roll up process, in error reporting, and in the analysis of the roll up tables.

Preserving sets of information in rollup tables

A method evaluates a plurality of candidate index sets for a workload of database statements in a database system by first generating baseline statistics for each statement in the workload. An index superset is formed by combining an existing or current index set and a proposed index set. A candidate index set is derived from the index superset, the candidate index being one of the plurality of candidate index sets. Statistics for a statement are generated by first creating an execution plan which represents an efficient series of steps for executing the statement given the candidate index set. The execution plan is evaluated, and statistics based on the evaluation of the execution plan are generated and recorded. The cost of the execution plan is then determined and statistics are generated. Statistics for each candidate index set are rolled up and presented to a user or an index tuning mechanism.

Database index validation mechanism

An intelligent approach for collecting statistical information in information systems generally involves performing a set of administrative function steps within a &ldquo;maintenance window&rdquo; that is defined by one or more specified time periods. First, a set of administrative function steps to be performed are identified. The set of administrative function steps is prioritized to produce a set of prioritized administrative function steps. Then, the set of prioritized administrative function steps is performed during the maintenance window. Aspects and features of the invention include: identifying and prioritizing administrative function steps; estimated function times and maintenance window; failure prediction; environment recommendations; history information and learning techniques; saving state and context information; and user feedback.

Approach for collecting statistical information in information systems

A workload reduction mechanism for index tuning is described that selects relevant database statements from a database workload, standardizes a format of the relevant database statements and reduces the formatted, relevant database statements into a representative set of database statements. These statements may then be provided to an index tuning mechanism.

Workload reduction mechanism for index tuning

An intelligent approach for performing administrative functions generally involves performing a set of administrative function steps within a &ldquo;maintenance window&rdquo; that is defined by one or more specified time periods. First, a set of administrative function steps to be performed are identified. The set of administrative function steps is prioritized to produce a set of prioritized administrative function steps. Then, the set of prioritized administrative function steps is performed during the maintenance window. Aspects and features of the invention include: identifying and prioritizing administrative function steps; estimated function times and maintenance window; failure prediction; environment recommendations; history information and learning techniques; saving state and context information; and user feedback.

Approach for performing administrative functions in information systems

A method and apparatus for identifying one or more schemas from which a Structured Query Language (SQL) statement may have been executed is provided. According to the method, to identify schemas from which a database command may have been executed a set of object references that are included in the database command is determined. From the set of object references, one or more ambiguous object references that are contained in the set of object references are identified. A set of one or more schemas that contain objects that correspond to each of the one or more ambiguous object references is then identified. In one aspect, the step of identifying the one or more ambiguous object references includes the steps of identifying any qualified object references from the set of object references that is associated with a schema identifier that identifies a particular schema for which the qualified object reference is to execute; identifying any public synonyms from the set of object references that represents an alias that may be used in multiple schemas to identified a single object; and determining the one or more ambiguous object references by selecting from the set of object references only those object references that have not been identified as either qualified object references or public synonyms.

Method and system for removing ambiguities in a shared database command

An approach for automatically determining database tables that are best suited for index tuning involves analyzing query performance data that specifies an average amount of time required to execute a plurality of queries on the database tables. One or more particular queries are selected from the plurality of queries based upon the query performance data. Data tables required to process the one or more particular queries are selected for index tuning.

Automatically determining data that is best suited for index tuning

A method for providing persistent, dynamic external control of rule-based decision making through inherited user defined rules (UDRs) within a computer controlled relational database management system (RDBMs). Within the novel system, objects are grouped together in a parent-child hierarchy where a child has one parent and each parent can have multiple children. Each object can have one or more pre-defined ('hardcoded') rules associated with it; these hardcoded rules are executed in a sequence to arrive at parameter values which, when applied, tune the database environment. The novel system provides a mechanism for creating UDRs which are associated with a particular object and used by particular hardcoded rules which process the particular object. For a given hardcoded rule, if a processed object does not have a UDR defined within, then a search is made up the object's ancestry (e.g., its parentage) until a defined UDR is located within an ancestor object; this value is then used to modify the behavior of the hardcoded rule. The root of the object hierarchy contains defined UDRs ('base UDRs') for all hardcoded rules, so the above search is effective for all user rules. Before a hardcoded rule is executed, it automatically allows its associated UDR to customize data and/or execute a procedure. The UDRs offer a mechanism for customizing the performance tuning session based on external (user supplied) information and defining the scope of the attribute represented by the UDR from different levels of the object hierarchy.

Dynamic external control of rule-based decision making through user rule

A method for non-recursive data driven parameter evaluation within an information management system (e.g., a relational database management system, RDBMS). Parameters are attributes within an RDBMS system whose value can be modified to influence the manner in which a database environment responds. Depending on the character of the data within a database environment or the hardware resources allocated to the database, the parameter values have a large influence on the performance efficiency of the database. For instance, a parameter value may influence the memory size of certain data storage areas within a database environment and, if set too small, can cause an inefficiently large amount of input/output accesses to occur as data is moved in and out of disk storage. Also, many parameters are data dependent on other parameters. The novel system presents an automated system for evaluating parameters using a non-recursive evaluation process. By using a non-recursive approach, the evaluation process is streamlined in that only one pass yields an optimum parameter evaluation and the results are reproducible. The novel system identifies a set of parameters within an environment to be tuned, eliminates cyclic dependencies, and orders the parameters based on independence, levels of dependence, impact on system performance and common data usage. The present invention is data driven because rules within a respective parameter are then evaluated based on data availability to arrive at a set of parameter value recommendations. In one embodiment instance, tablespace, system environment, and schema parameters can be evaluated within a RDBMS tuning session.

Growing community of inventors

Nashua, NH, United States of America

Todd Guay