Abstract: The present disclosure involves systems, software, and computer implemented methods for optimizing continuous queries for hybrid execution over a stream processing engine and an in-memory database. In one example, a method may include identifying a continuous query executed at a stream processing engine, the continuous query including a plurality of operators. An optimal plan for execution of the identified continuous query at the stream processing engine is determined. For each of the plurality of operators in the determined optimal plan, an optimized placement decision for executing a particular operator in the stream processing engine or at a database system is determined. An optimized continuous query is generated from the identified continuous query based on the determined optimal placement decisions for each of the plurality of operators in the determined optimal plan. The optimized continuous query is then executed at the stream processing engine and the database system.

Abstract: Methods, systems, and computer program products for translating structured languages to natural language using domain-specific ontology are provided herein. A computer-implemented method includes determining similarities among multiple natural language query interpretations derived from an input query, determining differences among the multiple natural language query interpretations, and generating natural language descriptions of each of the multiple natural language query interpretations based on analysis of the determined similarities, the determined differences, and the input query. The method also includes producing, for each of the natural language query interpretations, a natural language string that represents one or more unambiguous interpretations of the input query, wherein the producing comprises consolidating the generated natural language descriptions. Further, the method includes outputting each of the produced natural language strings to a user.

Abstract: A method includes receiving at a cache server a content request from a client system, determining that the cache server is overloaded in response to receiving the content request, and in response to determining that the cache server is overloaded, returning to the client system a domain redirection response including a load status of the cache server.

Abstract: According to an embodiment of the present invention, a system displays initial search results based on a query and enables selection by a user of an item within the search results. The system determines refined search results based on behavior of the user with respect to the initial search results. Embodiments of the present invention further include a method and computer program product for presenting revised search results based on user behavior while examining the results in substantially the same manners described above.

Abstract: Multiquery optimization is performed in the context of RDF/SPARQL. Heuristic algorithms partition an input batch of queries into groups such that each group of queries can be optimized together. The optimization incorporates an efficient algorithm to discover the common sub-structures of multiple SPARQL queries and an effective cost model to compare candidate execution plans. No assumptions are made about the underlying SPARQL query engine. This provides portability across different RDF stores.

Abstract: In one embodiment, a method includes receiving, from a user, a search query requesting objects of a first object type. The search query includes an inner query requesting objects of a second object type. The method includes identifying the objects of the second object type requested by the inner query using an inverted index of a second data store corresponding to the second object type; identifying, for each of the identified objects of the second object type, objects of the first object type using an inverted index of a first data store corresponding to the first object type; aggregating a plurality of search results responsive to the search query, each search result corresponding to an identified object of the first object type; and sending, to the user, one or more of the aggregated search results.

Abstract: A computer device may reduce user error when constructing a search query. The computing device may display one or more search terms within a search box based on user input. The computing device may display initial autosuggest candidates and detect a user-selected initial autosuggest candidate. The computing device may display the user-selected initial autosuggest candidate within the search box as a preliminary search query, without automatically initiating a web search for the preliminary search query. The computing device may receive new autosuggest candidates having the preliminary search query as a common prefix, generate truncated autosuggest candidates by removing the common prefix from each new autosuggest candidate, and display the truncated autosuggest candidates.

Abstract: The disclosure relates to technology for query compilation in a database management system. A first execution time of code for at least one database query without applying a code generation method is estimated and in response to receiving the at least one database query, and for one or more code generation methods, a compilation cost and a second execution time of the code as modified by the code generation methods is estimated. A cost savings for each of the one or more code generation methods is calculated, where the cost savings is calculated as the first execution time less the second execution time of the code generation method, less the compilation cost of the code generation method. One of the code generation methods or the no code generation method with the highest cost savings is then selected.

Abstract: A method, system and computer program product for providing early diagnosis of hardware, software or configuration problems in a data warehouse system. A received query is parsed to determine the properties of the query. The query may then be joined to existing groups of queries if those groups have shared properties of the query. After executing the query according to an execution plan, results from the execution of the query is received, which may include problem(s) that occurred during execution of the query. For those problems that reach a pre-defined threshold of becoming a “group problem” in those groups joined by the query, the problem is reported to the end user concerning those groups where the problem exceeds the pre-defined threshold. In this manner, an early diagnosis of the problems in the data warehouse system that can cause delay and failure of the processing of queries is able to occur.

