Abstract: Systems, methods, and computer media are described for index-based join size estimation. For a join operation between two tables, a filter is applied to the first table, resulting in a filter output. The filter output is then sampled. For each sample, an index for a second table is accessed and counts of records in the second table that match the sample are retrieved. Using the sample size and the retrieved counts from the index of the second table, a data size for the join operation can be efficiently and accurately estimated. Statistical confidence in the estimate can also be assessed using variance-based calculations.

Abstract: Methods and systems are disclosed for data retrieval, from databases to clients, in an environment requiring runtime authorization. In response to a request for T data records, a learning module provides a prediction R of a suitable number of data records to retrieve from a database. Following retrieval of R records or record identifiers, authorization is sought from an authorization service, resulting in A of the records being authorized. The A authorized records are returned to the requesting client, and, if more records are needed, T is decremented and the cycle is repeated. A performance notification is provided to the learning module for training, with respect to providing values of prediction R. The performance notification can be based on a measure of authorization service performance, the number A of authorized records, latency, communication or resource costs, a measure of resource congestion, or other parameters. Variants are disclosed.

Abstract: A system, method, and computer-readable medium for proving feedback on database instructions, identifying, for example, existing patterns and providing suggested replacement instructions. This may have the effect of improving the efficiency of instructions used to create and/or manipulate databases. According to some aspects, these and other benefits may be achieved by parsing received instructions into an organizational structure, traversing the organizational structure for known patterns, and suggesting replacement patterns. In implementation, this may be effected by receiving one or more sets of known patterns and corresponding replacement patterns, parsing received instructions, comparing the known patterns with the parsed instructions, and providing suggested replacement patterns based on one or more known patterns matching the parsed instructions. A benefit of may include reducing Cartesian products during the merging of tables.

Abstract: Resource provisioning systems and methods are described. In an embodiment, a system includes a plurality of shared storage devices collectively storing database data, an execution platform, and a compute service manager. The compute service manager is configured to determine a task to be executed in response to a trigger event and determine a query plan for executing the task, wherein the query plan comprises a plurality of discrete subtasks. The compute service manager is further configured to assign the plurality of discrete subtasks to one or more nodes of a plurality of nodes of the execution platform, determine whether execution of the task is complete, and in response to determining the execution of the task is complete, store a record in the plurality of shared storage devices indicating the task was completed.

Abstract: Techniques are described herein for using user-defined aggregate functions for updating inverted index tables. A user-defined aggregate function is registered in a database system for updating an index table based on changes stored in a staging table. A query specifying the user-defined aggregate function may be executed in parallel to parallelize the updating of the index table.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include receiving a request to fabricate, for a database including multiple tables, a respective target number of data records for each of the tables, and receiving one or more intra-database rules for the multiple tables. Examples of the intra-database rules include cross-record rules and cross-table rules. Upon identifying one or more referential integrity constraints for the multiple tables, the respective target number of data records for each of the multiple tables are fabricated in response to the request. In embodiments of the present invention, the fabricated data records comply with the one or more referential integrity constraints and the one or more intra-database rules.

Abstract: The subject disclosure relates to techniques for providing data experience(s) via disparate semantic annotations based on a respective user scenario. An annotation component can synthesize semantic information for respective data types of data set(s), associate the semantic information with the respective data types to obtain respective data annotations, and in response to receiving a query from a client, send at least a portion of the respective data annotations to the client. Further, a data aggregation component can aggregate the respective data annotations and at least a portion of the data set(s). Other embodiments relate to performing, via an application, operations utilizing a data type based on respective semantic annotations associated with the data type. Yet other embodiments relate to receiving external data annotation(s) and associating the external data annotation(s) with portion(s) of the respective data types to derive portion(s) of the respective semantic annotations.

