Abstract: A method, apparatus and program product to optimize a database query. A query plan is generated for the database query where the query plan includes first and second subplans. Cached optimization data associated with the first subplan and generated during evaluation of another query plan for a previous query that uses the first subplan is retrieved. The first subplan is evaluated for resource cost using the retrieved optimization data. The second subplan is also evaluated for resource cost. The query plan is then evaluated for resource cost based upon the evaluations of resource cost for the first and second subplans. A query plan is selected based on evaluations of resource cost and the plan is executed to generate a result set.

Abstract: Methods, systems, and computer program products for dynamically adjusting computer resources, as appropriate, in response to predictions of query runtimes as well as for rendering costs of the computer resources actually utilized, which costs are consistent with consumer demands.

Abstract: A system, method, and computer readable medium for optimizing throughput of a stream processing system are disclosed. The method comprises analyzing a set of input streams and creating, based on the analyzing, an input profile for at least one input stream in the set of input streams. The input profile comprises at least a set of processing requirements associated with the input stream. The method also comprises generating a search space, based on an initial configuration, comprising a plurality of configurations associated with the input stream. A configuration in the plurality of configurations is identified that increases throughput more than the other configurations in the plurality of configurations based on at least one of the input profile and system resources.

Abstract: Methods for using task-related information to enhance digital searching are provided. A task-oriented user activity system maintains task-related information about resources accessed by a user and current user task. This task-related information is used to include task-related metadata in search engine index, e.g., by storing the metadata in the index or by storing it in resources which are subsequently indexed. Task-related information can also be used to enhance search results by filtering and ranking results to increase relevance with respect to a user's current task and/or to enhance search queries to include task-related search criteria.

Abstract: A semantic publish-subscribe system, including: a plurality of subscribers; a plurality of publishers; and a server that receives and stores subscriptions that are described in web ontology language (OWL) graph patterns from the plurality of subscribers and that receives events that are described in semantic graphs formed by OWL assertions from the plurality of publishers, wherein when the server receives an event from a publisher, the server expands the OWL assertions of the event using a reasoner to produce an expanded event, the server matches the expanded event to a subscription, and then, the server notifies a subscriber whose interest matches the event.

Abstract: A search engine is operated to handle a plurality of queries. In particular, in response to each of the plurality of queries presented to the search engine, the search engine provides an indication of at least one document responsive to that query. An indication is determined of an amount of resources of the search engine to handle a subset of the plurality of queries. Based on the determined indication, the search engine is selected to operate in one of a synchronous mode and an asynchronous mode, and the search engine is operated in accordance with the selected mode.

Abstract: A system, method, and computer-readable medium that facilitate workload management in a computer system are provided. A workload's system resource consumption is adjusted against a target consumption level thereby facilitating maintenance of the consumption to the target consumption within an averaging interval by dynamically controlling workload concurrency levels. System resource consumption is compensated during periods of over or under-consumption by adjusting workload consumption to a larger averaging interval. Further, mechanisms for limiting, or banding, dynamic concurrency adjustments to disallow workload starvation or unconstrained usage at any time are provided.

Abstract: Embodiments of the invention provide a method of optimizing a query, including determining an execution plan for use in executing the query, based on a monetary cost of the energy needed to execute the query. A query optimization component may determine a plurality of execution plans for the query. The query optimization component may then select one of the plans to use in executing the query based on the monetary cost calculated for the plan.

Abstract: Systems, methods, and other embodiments associated with providing query modes for translation-enabled XML documents are described. One method embodiment includes receiving an XPath query to an XML document that may store a translation for a data element. The method embodiment may also include automatically selecting a query mode for the XPath query. The method embodiment may also include querying the XML document using the XPath query and the selected query mode. The query mode may control, at least in part, the operation of an XML database logic.

Abstract: Standard word lists that are often used for such operations as predictive text, spell checking, and word completion are based on general linguistic data that might not accurately reflect actual text usage patterns of particular users. Systems and methods of building and using a custom word list for use in text operations on an electronic device are provided. A collection of text items associated with a user of the electronic device is scanned to identify words in the text items. A weighting is then assigned to each identified word, and the words and corresponding weightings are stored.

Abstract: An acquiring unit acquires from each of a plurality of database servers processing capacity information for a query received from a client. A generating unit generates a first code indicating a first processing and a second code indicating a second processing for the query. A first transmitting unit transmits the first code to the database servers. An executing unit executes the second processing by using first result data of XML data acquired by executing the first processing from the database servers. A second transmitting unit transmits second result data of XML data acquired by executing the second processing to the client.