Abstract: Methods, software and devices for indexing responses for later providing to users in response to queries are disclosed. For each stored response, representative queries are stored in association with that response, where each representative query represents a possible query for searching for information addressed by that response. Representative queries are selectively modified by substituting terms by corresponding chosen substitute expressions, where a substitute expression is chosen for a particular term in one of the representative queries based on past substitutions in others of said representative queries. For each response, a Boolean expression is formed from those representative queries associated with that response, as selectively modified, where the Boolean expression is satisfied by each of those representative queries.

Abstract: A digital information analysis system includes a target selection unit that selects target digital information, a combination storage unit that stores each of a plurality of word combinations related to a predetermined specific item, a search unit that searches whether the plurality of word combinations stored in the combination storage unit are included in the target digital information selected by the target selection unit, a relation determination unit that determines the relation of the target digital information to the predetermined specific item on the basis of a morphological analysis result when the plurality of word combinations stored in the combination storage unit are included in the target digital information, and a determination result setting unit that associates the determination result of the relation determination unit with the target digital information.

Abstract: Provided are method and system of providing a social network service (SNS) in which life cycle concepts of creatures are a motif. Particularly, user's personal connection information and relationships between users are separately expressed as a structure of a creature made in a graphic, and a non-disclosure information portion for private use and a disclosure information portion for public use are clearly divided.

Abstract: In updating a synopsis table of a database system, a database management unit performs a transaction to insert row(s) in a section of the base table and determines whether a synopsis entry for the section is stored in the memory. If stored in the memory, the in-memory synopsis entry is retrieved and metadata values in the in-memory synopsis entry are updated with data from the row(s) to be inserted. If not stored in the memory, the in-memory synopsis entry is generated and the metadata values in the in-memory synopsis entry are updated with data from the row(s). The insert transaction is then committed. Synopsis entry on-disk updates are thus avoided, significantly reducing the cost of updating the synopsis entries from the insert transaction. This yields enhanced performance especially for inserts of a small number of rows, while the benefits of synopsis entries are still available.

Abstract: A computer-implemented method for computing a concept materialization of an ontology is presented whereby a compression technique called “ABox abstraction and refinement” is used that may significantly reduce time, memory, and computing resources for reasoning and in particular for computing and outputting the materialization.

Abstract: Techniques are provided that include obtaining a Document Object Model of an HTML document, such as a web page of a publisher. Elements of the Document Object Model may be identified that are associated with native advertisement placement candidate containers. Based at least in part on analysis associated with the Document Object Model, and utilizing at least some of the identified elements, one or more native advertisement placement candidate containers may be determined. Some techniques may utilize, in the analysis, construction and utilization of a suffix tree of a string of tags comprising all tags in the Document Object Model. Some techniques may utilize, in the analysis, a node flattening technique in connection with the Document Object Model.

Abstract: A native environment on a local device and a virtual environment on a server device linked to the native device over a network can concurrently execute. The concurrently executing can share state information to keep activities between both environments substantially time-synched. The native environment can be a user-machine interactive environment of a machine-to-user interactive interface. The native environment can perform stand-alone operation without appreciable end-user experience degradation. A process in the native environment requiring an excessive quantity of processing cycles can be detected. The native environment can not perform the processing using resources of the native environment. The virtual environment can perform the process and synchronize the result to the native environment, thereby permitting the native environment to continue to function as if the process was performed by the native environment.

Abstract: In one embodiment, a method includes receiving, from a user, a search query requesting objects of a first object type. The search query includes an inner query requesting objects of a second object type. The method includes identifying objects of the second object type requested by the inner query using an inverted index of a data store corresponding to the second object type; identifying objects of the first object type requested by the search query using the identified objects of the second object type and a forward index of the data store corresponding to the second object type; and sending search results to the user responsive to the search query, each search result corresponding to an identified object of the first object type.

Abstract: System and methods for performing context inference in a computing device are disclosed. In one embodiment, a method of performing context inference includes: determining, at a computing device, a first context class using context-related data from at least one data source associated with a mobile device; and determining, at the mobile device, a fusion class based on the first context class, the fusion class being associated with at least one characteristic that is common to the first context class and a second context class that is different from the first context class.

Abstract: A method, system, and computer program product for normalized ranking of semantic query search results. The method commences by forming a SPARQL query, the SPARQL query specifying a collection of named RDF graphs, then executing the SPARQL query to retrieve matched documents selected from the collection of named RDF graphs. Having retrieved the matches, the method calculates an absolute normalized score for the matched document. The calculation of an absolute normalized score for a second matched document allows for relevance ranking. To enhance the relationship of the computer-calculated score to the relevance (and not solely to occurrence counts) embodiments consider the number of distinct variables selected in the SPARQL query, and also consider the total number of bindings to the aforementioned variables. For comparing from among possibly different sized documents, a further normalization component is implemented by considering the total number of triples found in the document's underlying subgraph.