Abstract: An interface module for a local application provides a user interface to solicit user input for an configuring invocation. The user input solicited by the user interface includes a name of an external query to be executed and an input variable name for the external query. The interface module receives the user input for the configuring invocation; stores the invocation; and receives a trigger, with an input value for the external query, to launch the invocation. In response to receiving the trigger, the interface module executes the invocation to provide, to another interface module for a remote application, a request to execute the external query. The interface module receives, from the other interface module, an output value for the external query and process the output value.

Abstract: Systems, methods, devices, and media are described to facilitate the training and employing of a three-class classifier for post-execution search query reformulation. In some embodiments, the classification is trained through a supervised learning process, based on a training set of queries mined from a query log. Query reformulation candidates are determined for each query in the training set, and searches are performed using each reformulation candidate and the un-reformulated training query. The resulting documents lists are analyzed to determine ranking and topic drift features, and to calculate a quality classification. The features and classification for each reformulation candidate are used to train the classifier in an offline mode. In some embodiments, the classifier is employed in an online mode to dynamically perform query reformulation on user-submitted queries.

Abstract: A task management system may be configured to select and/or perform one or more tasks. The task management system may be configured to create weighted groups of tasks to be performed in response to various triggering conditions. The task management system may include a value generation module, which may be configured to generate values used to select tasks from two or more of the weighted groups of tasks.

Abstract: A system and method is disclosed for determining intervals of a space filling curve in a query box. The method includes the operation of providing a range query-box contained within a data set, wherein the data set has a plurality of elements in N dimensions. A space filling curve is applied to the data set. The space filling curve contacts each of the elements in the N dimensions. The space filling curve is also applied to a range-query box contained within the data set. An entry point of the space filling curve into the query box is determined. A first endpoint box is formed to cover an hquad of the space filling curve at the entry point that includes P×P elements, with a first value of P selected as one. The value of P is increased to expand the endpoint box around a next larger hquad of the space filling curve, until a size of the endpoint box is maximized without exiting the range-query box. The interval of the space filling curve in the endpoint box can then be determined.

Abstract: There is provided a computer-implemented method of executing a query. An exemplary method comprises optimizing the query. The query may specify multiple operations on corresponding multiple column sets of a table in a database. The exemplary method further comprises partitioning data of the table based on the operations within a single pass of the table. Additionally, the exemplary method comprises performing the operations on the partitioned data in parallel.

Abstract: A method of generating a query lineage is provided. The method includes, performing on a processor, evaluating at least one of query tree information and operations performed on a query tree, where the query tree includes one or more nodes; identifying a lineage rule based on the at least one of query tree information and operations; and generating a lineage of the query tree based on the lineage rule.

Abstract: Apparatus, systems, and methods may operate to receive an original query plan, to transform the original query plan into an equivalent executable compact query plan, and to store the compact query plan on a machine readable device. Further activities may include computing maximal source sub-queries associated with the compact query plan, and computing semi-join reductions of the maximal source sub-queries to provide an executable derivative query plan, which may also be stored on a machine readable device. Additional apparatus, systems, and methods are disclosed.

Abstract: A method, computer program product, and system for executing and administering queries in a data management system, and particularly a relational data management system. Logical objects can be queried by providing a translation from a logical query in a pre-defined logical schema to a physical query against the physical data management system, such as by translating a database query constructed using an Object Query Language (OQL) into a query in Structured Query Language (SQL) without the user needing to know the details of the physical data management system such as the structure of the underlying relational databases.

Abstract: Methods, systems, and computer-readable media are disclosed for partitioned query execution in event processing systems. A particular method includes receiving a plurality of events via an input stream. The plurality of events is partitioned into one or more groups, and a query application module is instantiated for each of the one or more groups based on a compiled query application plan. Each particular query application module for a particular group is configured to apply a query to events of the particular group to generate partial results. The method includes merging the partial results of each of the query application modules to generate merged output results and providing the output results to an output stream.