Abstract: A query facility for database queries saves and re-uses query execution strategies, and automatically detects that a strategy should be re-optimized as a result of changes to an indexed variable value. Preferably, the number of records evaluated and selected by the index value condition is dynamically monitored during execution, and an alternative query strategy is initiated when this number appears to be out of proportion to expectations. In an exemplary embodiment, an indexed search strategy is changed to a table scan strategy (or vice versa) as a result of a change to the number of records eliminated by the indexed value, although other examples are possible. Preferably, the query engine initiates an alternative search strategy and concurrently continues to execute the original search strategy as separate threads. Search results are obtained from whichever thread completes first.

Abstract: A project management system includes a database formed of one or more tables and a computing device having one or more modules configured to: receive data and an identifier of the data, store the data in one or more tables of the database based upon the data identifier, in which the one or more tables in the database are accessible by a database management tool, and produce one or more records corresponding to the data stored in the one or more tables, in which the one or more records are accessible by a project management tool.

Abstract: Provided is a computer system including: a computer running as a DB server; a storage system including a plurality of disk drives for storing data; and a management module, in which: at least one of the plurality of disk drives stores data of a DB schema written by the computer; the management module specifies the DB schema to be accessed based on a received query, transmits, to the storage system, an instruction to copy at least a portion of the data of the specified DB schema from the disk drive to a memory, and transmits, to the storage system, an instruction to control an rpm of the disk drive that stores the data of the specified DB schema; and the storage system controls the rpm of the disk drive based on the instruction. Accordingly, power consumption of the storage system can be reduced even if installed disks increase in number.

Abstract: According to one embodiment, a storage device includes an interface, a first and second memory blocks and a controller. The interface receives a content search request. The first memory block stores files and inverted files corresponding to contents included in the files. The second memory block stores a file search table. The controller creates the inverted file for each content included in the files and stores IDs of the files including the content in the inverted file. The controller obtains, by search of the content, a corresponding inverted file from the inverted files stored in the first memory block and stores, in the file search table, the IDs of the files included in the obtained inverted file. The controller outputs the IDs of the files stored in the file search table from the interface as a search result for the content search request.

Abstract: A method and system for migrating source data from one or more databases to a destination database, wherein the destination database is selected based on power consumption of the destination database. A data migration server determines which destination database should be selected by selecting a number of candidates and comparing the power consumed, the available space and the maximum monthly power consumption limit. A user intervention policy is created to evaluate which data should be moved to a destination database. A “payback period” is calculated to determine the amount of time that will elapse before savings are realized.

Abstract: In one embodiment, access one or more query chains, wherein each one of the query chains comprises two or more search queries, {q1, . . . , qn}, which are recency-sensitive, are related to the same subject matter, and are issued to a search engine sequentially, and actual click-through information associated with each one of the query chains; and smooth each one of the query chains using the actual click-through information associated with the query chain. To smooth one of the query chains comprises, for each one of search queries, qj, in the query chain, where 2?j?n, if one of the network resources identified for qj has actually been clicked in connection with qj by the corresponding one network user, then presume that the one network resource has been clicked in connection with one or more search queries, qk, in the query chain, where 1?k<j.

Abstract: Systems, methodologies, media, and other embodiments associated with supporting queries with hard time constraints are described. One exemplary system embodiment includes logic for accepting a query having a hard time constraint. The example system may also include logic for selectively rewriting the query having the hard time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the hard time constraint. The example system may also include logic for establishing a timer(s) associated with the rewritten query.

Abstract: Embodiments of the invention provide techniques for aggregating database queries for energy efficiency. In one embodiment, queries received by a DBMS are aggregated and staged according to hard-disk drives required for query execution. Each group of queries accessing a given drive may be dispatched for execution together. Further, the queries received by a DBMS may be matched to patterns of previously received queries. The matching patterns may be used to predict other queries which are likely to be received by the DBMS. The received queries may be staged to be dispatched with the predicted queries. By aggregating queries to be executed, access to each hard-disk drive may be optimized, thus reducing the overall energy consumption required for executing the queries.

Abstract: In one implementation, a method is provided for increasing relevance of database search results. The method includes receiving a subject query string and determining a trained edit distance between the subject query string and a candidate string using trained cost factors derived from a training set of labeled query transformations. A trained cost factor includes a conditional probability for mutations in labeled non-relevant query transformations and a conditional probability for mutations in labeled relevant query transformations. The candidate string is evaluated the for selection based on the trained edit distance. In some implementations, the cost factors may take into account the context of a mutation. As such, in some implementations multi-dimensional matrices are utilized which include the trained cost factors.

