Abstract: A data processing device includes: a recording unit (21) that records, as a history of a plan tree of each issued query, an execution result of the plan tree, a history of specific information for specifying each node of the plan tree, and an appearance frequency at which the plan tree has appeared in the past; and a cache reuse unit (25) that obtains specific information corresponding to an execution plan being executed, to refer to the history of the plan tree by using the obtained specific information as a key, and reuses the execution result of the plan tree of the obtained specific information when the obtained specific information exists.

Abstract: A method receives data from a data source. The method generates a plurality of generalizations of the data. The method sends the plurality of generalizations of the data to a plurality of execution nodes, wherein each of the plurality of execution nodes includes computational resources to compute a candidate generalization using an information loss scoring function. The method receives a candidate generalization from each of the plurality of execution nodes. The method selects a preferred generalization from the plurality of candidate generalizations. The method generates an anonymized view of the data set using the preferred generalization.

Abstract: Generating an anonymized view for a data set is described. An example method can include receiving data from a data set, wherein the data is organized in a plurality of columns. The method may also include generating a plurality of generalizations of the data. The method may also further include selecting a generalization from the plurality of generalizations using an information loss scoring function based on at least a generalization information loss. Additionally, the method may also include generating an anonymized view of the data set from the selected generalization.

Abstract: A system and method is described that automatically collects health information from multiple health data provider sources, combines it into a database, then provides a view of the information on a body map. The body map can be a drawing, photograph, or other visual model, and can be changed over time as the patient advances in age. While the image may change over time, the system continues to plot the information in the correct body location.

Abstract: Generating an anonymized view for a data set is described. An example method can include receiving data from a data set, wherein the data is organized in a plurality of columns. The method may also include generating a plurality of generalizations of the data. The method may also further include selecting a generalization from the plurality of generalizations using an information loss scoring function based on at least a generalization information loss. Additionally, the method may also include generating an anonymized view of the data set from the selected generalization.

Abstract: Encoding and/or decoding of messages. On the encoding end, a composite encoder encodes message from an internal format that is used by internal system components into an external format. However, the composite encoder may encode the outgoing messages into different external formats on a per-message basis. For incoming message, a composite decoder decodes incoming messages from any one of a plurality of external formats into the internal format also on a per-message basis. A per-message report mechanism permits internal system components and the encoding/decoding components to communicate information regarding the encoding or decoding on a per message basis. XML messages can be converted automatically into Binary messages.

Abstract: The present invention extends to methods, systems, and computer program products for formulating global statistics for parallel databases. In general, embodiments of the invention merge (combine) information in multiple compute node level histograms to create a global histogram for a table that is distributed across a number of compute nodes. Merging can include aligning histogram step boundaries across the compute node histograms. Merging can include aggregating histogram step-level information, such as, for example, equality rows and average range rows (or alternately equality rows, range rows, and distinct range rows), across the compute node histograms into a single global step. Merging can account for distinct values that do not appear at one or more compute nodes as well as distinct values that are counted at multiple compute nodes. A resulting global histogram can be coalesced to reduce the step count.

Abstract: A system and method for improved processing of an SQL query made against a relational database is disclosed. In one example embodiment, the method includes parsing the SQL query, received against the relational database, to obtain each operator and associated one or more operands and sequence of execution of the operators. Further, it is determined whether all needed closure-friendly operators exist. Furthermore, any available closure-friendly operators are obtained from a pattern repository if all needed closure-friendly operators do not exist. In addition, remaining or all non-available closure-friendly operators are dynamically generated. Moreover, the available closure-friendly operators and the dynamically generated closure-friendly operators are grouped into one or more patterns and impact of each pattern on a queried relational database and a database schema is classified. Also, the SQL query is executed using the one or more patterns based on sequence of the execution of the operators.

Abstract: A system, computer-implemented method, and computer-program product embodiments for generating an access plan. A query optimizer includes an enumeration method which enumerates a plurality of subsets of a query. Each subset in the query has a plurality of partitions. The partitions of each subset are enumerated into enumerated partitions using at least one thread. For each partition, physical access plans are generated, using at least one thread. Physical access plans are generated in parallel with other physical access plans of different partitions and with other enumerating partitions. The number of threads that perform the enumeration and the generation is dynamically adapted according to a pool of threads available during the enumeration of the partitions and the generation of physical access plans, and a complexity of the query. From the generated physical access plans, a final access plan for the query is determined by choosing the most efficient access plan.