Abstract: There is provided a computer-implemented method of aggregating data. An exemplary method comprises receiving an aggregation scheme and generating numerous first aggregations by aggregating data at a first level of granularity. The data may be associated with a time and stored in a first table. Further, generating the numerous first aggregations may be based on the time and the aggregation scheme. The exemplary method further comprises generating a second aggregation by aggregating the first aggregations at a second level of granularity based on the aggregation scheme. The second level of granularity may comprise the first level of granularity.

Abstract: There is provided a computer-implemented method of optimizing a query. An exemplary method comprises receiving a first query configured to generate a result set. The query may comprise an operation for an outer table, a first predicate, and a second predicate. The second predicate may comprise a subquery correlated to the operation. Additionally, the first predicate and the second predicate may be disjunctive. The exemplary method also comprises generating a first query tree representing the first query, and generating a second query tree representing a second query. The second query may be configured to generate the result set, and may not comprise the subquery. The exemplary method additionally comprises generating a query plan based on the second query tree.

Abstract: A method, system and computer program product is disclosed for intelligent data mining. The method comprises receiving an event from an application, assigning property weights to properties of the event, and building a query from these properties based on the property weights. The method further comprises assigning search engine weights to a group of search engines, selecting at least some of the search engines based on the search engine weights, and sending the built query to the selected search engines. Results from the selected search engines are stored in a knowledge repository and used to adjust the property weights and the search engine weights. The invention may be used to provide an analysis with information about a problem, and to manage a solutions database which can be used for problem determination. The invention provides a low cost solution for collecting relevant information from online sources.

Abstract: An auditing system receives a set of audit rules from a database administrator, which define a search criteria used to identify a database object that is desired to be audited. The auditing system uses the audit rules to search through a database to identify a corresponding set of database objects that satisfy at least one of the set of audit rules. Then, the system generates audit commands that configure a database management system to audit the identified set of database objects.

Abstract: Described is the presenting of suggested queries for web pages that are not search engine results pages, based upon the URL and/or content of a currently displayed page. The suggested query set may be dynamically extracted (locally or remotely) based upon the content of the web page, and/or obtained from a data store of per-URL suggested query sets, e.g., generated from historical logs. Also described are various techniques for generating suggested queries, and user interface mechanisms that display and allow interaction with suggested queries.

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: Described is a technology for automatically generating labeled training data for training a classifier based upon implicit information associated with the data. For example, whether a query has commercial intent can be classified based upon whether the query was submitted at a commercial website's search portal, as logged in a toolbar log. Positive candidate query-related data is extracted from the toolbar log based upon the associated implicit information. A click log is processed to obtain negative query-related data. The labeled training data is automatically generated by separating at least some of the positive candidate query data from the remaining positive candidate query data based upon the negative query data. The labeled training data may be used to train a classifier, such as to classify an online search query as having a certain type of intent or not.

Abstract: There is provided a computer-implemented method of optimizing a query. An exemplary method comprises receiving a first request from an optimizer that specifies a table, a first predicate and a first sample size, wherein the optimizer is optimizing a relational query language statement that specifies the table and the first predicate. The exemplary method also comprises generating a sample table, comprising a first subset of rows from the table, based on the request. The exemplary method also comprises selecting a second subset of rows from the sample table based on the predicate. The exemplary method additionally comprises sending a count of rows in the second subset to the optimizer.

Abstract: A method assigns importance ranks to documents within repositories or databases, such as any database of documents such as books or other printed material, electronic documentation, and pages within the world-wide web. The method uses a corpus of indexed documents that has been annotated to the terms of one or more ontologies in order to assign a semantic similarity score to queries based on terms taken from the ontologies. A statistical model is used to test the significance of matches between query terms and documents or categories. The method results in an acceleration of over 10,000-fold for realistic queries and ontologies, and makes it practicable to calculate P-values dynamically or to keep database annotations and the related P-value distributions up to date by frequent recalculation.

Abstract: A programming model for a query service (e.g., web) that supports defining query builders which are bound dynamically at runtime to parameter values. Moreover, the programming model can be used to customize the query execution, for example, by adding pre-processing, post-processing, or dynamic binding to queries (e.g., selecting the query to be executed dynamically at runtime). As a consequence, generalized and parameterized queries can be used (with different runtime values for parameters) in different scenarios.