Abstract: Search in stocks of data, particularly on optical media, is intended to be optimized in terms of the time required for the search. It is therefore proposed that the search be carried out in two steps. In a first search step, the entire database is scanned on the disk storage medium. In a second search step, executed in parallel, intermediate results from the first search step are searched. This allows the number of skips on a disk to be reduced, which results in increases of speed, particularly in the case of optical drives.

Abstract: A resource allocation system for a database environment. In a specific embodiment, the resource allocation system is adapted to implement a method that includes receiving a first signal from a user input device to identify a SQL SELECT statement to be used in a future database query. The system receives a second signal from the user input device to determine a resource to be used when the SELECT statement is executed. The system then stores, in a storage device, an indication of the resource in association with the SELECT statement so that when the SELECT statement is executed the resource is used.

Abstract: Extraction of data employing a sequence of remote function calls in form of a synchronous multi-batch call chain is provided. Sequencing of calls is enabled by generating parameters associated with the extraction of a next batch of data. The parameterized, dynamic generation of queries allows for optimization of memory utilization by batching result sets and data conversion. Each subsequent call retrieves a packet of data, picking up where the previous call left off without an overlap. Parameters are updated after each call based on extracted data, available memory, and the like.

Abstract: A system may include a routines repository that is configured to store and maintain hardware libraries, software libraries and metadata, a hybrid query engine that may be configured to receive a query, parse the query, compute a query execution plan and output the query execution plan using metadata and operators from the hardware libraries and/or the software libraries, and a routines management module that may be configured to provide the metadata and the operators from the routines repository to the hybrid query engine. The system may include an execution engine module that may be configured to receive the query execution plan, the execution engine module including a reconfigurable hardware execution engine having a reconfigurable fabric, where the reconfigurable hardware execution engine may be configured to process the query execution plan.

Abstract: Exemplary systems and methods for server management are provided. An exemplary system comprises a plurality of servers, with each server having the ability to access a database or, in some embodiments, be configured to perform a calculation, computation or make a determination of a particular value, values or other information. A communications network delivers queries to each server whereby a look-up table directs query processing by the servers. Further embodiments of the system feature a program logic controller for rebalancing the workload of the network servers. Exemplary methods of processing queries on the system comprise submitting a query to the network, communicating the query to each server in the network and each server looking-up on a look-up table the processing responsibilities of the servers in the network. The query is processed by the server having primary responsibility for processing the query while other the servers monitor query processing.

Abstract: Method and apparatus for searching a storage system for confidential data is described. One aspect of the invention relates to searching a computer for confidential data related to user. User information comprising the confidential data is obtained from a digital identity for the user. A rule that provides a secure representation of the user information is generated. A storage system in the computer is searched using the rule to detect one or more instances of the user information within at least one file.

Abstract: Embodiments of the invention provide techniques for aggregating database queries for energy efficiency. In one embodiment, queries received by a DBMS are aggregated and staged according to hard-disk drives required for query execution. Each group of queries accessing a given drive may be dispatched for execution together. Further, the queries received by a DBMS may be matched to patterns of previously received queries. The matching patterns may be used to predict other queries which are likely to be received by the DBMS. The received queries may be staged to be dispatched with the predicted queries. By aggregating queries to be executed, access to each hard-disk drive may be optimized, thus reducing the overall energy consumption required for executing the queries.

Abstract: Techniques are provided for use in accordance with relates to computing utilities. For example, in one aspect of the invention, a method for use in a computing utility, wherein the computing utility comprises a plurality of application service provider systems and a utility controller, and each application service provider system comprising an application controller, comprises the following steps. An application request to one of the plurality of application service provider systems is obtained. Then, in response to the application request, at least one of: (i) the application controller of the application service provider system to which the application request is directed computes a value of a business metric associated with a resource action; and (ii) the utility controller computes a value of a business metric associated with a resource action.

Abstract: Systems, methodologies, media, and other embodiments associated with supporting queries with soft time constraints are described. One exemplary system embodiment includes logic for accepting a query having a soft time constraint. The example system may also include logic for rewriting the query having the soft time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the soft time constraint.

Abstract: Techniques are described herein for pricing access to data using contribution analysis. A user may issue a query to a store that stores data. The store may analyze a subset of the data to determine a result that is to be provided to the user in response to the query. The subset is referred to as contribution data. A data access price calculator performs a contribution analysis to determine a price to be charged to the user to access the result. The contribution analysis takes into consideration a number of rows and/or columns of data in the contribution data, a number of rows and/or columns of data in the result, functions used during the store's analysis of the contribution data, or a combination thereof. The data access price calculator may derive such information from an indicator that is received from the store and/or to some extent from the result itself.