Abstract: A system may include reception of a selection of a set of one or more elements of a data visualization, the set associated with a measure and each of the one or more elements associated with a value of the measure for a respective combination of one or more dimension members, reception of an instruction to create a second set of one or more elements associated with a calculated measure, where a value of the calculated measure for a respective combination is based on two values of the measure for the respective combination, and where a first value of the two values of the measure is associated with a first time and a second value of the two values of the measure is associated with a second time, and automatic generation of a query to produce the value of the calculated measure for each of the combinations

Abstract: A system, method, and computer readable medium are provided for reducing response time variation in a workload management system for a database system. When a query response is generated in response to a database query from a client, a determination may be made as to whether response time of the query response is less than a predetermined amount of time. Delivery of the query response to the client is delayed when an amount of time associated with the query response is less than the predetermined amount of time.

Abstract: A processor-implemented method, system, and/or computer program product optimizes a search for data from documents. A processor receives an instruction to perform an initial map/reduce search for a specific set of data in documents from a first database. A synthetic event, which is a non-executable descriptor of the specific set of data in documents from the first database, is generated, and a revised map/reduce search for the synthetic event in a second database is conducted. The processor then returns a solution for the revised map/reduce search.

Abstract: A database system comprises a processing module, and a storage device communicatively coupled with the processing module and allocated thereto. The storage device stores a base table allocated to the processing module. The processing module receives a database query from a client computer system, and generates a spool based upon a number of columns of a table, and partitions at least one column of the spool based upon the database query received from the client computer system.

Abstract: The approaches described herein provide an efficient way to process certain kinds of queries that update XML data stored in an object-relational database. A query may include an XML query expression that conforms to a language for querying XML documents. A technique first determines whether the query contains an XML updating expression, and in response rewrites the query to comprise one or more path-based query operators that specify operations for updating XML data. The query may then be further rewritten to comprise one or more storage format specific query operators based on the particular database storage format associated with the XML data specified in the query. The rewritten query operators are used to generate a query execution plan that provides for several query execution optimizations.

Abstract: Various embodiments of systems and methods for retrieving open purchase orders using an optimized search tool are described herein. The method involves rendering a set of search parameters on a graphical UI of a computer. In an aspect, the method further includes receiving data relating to at least a first search parameter of the set of search parameters. Further, the method includes determining that data relating to at least a second search parameter of the set of search parameters is unavailable and determining the data relating to the at least second search parameter based on extrapolating the data relating to the at least first search parameter. In an aspect, the method involves performing a search based on the data relating to the at least first search parameter and the at least second search parameter. Based on the performed search, one or more open purchase orders are retrieved for further processing.

Abstract: A batched shortest path problem, such as a one-to-many problem, is solved on a graph by using a preprocessing phase, a target selection phase, and then, in a query phase, computing the distances from a given source in the graph with a linear sweep over all the vertices. Contraction hierarchies may be used in the preprocessing phase and in the query phase. Optimizations may include reordering the vertices in advance to exploit locality and using parallelism.

Abstract: A query pipeline for an enterprise search system is configurable by a user of the system. A user may create rules for custom query transformation and parallel query generation, federation of queries, mixing of results and application of display layouts to the received search results. A user interface (UI) assists a user in configuring the search pipeline. For example, a user may enter condition action rules for queries that affect how a query is transformed, how parallel queries are generated, how queries are federated, how search results are ranked and displayed, how rules are ordered and the like.

Abstract: The subject technology provides configurations for receiving a query for data stored across data systems in which the query is associated with a user. It is determined if the user has permission to execute an operation from the query at a data in which the operation is executed upon at least one table provided by the data system. The subject technology determines if the operation corresponds to a cache object in a cache registry if the user has permission. Each cache object is owned by a cache manager user. A view associated with the user is created that provides temporary access privileges to the cache object corresponding to the operation in which the cache object includes results of the operation executed in the query and the cache object is owned by the cache manager user. The results of the operation are then provided in the created view to the user.

Abstract: Methods, computer systems, and computer-readable media for accelerating a learning-to-rank algorithm using a central processing unit (CPU) and a graphics processing unit (GPU) are provided. The GPU processes document pairs created by the CPU in parallel to generate a lambda-gradient value and a weight for each document. The CPU builds a regression tree for the documents. The GPU is utilized to accelerate this process by constructing histograms of feature values, wherein the address of bins collecting the same feature value are shifted during the construction of the histogram. The output of the regression tree is a score for each document which is used to rank or order the document on a search engine results page.