Abstract: One embodiment is a method that generates query vectors from query plans and performance vectors from data collected while executing multiple queries in a database. A machine learning technique (MLT) computes distances between two query vectors and two performance vectors and then predicts performance of plural queries executing in the database.

Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.

Abstract: Total global minimum costs can be determined for multiple sub-plans for completing a multi-operation database process to be performed in a distributed database management system that includes a plurality of nodes. The multiple sub-plans can include different distributions of node locations of a plurality of operators among the plurality of nodes. An optimal plan having a lowest total minimum global cost can be selected from the multiple sub-plans.

Abstract: A system, computer-implemented method, and a computer-readable storage medium for determining estimations to statistical questions. Data statistics used in evaluating estimations to statistical questions are gathered from multiple sources in a database management system. A statistical question comprising, for example, cardinality estimations is received, wherein the question is posed by different database components, such as query optimizer, or execution engine. Estimation for the statistical question is computed, where the estimation is based on multiple data statistics and without using the data referred to in the question.

Abstract: A system and method for improving performance of join operations is disclosed. The method in one embodiment includes building a graph of vertices and edges, which represent the tables and join conditions for a particular database schema. The method then traverses the graph to find a set of candidate join operations. The method further includes selecting from the set of subset of join operations that makes the best use of a given amount of memory, which means finding a collection of denormalizations which when residing in memory provide the most benefit and the least cost for the given amount of memory. The method then deploys the denormalizations so that current queries in a query processing system can use them instead of actually performing the joins.

Abstract: A computer program product and method for estimating a filter factor for access path optimization in a database are provided. The method includes extracting from a statement segment for database query a relation condition which defines the relationship between a variable and a first table. The method includes obtaining first statistics information according to the relation condition and the statistics information of the first table. The method includes extracting from the statement segment a filter condition which defines the relationship between the variable and a second table. The method includes obtaining second statistics information according to the filter condition and the statistics information of the second table, and according to the first statistics information and the second statistics information, estimating the filter factor of the filter condition.

Abstract: An optimization technique is provided that optimizes data access by mapping each table, or row and/or column in a table, to a particular query, depending on whether the data in said table, row or column is ‘hot’ or ‘cold’ data. In one aspect, the invention features a method for optimizing the access time of an SQL query to a database including data. The method includes receiving, for each query type, a data frequency access measure and associating each query type with a processing rule set, according to the received data frequency access measure.

Abstract: In an embodiment, a recursive query is received that comprises a first select statement with a seed select statement and a second select statement with a recursive reference, wherein the recursive query further identifies at least two columns in at least one table, wherein the at least two columns have parent-child relationships represented by nodes in a graph, wherein the graph represents the organization of values in rows in the at least one table. A target recursion depth is calculated for the graph based on a fanout of the graph. In an embodiment, the target recursion depth is calculated by summing the fanout at each recursion depth of the graph multiplied by a number of nodes at each recursion depth of the graph. An estimated number of rows that the recursive query will return is estimated based on the target recursion depth.

Abstract: Systems and methods according to embodiments provide elasticity for complex event processing (CEP) systems. Embodiments may comprise at least the following three components: (1) incremental query optimization, (2) operator placement, and (3) cost explanation. Incremental query optimization allows avoiding simultaneous computation of identical results by performing operator-level query reuse and subsumption. Using automatic operator placement, a centralized CEP engine can be transformed into a distributed one by dynamically distributing and adjusting the execution according to unpredictable changes in data and query load. Cost explanation functionality can provide end users with near real-time insight into the monetary cost of the whole system, down to operator level granularity. Combination of these components allows a CEP system to be scaled up and down.

Abstract: The invention identifies and caches query plans in a shared-nothing distributed data store that are unlikely to become invalid because they do not reference objects that are likely to be changed or deleted. Plans that are likely to become invalid and are not cached are those plans that reference data that is partitioned across segment/query execution nodes of the data store, plans that are complex, and plans that reference objects that are not “built-in” (primitive) objects. The effect is that most plans which are generated on a query dispatch (master) node are not cached, whereas most plans generated on an execution (segment) node are cached.