Abstract: A system and method for intent driven search presentation. A system and method for intent driven search presentation. A query is received, over a network, from a user, wherein the query comprises at least one query token. The query is analyzed wherein at least one query keyword is identified in the query. The query is classified wherein the query is classified into at least one intent using query keywords. A plurality of data objects that match query keywords is identified. The data objects are ranked, wherein at least one intent is assigned to at least some of the data objects. A result is built using the ranked plurality of data objects, wherein the result comprises display entries wherein if a data object has been assigned at least one intent, such intent is used to construct the display entry for the respective data object. The result is transmitted over the network to the user.

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: A database query is submitted to a first query optimizer to receive a first query plan from the first query optimizer. The first query plan is set as a current query plan. As an entry point, the current query plan is executed against the database within a given environment of the database. Where execution of the current query plan within the given environment is problematic, the execution of the current query plan is prematurely terminated, and the database query is submitted to a second query optimizer. Where a second query plan that is different than any previous query plan for the database query has been received from the second query optimizer, the second query plan is set as the current query plan, and a risk to the database in executing the current query plan is determined. Where the risk is less than a threshold, the entry point is proceeded to.

Abstract: Computer-readable media and methods to provide a toolbar application are described. The toolbar application receives indicators for determining when a context-specific search is executed. The toolbar application monitors uniform resource locator (URL) addresses to which a browser navigates for the inclusion of an indicator. Upon identifying an indicator in a URL the toolbar application presents filters that are associated with the indicator in a toolbar user interface. A user's selection of one or more of the filters is received at the toolbar user interface and the corresponding filters are applied to the context-specific search results by modifying the identified URL with a modifier associated with a selected filter and causing the browser or search engine to re-execute the search query with the selected filters applied. The filtered search results are presented to the user. The toolbar user interface is modified to indicate the application of the selected filters.

Abstract: A user's search experience may be enhanced by providing additional content based upon an understanding of the user's intent. Query tagging, the assigning of semantic labels to terms within a query, is one technique that may be utilized to determine the context of a user's search query. Accordingly, as provided herein, a query tagging model may be updated using one or more stratified lexicons. A list data structure (e.g., lists of phrases obtained from web pages) and seed distribution data (e.g., pre-labeled probability data) may be used by a graph learning technique to obtain an expanded set of phrases and their respective probabilities of corresponding with particular lexicons (e.g., semantic class lexicons). The expanded set of phrases may be used to group phrases into stratified lexicons. The stratified lexicons may be used as features for updating and/or executing the query tagging model.

Abstract: The claimed subject matter provides a system and/or a method that facilitates generating sorted search results for a query. An interface component can receive a query in a first language. A first ranker can be trained from a portion of data related to a second language. A second ranker can correspond to the first language, wherein the second ranker is untrained due to a limited amount of data related to the first language. A sorting component can invoke the first ranker to generate and order a pre-defined number of search results for the received query and subsequently invoke the second ranker to the pre-defined number of search results to generate a re-ordered number of search results in the first language for the received query.

Abstract: The present invention provides a method and system for conducting a profile based search. The method and system includes receiving a search request including one or more search terms from a user, parsing the search request into categorical verticals, determining search refinement data relative to the categorical verticals, the search refinement data including at least one of: profile information, environmental data relative to the search request and historical behavior data relating to the search request or the user and accessing a database of aggregated search data based on the search refinement data. The method and system includes using the aggregated search data, determining a most relevant search query and a most relevant user profile, refining the search request based on the most relevant search query and most relevant user profile and generating an output display of a search result set based on the refined search request.

Abstract: Methods, systems, and computer-readable storage media are disclosed for providing a search results output tool. According to an illustrative embodiment, a method receives one or more search results generated by a search engine in response to a user query of a network information source. Each of the search results is associated with one or more properties. The properties associated with each of the search results are stored. The user is prompted to select one or more selected search results. The user is also prompted to select one or more selected properties. A record is generated for each of the selected search results that include the one or more selected properties. The record for each of the selected search results is then output.