Abstract: A system for generating field values of mortgage forms. The system includes a database, a calculation module, a monitoring module. The database contains jurisdictional tax and fee information used to calculate field values for the mortgage form. The calculation module is configured to calculate field values for the mortgage form and to generate a transaction log for mortgage and related transactions. The monitoring module communicates with the database and identifies when changes in the field values of tax and fee information occur in the transaction log, and report those changes to the affected lender.

Abstract: A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Abstract: In one embodiment, a method comprises receiving from a user interface, by a computing device, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on one or more entities of an ad hoc geospatial directory accessible by the computing device, the lambda functions having strongly typed definitions according to a prescribed symbol manipulation language that is a non-Turing complete language, that does not permit partial functions, and that is independent of any attribute of any computing system; optimizing execution by the computing device of the operation on the ad hoc geospatial directory; and the computing device returning to the user interface a response to the request based on the optimizing execution of the operation, the response including a data structure including at least one of the lambda functions for a corresponding at least one of generating a query of the ad hoc geospatial directory, mod

Abstract: Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification.

Abstract: Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification.

Abstract: Systems and methods for determining the availability of resources, such as Internet advertising opportunities, are described herein. A query may be received to determine eligible resource inventory for a set of attributes and attribute values received in the query. The query may overlap with inventory that protected, and thus is desired to not be covered by the query. Accordingly, the query may be modified to include additional attributes and attribute values, or to include one or more inventory protection tags, to prevent the query from overlapping with the protected inventory. Furthermore, advertisement campaigns may be modified in a similar manner to prevent protected inventory from matching the advertisement campaigns. Still further, individual inventory items may be annotated with tags to prevent the inventory items from being associated with protected inventory defined by tags.

Abstract: A computer-implemented method includes calculating first statistics about a user-identified event within a first subset of a database of events; selecting a second subset of the database of events based on said first statistics; calculating second statistics about the user-identified event within the second subset of the database of events; merging the first and second statistics as statistics of the user-identified event within the entire database of events; and generating a result including at least a portion of the merged statistics of the user-identified event.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for analyzing and enhancing query plans. In one aspect, a method includes receiving a query plan, automatically identifying, by one or more computers, one or more operations included within the query plan that may degrade the performance of a query, and providing a report that identifies the identified operations as performance degrading operations.

Abstract: One example discloses a database management system that can comprise a memory for storing computer executable instructions and a processing unit for accessing the memory and executing the computer executable instructions. The computer executable instructions can comprise a compiler to amortize the execution resource cost of searching a search space corresponding to a received query over a plurality of searches.

Abstract: In an embodiment, a first driver source specified by a first execution plan that implements a query is designated, and a second driver source specified by a second execution plan that implements the query is designated. A portion of the first execution plan and a portion of the second execution plan are executed. If a unique identifier of a first row returned by the executing the portion of the first execution plan does not match all unique identifiers of all rows from the second driver source that were saved to a result set by the executing the portion of the second execution plan, then the first row returned by the executing the portion of the first execution plan is added to the result set and the unique identifier of the first row that was returned by the executing the portion of the first execution plan is added to a unique identifier log.

Abstract: Methods and systems for auditing queries using query differentials are disclosed. A method includes identifying a set of queries, determining if results of each query of the set of queries are different from results of respective differentials of each query of the set of queries, and based on the determining, making a characterization of each query of the set of queries as one of safe and unsafe. Access is provided to the characterization of each query of the set of queries.

Abstract: A supervised technique uses relevance judgments to train a dependency parser such that it approximately optimizes Normalized Discounted Cumulative Gain (NDCG) in information retrieval. A weighted tree edit distance between the parse tree for a query and the parse tree for a document is added to a ranking function, where the edit distance weights are parameters from the parser. Using parser parameters in the ranking function enables approximate optimization of the parser's parameters for NDCG by adding some constraints to the objective function.