Abstract: A cost monitoring system can monitor a cost of queries executing in a complex event processing system, running on top of a pay-as-you-go cloud infrastructure. Certain embodiments may employ a generic, cloud-platform independent cost model, multi-query optimization, cost calculation, and/or operator placement techniques, in order to monitor and explain query cost down to an operator level. Certain embodiments may monitor costs in near real-time, as they are created. Embodiments may function independent of an underlying complex event processing system and the underlying cloud platform. Embodiments can optimize a work plan of the cloud-based system so as to minimize cost for the end user, matching the cost model of the underlying cloud platform.

Abstract: An electronic device for media file caching for conserving resources is described. The electronic device includes a processor and instructions stored in memory. The electronic device monitors requests for a media file, stores media file information and determines whether the media file should be stored locally based on the media file information. If it is determined that the media file should be stored, the electronic device saves the media file and presents the media file.

Abstract: Data movement driven placement of data in a distributed database is disclosed. A set of one or more queries anticipated to be performed with respect to a data set is received. A set of statistics associated with the data set is received. The set of queries and the statistics are used to explore algorithmically a search space of distribution policy alternatives, to determine an optimal distribution policy to distribute data comprising the data set across a plurality of database servers.

Abstract: A query plan predictor receives a query instance according to a query template having a set of parameters. The query plan predictor determines a plan space point for the query instance which is based upon the set of parameters. The query plan predictor predicts a predicted query plan for the plan space point, which is selected from a map of query plans according to a confidence threshold from a plan cache that includes at least one histogram. Each histogram is representative of a cached query plan in the plan cache combined with a previously-selected locality-sensitive hashing function. The histogram stores a frequency distribution of a mapping of sample plan points for the cached query plan by the locality-sensitive hashing function.

Abstract: Disclosed herein are techniques for measuring or assessing the costs of executing operations across a plurality of computing systems. The cost of transferring data across at least one arrangement of computing systems is determined. The cost of executing at least one arrangement of the operations is also determined.

Abstract: Techniques for managing XML data associated with multiple execution units ensure that execution units are able to use XML data coming from other execution units. Such techniques are applicable when, but for the technique, an XML type value is produced in a particular form by one execution unit and is supposed to be consumed by another execution unit that is unable to process data in the particular form, and involves detecting that the foregoing situation exists and annotating information sent to an XML producer execution unit to cause the XML type value to be transformed into a canonical form that can be shared by all relevant execution units.

Abstract: Salient sampling for query size estimation includes identifying two or more columns in a database table that have corresponding columns in one or more other tables. One or more hash functions are applied to domains of each of the identified columns. A first hash function is applied to a domain of the first column and a second hash function to a domain of the second column. A subset of the rows in the database table is selected. The selecting includes selecting rows in the database table where results of the first hash function meet a first numeric threshold and selecting rows in the database table where results of the second hash function meet a second numeric threshold. A sample database table corresponding to the database table is created. The sample database table includes the selected subset of the rows in the database table.

Abstract: A system and methods are provided for interactive construction of data queries.

Abstract: A database table is provided. The database table includes several column tuples. A column is selected in the database table. The column tuples of the selected column are partitioned into several bins. Each bin includes a range of tuples and associated metadata. The associated metadata includes at least one of: a minimum tuple value for the tuples in the bin, a maximum tuple value for the tuples in the bin, a minimum tuple identifier for the bin and a maximum tuple identifier for the bin. The bins are sorted based on the tuple values to provide an approximate index for the database.

Abstract: The present invention relates to a field of evaluating the performance of a Structure Query Language (SQL) in information system. In particular, the invention proposes system and method of integration of a tool in Software Development Life Cycle (SDLC) which assures performance of SQL by estimating an execution time and remote installation of the same in a cloud based testing services. So, it can be used to detect the queries which may not perform well in the production environment.

Abstract: 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 instruction scan comprise a compiler to hold a query received at a query input, thereby preventing the query from executing based on a cost comparison between an estimated resource execution cost of a query plan for the query and cost rules.

Abstract: A database management system that manages data in a database includes a query optimizer that performs query optimization based on statistics related to data in the database. The query optimizer incrementally updates the statistics. The query optimizer organizes the statistics related to the data in the database into a statistics tree structure having a root node corresponding to global statistics, internal nodes corresponding to summary statistics of descendant nodes, and leaf nodes corresponding to disjoint data ranges in the database. The query optimizer performs statistics tree transformation operations on the statistics tree structure. The transformation operations transform the statistics tree structure into a form that at least partially minimizes the system resources needed to update the statistics. The query optimizer updates the statistics corresponding to those nodes of the statistics tree structure where a change has occurred in the disjoint data ranges.