Abstract: A flexible query hints system and method for discovering and expressing query hints in a database management system. Embodiments of the flexible query hints system and method include a power hints (Phints) language that enables the specification of constraints to influence a query optimizer. Phints expressions are defined as tree patterns annotated with constraints. Embodiments of the flexible query hints system and method also include techniques to incorporate the power hints language expressions into an extended query optimizer. Theses techniques include computing a directed acyclic graph for Phints expression, deriving candidate matches using the Phints expression and the graph, computing candidate matches, and extracting a revised execution plan having a lowest cost and satisfying constraints of the Phints expression. Embodiments of the flexible query hints system and method include a flexible query hint user interface that allow users to interactively adjust query hints.

Abstract: A computer determines whether an original query expressed in an initial query language includes clauses unsupported by a target query language. If so, the computer separates the original query into a client-side query and one or more server-side queries. The computer then determines whether the client-side query is efficient. If so, the computer translates the one or more server-side queries into one or more supplemental queries expressed in the target query language and receives server-side result sets for the supplemental queries. The computer generates a client-side result set by querying the server-side result sets using the client-side query. The computer returns the client-side result set as a result set of the original query. If the client-side query is not efficient, the computer returns an error message. Thus, by identifying inefficient queries, the computer effectively controls (i.e., throttles) the amount of work performed by the computer to process queries.

Abstract: In one example, information may be stored in a relational database. The information in the database may define a graph, in the sense that the information may define a set of entities and relations between the entities. A user may want to query the information using a graph-based query language. A graph query engine may receive the query, and may convert the query into a relational query language, for execution by the relational database. The relational database may calculate views of the underlying tables. Each view corresponds to a particular relation, and the rows in each view are pairs of entities to which the relation applies. Since the views correspond very closely to the specification of a graph, the graph-based query may be translated into a relational query that performs relational algebraic operations on the views in order to answer the graph-based query.

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: Provided is a database system in which sorting of query results is sped up. The database system stores storage location information in which storage locations of the pieces of data are recorded in a given order. When there is no second task, which is executed based on data that is fetched in a first task, whether every piece of data requested in a third task, which is executed before the first task, has been fetched is determined. In the case where every piece of data requested in the third task has been fetched, data fetched in the first task is output. In the case where some of the data requested in the third task has not been fetched, data fetched in the first task is kept in a temporary buffer until every piece of data requested in the third task is fetched, and then output.

Abstract: A system for assisting a user in determining a cause of a manufacturing non-conformance situation in a manufacturing application. The system may include an associative memory subsystem that is populated with a plurality of entity types, with each entity type including at least one entity, to form an associative memory. A user input device enables a user to input manufacturing non-conformance information into the associative memory subsystem that causes the associative memory subsystem to perform an initial search. The initial search generates a plurality of the entities that has a primary relevance useful for investigating the manufacturing non-conformance situation. An output device is responsive to the associative memory subsystem presents the plurality of entities found during the initial search to the user.

Abstract: Computer-implemented and associated operating methods evaluate robustness of a query plan by measuring performance with regard to a range of runtime conditions and producing a map of relative performance of the given query plan when compared with alternative plans for a range of conditions. The computer-implemented system comprises logic that evaluates the selected query plan in comparison to multiple alternative query plans in a predetermined range of runtime conditions that include data characteristics. The logic produces a set of performance measurements and analyzes the measured performance to map performance of the selected query plan in comparison to performance of one or more alternative query plans.

Abstract: Computer-implemented systems and associated operating methods create and use an operator map to identify and evaluate database query plan robustness landmarks. The computer-implemented system comprises logic that creates a map evaluating performance of an implementation of a database engine operator during execution under actual operating conditions. The logic measures and maps performance for a selected range of runtime conditions including resource availability and data characteristics.