Abstract: A method of analyzing an expression to infer output data properties, comprises storing, in a storage device, a root node “e” in R, in which “e” is an expression and R is a root node of an abstract syntax tree (AST) of the expression “e”, storing a number of child nodes of R into C1, . . . Cn, with a processor coupled to the storage device, calling analyze(Ci), storing output properties of expression C into Pi I, and determining if any of the child nodes Ci in {C1 . . . Cn} has not been analyzed, in which if the last child node has been analyzed, with the processor, calling compute-output-properties(R, P1, . . . Pn), storing, in the storage device, the result in Poutput, and returning Poutput as the output properties of the expression “e.

Abstract: Various embodiments of systems and methods for query optimization based on reporting specifications are described herein. A plurality of data provider objects are categorized into one or more used data provider objects that are used in a report at a first instance and one or more unused data provider objects that are not used in the report at the first instance. The plurality of data provider objects is part of a query. A modified query is then created by excluding the unused data provider objects. Data of the used data provider objects is retrieved and stored in a local data source using the modified query. The unused data provider objects are displayed such that they are differentiated from the used data provider objects and can be selected for use in the report at the second instance.

Abstract: A system and method for navigating items includes computing an importance of a plurality of items. The importance is compared to one of a threshold or other items. Upon encountering a next item, a determination to skip the item or stop on the item is made based upon a comparison of the importance.

Abstract: A method, apparatus, and program product is provided to, in response to receiving a first database query for which usage of shared weight indices is prohibited, determine whether a shared weight index associated with a column of a database table referenced by the first database query can be utilized as a non-shared weight index to optimize the database query. The method, apparatus, and program product determine whether the column includes at least one changed weight value and determines whether the database query references at least one changed weight value in the column. The shared weight index is utilized to optimize the first database query in response to determining that the shared weight index can be utilized as a non-shared weight index to optimize the first database query.

Abstract: A system and method of compiling a query involving clumping contiguous constraints of a query into one or more subqueries based on partition organization parameters and evaluating each subquery against a partition of a graph having data records for the corresponding partition organization parameter value. In one example, clumping of contiguous query constraints based on an RDF data component, such as a subject, may be used to evaluating subqueries of a query against one or more partitions of a graph having RDF data records with that subject.

Abstract: A system and method for distributed query compilation and evaluation involving a first table having a first number of partitions and a second table having a second number of partitions. A query operation, such as a join, is performed for each combination of partitions from the first and second tables. The result of each query operation on each combination of partitions is organized into a third number of partitions. A number of tables equal to the third number are generated with each table including one of the partition results from each of the query operation combinations.

Abstract: A method for television viewing data analysis is described comprising, the method including receiving a query including audience parameters defining characteristics of a subset of a viewing audience, and viewing pattern parameters defining viewing patterns to be analyzed, applying the audience parameters to a database of viewer characteristics and determining therefrom a plurality of viewers from whom data is to be collected, building a viewer query based on the viewing pattern parameters, sending the viewer query to a plurality of viewer devices associated with the plurality of viewers for execution thereat, after execution of the viewer query at the plurality of viewer devices, receiving a viewer query result from at least some of the plurality of viewer devices, and analyzing the received viewer query results to produce a result of the query. Related methods and apparatus are also described.

Abstract: In some embodiments, a computer-implemented method for tuning queries for a multi-tenant database system is provided. A processor retrieves actual statistics associated with data stored on one or more servers in the multi-tenant database system. The data may be associated with one or more tenants of the multi-tenant database system. A subset of the actual statistics is selected, wherein the subset of the actual statistics is related to tenants having a data trait targeted for optimization. The processor determines synthetic statistics based on the subset of the actual statistics. An original query is received at the multi-tenant database system, wherein the original query operates upon data associated with a tenant that has the data trait targeted for optimization. The processor determines an optimal query plan based on the original query and synthetic statistics. Finally, the processor executes the original query based on the optimal query plan.

Abstract: A system for receiving a plurality of search criteria from a plurality of users is disclosed. The plurality of search criteria is for application to a common information repository. The plurality of search criteria includes a first search criterion that is received from at least two of the plurality of users. The system further associates the plurality of search criteria with source information. The source information includes a plurality of sources via which the plurality of search criteria are received and communicated. Further, the system maintains a count of instances of the first search criterion received from the at least two of the plurality of users for each of the plurality of sources including the first source.