Abstract: A computer-implemented method, system and computer product including a scheduling manager residing in memory; whereby the scheduling manager dynamically manages access of additional computer resources to be applied to work items of a program based on their valuations relative to the processing costs thereof.

Abstract: Techniques for optimizing database queries for energy efficiency. A query optimizer is configured to compare energy requirements of query plans, and to select a query plan requiring minimal energy to execute. The query optimizer may also compare time performance of the query plans, and may select a query plan by matching to a user preference for a relative priority between energy requirements and time performance.

Abstract: Systems and methods that generate specialized plans for compiling SQL queries. A plan generator component scans the query representation for parameter sensitive predicates and evaluates each predicate individually based on the parameter values. Accordingly, queries can be identified not only based on their structures, but also based on their parameter conditions. The specialized plans are more efficient for particular values, wherein queries that employ such values are optimally executed.

Abstract: In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The database server receives a query that specifies one or more parameters. A query optimizer generates a plurality of execution plans for evaluating the query. The query optimizer estimates a plurality of total costs respectively associated with the plurality of execution plans, where estimating a particular total cost associated with a particular execution plan comprises: invoking the one or more functions with one or more function arguments based on the one or more parameters; receiving one or more index costs that are associated with using the one or more auxiliary properties of the user-defined index to evaluate the query; and determining the particular total cost based on the one or more index costs.

Abstract: A query access plan for executing a database query is dynamically selected from among multiple alternative query access plans based on the availability of computer resources allocated for running the query. Preferably, a first query access plan is generated based on resources then available, and if it is possible to provide additional resources, one or more alternative plans are generated based on the additional resources. If an alternative plan is significantly better than the original plan based on a comparison of query related parameters, the alternative is chosen for executing the query. Additional resources for running the query may be provided from logically partitioned and/or grid environments.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for tuning query execution performance in a database management system are described. In an aspect, query optimization in a database management system (DBMS) with awareness of limited resource usage includes identifying limited resource usage for each possible plan being considered for query execution by a query engine. A determination of whether any possible plan has limited resource usage that does not exceed a threshold level is made, and when at least one possible plan does not exceed the threshold level, the identified limited resource usage is included as a consideration during plan selection by the query engine. In an embodiment, temporary database usage is identified for each possible plan.

Abstract: A method, system, and computer program product are provided for operating a relational database management system (RDBMS). In order to operate a RDBMS, information is read from a first execution plan in response to an execution request for a second individual database statement of a second sequence of database statements. The information is processed and pool resource requirements for execution of further individual database statements of the second sequence of database statements are evaluated. A preparation request is sent for pool modification based on the evaluated pool resource requirements to an asynchronous pool preparation queue. Then the second individual database statement of the second sequence of database statements is executed. The information indicative of the progression of execution of the second individual database statement is stored in a position register.

Abstract: A method and system for migrating source data from a source database to a destination database based on energy efficiency and conservation. A migration server evaluates the source data for usage and requirements and defines data usage and requirement tags for the source data. The source data is disaggregated into one or more source data sets based on the data usage and requirement tags. The migration server then identifies candidate destinations for the source data, wherein each candidate destination has stored data identified with usage and requirement tags. The data migration server compares the first usage and requirement tags of the source data with the second usage and requirement tags of the stored data and identifies an optimal destination database based on the comparing step. The data migration server migrates the source data to the optimal destination database.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for tuning query execution performance in a database management system are described. In an aspect, query optimization in a database management system (DBMS) with memory I/O (input/output) awareness includes determining compensated physical I/O (PIO) values indicative of memory I/O operations, including an approximate cache occupancy level, of an executing query in a DBMS, and utilizing the compensated PIO values as feedback to a query optimizer of the DBMS for optimization of future query execution.

Abstract: Whether a change in workload of a database system has occurred can be determined. Investigative queries are formulated. Each investigative query is adapted to test a different resource or a different combination of resources of the database system. The investigative queries are run when the database system is in an unloaded state to acquire unloaded performance metrics. The investigative queries are run when the database system is in a loaded state to acquire loaded performance metrics. Whether executing a current workload of the database system, using a current configuration of the database system, will likely result in a problem developing at a later point in time can also be determined. Simultaneously with actual execution of the current workload on the database system using the current configuration, a simulation of execution of the current workload using the current configuration is performed. The simulation is performed more quickly than the actual execution.