Abstract: Computer-implemented systems and associated operating methods use atomic query maps to identify and evaluate database query plan robustness landmarks. The computer-implemented system comprises logic that evaluates robustness of a selected atomic query by measuring performance of atomic query execution in a predetermined range of runtime conditions that include data characteristics. The logic produces a set of measurements that can be displayed as one or more performance maps and analyzes the measured performance to identify landmarks indicative of database atomic query performance degradation greater than a predetermined amount.

Abstract: Methods, systems, and computer programs for executing a query having a first and second query value; in a database having at least two composite indexes, where the first index covers a first and second column and the second index covers the second column and a third column. Methods can include executing a query over the first and third columns, by using the first query values to probe the first index to obtain all related second column values, and using the obtained column values to probe the second index for all third column values which satisfy the second query value. A temporary composite index over the first and third columns for the query values can be created. A temporary composite index can be created for a query which was unexpected.

Abstract: An approach is described for using a query expressed in a source language to retrieve information expressed in a target language. The approach uses a translation dictionary to convert terms in the query from the source language to appropriate terms in the target language. The approach determines viable transliterations for out-of-vocabulary (OOV) query terms by retrieving a body of information based on an in-vocabulary component of the query, and then mining the body of information to identify the viable transliterations for the OOV query terms. The approach then adds the viable transliterations to the translation dictionary. The retrieval, mining, and adding operations can be repeated one or more or times.

Abstract: Systems and methods are provided that programmatically provide a user interface for forming a query, comprising. A query builder displays a first row of query criteria, a second row of query criteria, the second row being logically connected to the first row by a first Boolean connector, and a third row of query criteria, the third row being logically connected to the second row by a second Boolean connector. In response to a user drag-and-drop operation, the query builder nests the third row of query criteria in the second row of query criteria. Thus, a drag-and-drop operation obviates the need for cumbersome groups of parentheses when defining the order of operation of the query.

Abstract: A textual search index is used to identify data objects that have numerical properties that satisfy search queries. As described herein, a search index contains search index entries, each of which specifies a reference string and a set of data object identifiers. When an original search query is received, the search query is transformed into a transformed search query such that numerical comparison query elements in the original search query are transformed into equivalent textual comparison query elements. The search index is then used to identify ones of the data objects that satisfy the transformed search query. A list of the identified data objects may then be provided in response to the original search query.

Abstract: A computerized system and method of constructing and expanding search queries for conducting searches through information sources. The system enables retrieving a category options tree, allowing a user to define a category route by selecting a category-node, which defines a search-category. The system may further enable retrieving a query scenario tree, having a hierarchal structure comprising query nodes, where the retrieved query scenario tree is associated with an initial input query, inputted by a user. Each query node defines a query route enabling to construct the content and structure of an expanded search query. The system enables selecting a query node of the retrieved query scenario tree, according to an online decision making process, which analyses the search-category in relation to available query routes in to allow selecting a query node from the retrieved scenario tree that is most compatible with the search-category.

Abstract: Searching and exploration using a data-driven analytics model. The analytics model includes an analytical modeling component that defines analytical relationships between model variables using a number of analytical relations. In response to a search request, the output variable(s) of the solve operation are identified. The output variable(s) may have even been identified based on the search request. The analytical relations of the model may then be used to solve for the identified output variable(s). The resulting value(s) for the now solved-for output variable(s) may then be used to formulate the response to the search request. The nature of the response may vary depending on the scope of the application that embodied the search request capability. The results of the search request may be used for further exploration of the model by, for example, submitting follow-up search requests, resulting in follow-up solve operations.

Abstract: Some aspects include determination of a data structure including a plurality of query language configuration parameters and at least two values associated with each of the plurality of query language configuration parameters, and generation, based on the data structure, of a first structured language query associated with a first value associated with one of the plurality of query language configuration parameters, and a second structured language query associated with a second value associated with the one of the plurality of query language configuration parameters.