For real-time delivery of optimal vehicle price data, an application host receives a request for optimal price data for a specific vehicle displayed on the dealer website. When the response exists in the application cache, the application host, returns the response including the optimal price data for the specific vehicle to the browser for display on the dealer website. To calculate the optimal price data, the application host determines whether meta data for the specific vehicle matches parameter values in one or more pricing rules. If so, the application host identifies the pricing rule that has the highest number of parameter values. The optimal price data for the specific vehicle is then calculated by applying the formula in this pricing rule.

Cache optimization for data preparation includes: generating a data traversal program that represents a result of a set of sequenced data preparation operations performed on one or more sets of data, wherein the data traversal program indicates how to assemble one or more affected columns in the one or more sets of data to derive the result; in response to receiving a specification of the set of sequenced operations to be performed on the one or more sets of data, accessing the data traversal program that represents the result or a stored copy of the data traversal program that represents the result; assembling the one or more affected columns in the one or more sets of data according to the data traversal program to re-generate the result; and outputting the result.

Methods, systems, apparatuses, and computer-readable storage mediums described herein are directed to dynamic memory allocation for query execution. A memory grant engine is configured to analyze query runtime execution statistics of instances of a query to detect whether memory allocation operations performed for the query in accordance with a first memory allocation policy (e.g., a last used grant-based policy) changes across executions of that query. Upon detecting such a pattern, the engine dynamically switches to utilizing a second memory allocation policy, such as a percentile-grant based policy. In accordance with such a policy, the engine determines an amount of memory space to be allocated for subsequent instances of the query based on an analysis of query runtime execution statistics of previous instances of the query. The determined amount of memory space is configured to satisfy a predetermined percentile value of the previous instances of the query.

A database engine includes one or more computing devices, each having one or more processors and memory. The memory stores programs configured for execution by the processors. The database engine receives a database query from a client, and parses the database query to build a query operator tree. The query operator tree includes a plurality of query operators. The database engine performs one or more optimization passes on the query operator tree, including a deduplication optimization pass, to form an optimized execution plan. The deduplication optimization pass includes determining that a first query operator is equivalent to a second query operator during a traversal of the query operator tree, and replacing the second query operator with a link to reuse results from the first query operator. The database engine executes the optimized execution plan to retrieve a result set from the database and returns the result set to the client.

A method for performing multi-caching on data sources of a same type and different types by using a cluster-based processing system is provided. The method includes steps of: a big data cluster management device (a) determining whether a result set, corresponding to a query result, is present as first cache data in master or worker nodes, (b) if specific part of the result set is absent, (i) establishing an execution plan (ii) acquiring a first subset in the master or the worker nodes, (iii) acquiring a second subset in none of the master and the worker nodes, and (iv) applying joint operation thereto, and (c) applying data processing operation and output operation thereto thus acquiring the result set as the query result.

Techniques for associating a selected search result, for a current query, with a recently executed prior query are disclosed. The system receives a first query from a user and presents a first set of search results. The system receives a second query from the user, subsequent to presenting the first set of search results, and presents a second set of search results. The system determines that a user selects a particular search result from the second set of search results. The system determines an association between the first query and the second query. Responsive to determining that the user selected the particular search result and the association between the first query and the second query, the system associates the particular search result with the first query. Subsequently, the system receives a new request for execution of the first query and, in response, presents at least the particular search result.

A method enables federated search of a plurality of heterogeneous external data sources from a data analytics tool. With a mapping of one or more identified data connectors, a client search call, as formulated in a first data model, is translated to one or more external search calls formulated in one or more alternate data models of the heterogeneous external data sources. With the mappings of the one or more identified connectors, each response to the one or more external search calls is reformulated from the one or more alternate data models to the first data model to yield one or more client search result objects. The client search result objects are merged to a data warehouse. The client search call, as formulated in the first data model, is executed against the data warehouse. Results of the executed client search call are sent to the data analytics tool.

In general, the invention relates to a method for servicing query requests in distributed systems. The method includes making a first determination by a query node that it is associated with a dataspace, making a second determination that data associated with a first input sub-region is not present on the query node, where the first input sub-region is associated with the dataspace. Based on the first determination and the second determination, the method includes obtaining data for the entire dataspace from persistent storage, associating at least a portion of the obtained data with the first input sub-region to obtain a populated first input sub-region, and servicing a query request using the populated first input sub-region.

Described are methods, systems and computer readable media for providing a current row position query language construct and array processing query language constructs and associated processing.

There is provided a computer-implemented method of providing a set of alternative search results, the method including the steps of: (i) receiving a search request; (ii) searching a database to provide a first set of a plurality of search results, each search result including a plurality of attributes; (iii) identifying a best search result as the initially highlighted result; (iv) providing the highlighted search result for display; (v) receiving a selection of an attribute in the highlighted search result; (vi) providing the set of alternative search results, in which the selected attribute is varied with respect to the highlighted search result, and (vii) providing the set of alternative search results for display. Related computer program products, servers and systems are also provided.