Abstract: A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. For example during an insert operation, the column store data may be searched for a uniqueness violation only after certain filtering and/or boundary conditions have been considered. In another technique, a hybrid table manager may control movement of data to the column store based upon considerations such as frequency of access, or underlying business logic. In still another technique, querying of the hybrid table may result in a search of the column store data only after an initial search of row store data fails to return a result.

Abstract: A query is received and an initial data flow graph comprising a plurality of nodes is generated for executing the query. The initial data flow graph is optimized using a model optimizer that accesses at least one of a plurality of patterns to identify a matching pattern and executes at least one optimization rule associated with a matching pattern. Execution of the query is then initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described.

Abstract: The subject mater herein relates to database management and, more particularly, to non-equijoin metadata. Various embodiments described herein provide systems, methods, software, and data structures to facilitate non-equijoins of data. Some such embodiments include a data store to hold metadata describing relationships between database tables. The relationships between database tables may include one or more non-equijoins of tables in the form of one or more table-column pairs of a first table being non-equal to one or more table-column pairs of a second table. In some embodiments, the metadata may be used by a query generator to build query statements including one or more non-equijoin.

Abstract: Systems and methods are described herein that can implemented by a middle tier of a multi-tier data retrieval system to select data operation(s) that correspond to a query. The query may be received from a front tier. The selection is performed by comparing the query to a query template associated with each data operation. The query template for each data operation includes an algebraic description of queries that each respective data operation can satisfy. The selected data operation(s) are then executed against a data service to obtain data, which is then provided to the front tier. In some embodiments, an execution plan may be created by the middle tier for satisfying the query. The execution plan can include the selected data operation(s) and post-processing step(s). The post-processing step(s) can be applied to the obtained data to satisfy the query. The post-processed data is then provided to the front tier.

Abstract: A method, system, and computer program product for validating database table partitioning from partition advisors. The method commences by receiving a workload comprising a plurality of queries, then analyzes the queries to determine stratification buckets based on the usage of tables in the queries. Further analysis of the queries results in assigning the queries into one or more of the stratification buckets from which buckets a number n of queries (n being smaller than the total number of queries in the received workload) are drawn from the stratification buckets to form a representative workload having a confidence interval C and a margin of error M. Now, having a representative workload that is smaller, yet statistically representative of the received workload, a computer evaluates each of a plurality of partition schemes using the representative workload to determine an optimal partitioning scheme. The confidence interval C can be increased or decreased.

Abstract: There are provided systems and methods to respond to a request for data. The system receives a request to search for the data based on a criterion and to populate data objects with the data. The request is further used to identify columns that determine data sources to query. The system performs a search of a logical table based on the criterion to identify a plurality of rows in the logical table. The system further generates a first plurality of tuples based on the plurality of rows to identify a first plurality of physical tables that are mapped to the logical table. The first plurality of tuples includes a first tuple and a second tuple. The system further queries the data sources for the data to generate results by using the first plurality of tuples. The queries of the data sources are partially successful.

Abstract: A system and method include receiving a request for data at a programmed computer, the request identifying a field and an operation for an embedded database, translating the request via the programmed computer into multiple requests tailored to schemas of multiple different databases, estimating a cost to execute the request against each of the multiple different databases, and identifying the database that can execute the request with the least cost.

Abstract: Embodiments of the present invention are directed to query-optimization methods and systems that employ risk premiums assigned to database operations in order to increase the robustness and reliability of the evaluation and selection of query-execution plans for executing high-level database queries. Using risk-premium estimates, selection of query-execution plans that include potentially inefficient database operations and inefficient database-operation-execution sequences, often selected by currently available query-optimization methods and systems, are avoided.

Abstract: An estimation algorithm can generate a uniqueness metric representative of data in a database table column that is split across a plurality of data partitions. The column can be classified as categorical if the uniqueness metric is below a threshold and as non-categorical if the uniqueness metric is above the threshold. A first estimation factor can be assigned to the column if the column is classified as categorical or a larger second estimation factor can be assigned if the column is non-categorical. A cost estimate for system resources required to perform a database operation on the database table can be calculated. The cost estimate can include an estimated total number of distinct values in the column across all of the plurality of data partitions determined using the assigned first estimation factor or second estimation factor and a number of rows in the table as inputs to an estimation function.