Abstract: In a method for estimating a static execution time of a database query, a prediction of query runtime tree is built from historical query information. A database query is received. The prediction of query runtime tree is used to estimate the static execution time of the database query.

Abstract: A portion of data records of a full input data set are imported into memory of a computer system for processing by an executing application. The full input data set includes data records of a dimensionally-modeled fact collection. An amount of the data of the full input set to import is determined based on an amount of available memory of the computer system. The sampling characteristics for sampling the full input data set are determined based on the amount of the data that can be imported and on characteristics of the full input data set and application involved. The full input data set is then sampled and a portion of the records are imported into the memory of the computer system for processing. The sampling characteristics are determined such that analysis as a result of processing by the executing application of the sampled portion of the records imported is representative of the analysis that could otherwise be carried out on the full input data set, with a calculable statistical relevance.

Abstract: A computer-implemented method, system and article of manufacture for managing workloads in a computer system, comprising monitoring system conditions and operating environment events that impact on the operation of the computer system, regulating execution of one or more queries based on the monitored system conditions and operating environment events using arrival rate throttles, and performing the queries to access data in a database for presentation and use to a user.

Abstract: A large OLAP cube includes data and dimensions not required for a particular query, or for a collection of queries. A response to a query is generated by using the large OLAP cube rather than using an OLAP cube tailored to the query, and rather than querying the relational database directly. The large OLAP cube may be created after identifying a set of frequently sought data and/or filters used in queries to the relational database. Data may be staged by creating a smaller OLAP cube with data extracted from the large OLAP cube. The cubes may then be queried, browsed, and used to prepare reports or generate flat files.

Abstract: The present invention generally relates to data processing, and more specifically to executing a query against a partitioned database. The query may be executed against each partition of a database to retrieve results from each partition. The results from the partitions may be integrated to provide the results of the query. Each partition may take different amounts of time to retrieve results for the query. Embodiments of the invention allow adjusting the execution of the query for faster executing partitions to allow execution of other tasks, thereby increasing query throughput.

Abstract: An apparatus and method retrieves a database record from an in-memory database of a parallel computer system using a unique key. The parallel computer system performs a simultaneous search on each node of the computer system using the unique key and then utilizes a global combining network to combine the results from the searches of each node to efficiently and quickly search the entire database.

Abstract: Techniques are provided for efficiently evaluating XML queries that conform to an extension of an XML language (e.g., XQuery or XPath). The extension allows XML queries to have full-text search capabilities. Such an XML query is compiled to generate a tree of nodes that correspond to one or more conditions in the full-text portion of the query. In one technique, the amount of memory for the execution state of the tree is determined at compile time and allocated only once throughout execution of the query. In another technique, to ensure at most a single scan of a document, all the words or phrases in the full-text portion of an XML query are located before any of the other conditions in the full-text portion are evaluated. In another technique, the elements of the full-text portion of an XML query are analyzed to determine, based at least in part on cost, which evaluation strategy, of a plurality of evaluation strategies, should be employed.

Abstract: An enterprise business intelligence system includes a data access service that provides consistent availability of functionality for querying multidimensional data sources regardless of the capabilities of the underlying data sources. The data access service disassembles a multidimensional query into execution units, and may optimize the multidimensional query such that individual execution units may be executed locally or remotely to achieve increase computational efficiently.

Abstract: A method and mechanism for performing improved frequent itemset operations is provided. A set of item groups are divided into a plurality of subsets. Each item group is composed of a set of data items. Possible combinations of data items that may frequently appear together in the same item group are referred to as candidate combinations. Candidate combinations comprising a first set of data items are identified, and thereafter the occurrence of each candidate combination in any item group in each subset is counted by comparing item bitmaps, associated with items in the candidate combination, in each subset in turn. The comparison of item bitmaps is performed in volatile memory. A total frequent itemset count that describes the frequency of candidate combinations in items groups across all subsets is obtained. Thereafter, the total frequent itemset count for candidate combinations having a larger number of data items may be determined.

Abstract: A database query optimizer for a computer system having dynamically configurable logical partitions generates an optimized query strategy which is dependent on a logical partition configuration. When the query is executed, the configuration of the logical partition in which the query is executed is compared to the logical partition configuration for which the query was optimized. If the configurations are different, a new query can be automatically generated. Optimizing database queries to the current system configuration of a dynamic, logically partitioned system potentially offers greater efficiency in the execution of database queries for complex, logically partitioned systems.