Abstract: Technology is described for transformation rule profiling for a query optimizer. The method can include obtaining a database query configured to be optimized by the query optimizer of a database system. An optimized query plan for the database query can be found using a host set of transformation rules. One transformation rule can be removed and checked at a time. Each transformation rule can be checked to determine whether the transformation rule affects an optimal query plan output. A test query plan can be generated after each transformation rule has been removed. The query optimizer can determine whether the test query plan is different than the optimized query plan in the absence of the removed transformation rule. An equivalent set of transformation rules can be created that includes transformation rules where the test query plan generated from the equivalent set of transformation rules is equivalent to the optimized plan.

Abstract: In a method, system, and computer-readable medium having instructions for optimizing a query in a database system, a query request is received with a query predicate to filter data returned in response to the query request and the query predicate has a formula, the query request is transformed to a transformed query request by preprocessing the formula in the query predicate, and the query request is optimized using the transformed query request.

Abstract: A user is provided with an analytical function which indicates an individual contribution of each search term used in a complex search query by a graphical, typographical or numerical indicator. For this purpose there is started in the background for each search term a search query which consists of the complex search query without the respective search term. The hit count obtained in this way is subtracted from the total hit count of the search query with the respective search term. The difference is a numerical indicator for the individual contribution of the respective search term to the total hit count. Thus, the user quickly and conveniently obtains a reference point indicating which search terms are crucial to the search query. The user can thus selectively refine the search query by explicitly specifying less significant search terms or removing overly restrictive search terms.

Abstract: A method and system for expanding attribute profiles are presented in which primary attributes from one or more attribute profiles are used to derive secondary attributes which are added to the respective attribute profiles to generate expanded attribute profiles. The expanded attribute profiles are generated to increase the strength of association of a query attribute with one or more attribute profiles associated with query-attribute-positive individuals.

Abstract: Provided are techniques for processing a query. A query is received, wherein the query is formed by one or more paths, and wherein each path includes one or more steps. A hierarchical document including one or more document nodes is received. While processing the query and traversing the hierarchical document, one or more extraction entries are constructed, wherein each extraction entry includes a step instance match candidate identifying a document node and a step instance ancestor path for the document node, and one or more tuples are constructed using the one or more extraction entries by associating the step instance match candidate from one of the one or more extraction entries with the step instance match candidate from at least one of the one or more other extraction entries.

Abstract: In one embodiment the present invention includes a computer-implemented method of improving performance of schema matching. The method includes storing a matching topology that maps a first data structure to a second data structure. The method further includes identifying a first portion of the matching topology that is a candidate for improvement as determined according to an incidence graph. The method further includes rewriting the first portion of the matching topology with a second portion according to the incidence graph.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for a database designer and a database storage designer. In one aspect, a method includes creating a set of candidate projections and progressively narrowing the set of candidate projections and a set of queries by eliminating candidate projections that do not satisfy a performance improvement criterion for remaining queries based on the properties associated with the candidate projections.

Abstract: Embodiments are included for methods, systems, and computer program products for evaluating operations in a shared nothing parallelism system using an electronic computing device are presented, the methods and computer program products including: causing the electronic computing device to receive the operation, where the operation is non-collocated, reference based operation, and where the operation is configured for execution on a first partition in the shared nothing parallelism system; causing the electronic computing device to insert a table queue operator on a second partition, where the second partition includes a reference to input data, causing the electronic computing device to place the reference to the input data on the first partition by the table queue operator; and causing the electronic computing device to execute the operation on the reference to the input data on the first partition.

Abstract: An information sharing system to solve one or more information retrieval problems is concerned with the novel, hybrid use of the stochastic optimization techniques of evolutionary computation (EC) search strategies for computer information systems such as search engines, or service oriented architectures (SOAs). The information sharing system uses stochastic optimization agents for task distribution and communication when foraging a system of stored documents for information, assessing the computational effort required to retrieve information in the form of stored documents, sharing information among stochastic optimization agent processes and processors, and extracting knowledge from the information. The field of evolutionary computation encompasses stochastic optimization techniques, such as randomized search strategies, in the form of evolutionary strategies (ES), evolutionary programming (EP), genetic algorithms (GA), classifier systems, evolvable hardware (EHW), and genetic programming (GP).

Abstract: Methods and arrangements for extracting tuples from a streaming XML document. A query twig is applied to the XML document stream, tuples are extracted from the XML document stream based on the query twig, and a quantity of extracted tuples is limited via foregoing extraction of duplicate tuples extraction of tuples that do not satisfy query twig criteria.