Abstract: The maintenance of a materialized view created and managed by a materialized view management platform may be dynamically adjusted. The performance of updates to a materialized view are monitored to trigger different events to make adjustments to the performance of subsequent updates. The materialized view management platform can adequately scale to handle changes to data sources as inputs to the maintenance of the materialized view, as well as make other adjustments handle various changes in the capability of the target data store to receive updates to the materialized view (e.g., target data store outages).

Abstract: A new type system may be added to a type registry for a data processing service. A request to add the new type system may be received that describes the new type system for a data store. The new type system may be used to perform a data processing job that accesses the data store to obtain or store data as a source or target data store.

Abstract: A method of improving compute performance of a distributed database system includes querying a control node of the distributed database system to ascertain a plurality of attributes characterizing an initial state of a table object in the distributed database system. Queries executed in the distributed database system are recorded. Based on these queries and at least some of the plurality of attributes, an candidate state of the table object with lower compute load than the initial state is generated. An executable transformation mapping the initial state of the table object to the candidate state is then assembled and applied to the table object.

Abstract: Runtime optimization of grouping operators is described. A system estimates a resource cost for each of multiple grouping operators based on values identified during query runtime, in response to receiving a query request associated with a data stream. The system selects a grouping operator during query runtime, based on a corresponding resource cost, from the multiple grouping operators. The selected grouping operator enables grouping the data stream based on the query request, and outputting a response based on the grouped data stream.

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

Abstract: A query that is frequently processed to access an object storage is identified. Results from the query returned from the object storage is transformed into a relational database format as a materialized view. When the query is submitted a subsequent time, updated results are managed from the materialized view, other materialized views, and/or the object storage when needed.

Abstract: In some examples, a database system includes a storage medium to store a materialized view (MV) that includes data satisfying an MV condition. At least one processor is to receive a query including a query condition, determine that the query condition partially matches the MV condition, and access a part of the data in the MV partially satisfy the query.

Abstract: A query processing method includes decomposing an SQL into logical plans based on data source feature information, to obtain a logical plan set, where the data source feature information is stored in an internal data source feature library of a query engine, and the internal data source feature library is stored in cache space of the query engine; generating physical plans for the logical plan set based on the data source feature information, to obtain a physical plan set; determining query costs of the physical plan set based on the data source feature information, to obtain a physical plan with a highest priority; and executing the physical plan with the highest priority, to obtain a query result queried by a user. A data source registration method and a query engine is further disclosed.

Abstract: Materialized views may be generated at a managed materialized view platform that accepts data streams as a source. When updating a materialized view with a data stream as a source, a stored portion of the stream is used to maintain a history of changes to be made. When a join operation needs to utilize the data stream source to determine an update to the materialized view, the data stream is preserved to complete the join and update the materialized view.

Abstract: A method, system and computer program product for join graph generation based upon a log of previously executed database queries includes method for generating a join graph for relational database queries. The method includes loading into memory of a computer, a log of a set of database queries previously executed against data in a database and sequentially parsing each of the queries in the log to identify different semantically characterizable components of each of the queries. The method further includes generating a join graph for each of the queries from corresponding ones of the components. Finally, the method includes selectively adding each of the generated join graphs to a set of join graphs in a data model for the data in the database.

Abstract: A method, system and computer program product for clustered join graph generation based upon a log of previously executed database queries includes loading into memory of a computer, a log of a set of database queries previously executed against data in a database of the database management system, sequentially parsing each of the queries in the log to identify different semantically characterizable components of each of the queries, generating a join graph for each of the queries from corresponding ones of the components, clustering different generated join graphs according to semantic commonalities so as to form different clusters of join graphs, each for a different semantic commonality, combining the generated join graphs for each cluster into a combined join graph for the corresponding cluster and adding each of the combined join graphs to a set of join graphs in a data model for the data in the database.

Abstract: Systems and methods for processing structured queries as search queries are provided herein. An example system includes a structured query language (SQL) parser that parses a SQL structured query into a tree structure; an analyzer module that generates a logical plan from the tree structure; a planner module that generates an optimized logical plan from the logical plan; and an execution module that: generates a physical plan from the optimized logical plan, the physical plan comprising a search query that can be executed by a search engine; and returns results of the search query to a client.

Abstract: A process for mining existing views to generate join statements is provided herein. A request to generate a join statement may be received, which may include a database object identifier to be part of the join statement. One or more views in the database may be identified, which may include the database object identifier. One or more edges in the one or more views may be identified, which may include the database object identifier. Scores for the one or more edges may be calculated. The edges may be filtered based on their scores according to one or more filtering rules. The filtered edges may be provided. A selected edge may be received, which may be selected from the provided filtered edges. The join statement may be generated in a query language. The join statement may be based on the selected edge. The generated join statement may be provided.

Abstract: The subject technology defines a materialized view over a source table that is associated with a first account of a database. The subject technology defines cross-account access rights to the materialized view for a second account. The subject technology modifies the source table for the materialized view. The subject technology identifies that the materialized view is stale with respect to the source table by merging the materialized view and the source table. The subject technology causes the materialized view to be refreshed with respect to the source table.

Abstract: A system for and a method of testing the performance of a database management system. The system and method utilize a data table generator, a query generator, and a query driver system that are configured to generate test data, generate a series of test queries, and execute the queries against the data in a controlled and measurable manner such that the performance of the database management system can be tested in a configurable, repeatable, and consistent manner to measure the impact of system software and configuration changes.

Abstract: A database platform can track changes using a stream that records changes made by database transactions. Streams on views can be implemented by applying a stream to source data, and applying the view to the streamed data. Users of the database platform can query the stream on the view to review recent changes to the view, such as changes made since the last database transaction.

Abstract: Described herein is a system and method for detecting and reusing overlapping computations. Overlapping subgraphs of the query are determined using a normalized signature for a particular subgraph that identifies a particular subgraph across recurring instances of data. A normalized signature for each overlapping subgraph for the determined overlapping subgraphs of the query is provided. For each overlapping subgraph determined to be materialized: whether or not the particular subgraph has been materialized is determined using a precise signature corresponding to a normalized signature of the particular overlapping subgraph. The precise signature identifies a particular subgraph corresponding to the normalized signature within a particular recurring instance of data. When the particular subgraph has not been materialized, the subgraph is materialized and used to respond to the query. When the particular subgraph has been materialized, the materialized subgraph is used to respond to the query.

Abstract: An aggregate is generated. Upon receiving a second query comprising a filter criterion, a determination is made as to whether at least a threshold number of previous first queries comprises a similar filter criterion, and if so generating an aggregate using the similar filter criterion as an aggregation criterion, such that future queries comprising the similar filter criterion are satisfied by the aggregate.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing contextual information for a displayed resource. In one aspect, a method includes receiving, from a user device, a query-independent request for contextual information relevant to an active resource displayed in an application environment on the user device, identifying multiple search items from the content in the resource, determining a relevance score for each of the multiple search items, selecting one or more of the multiple search items based on the relevance scores, and providing, to the user device for each of the selected one or more multiple search items, a respective contextual user interface element for display with the active resource, where each contextual user interface element includes contextual information regarding the respective search item.

Abstract: A device may include one or more processors. The device may receive program code that identifies operations to be performed with regard to a data set to determine an output value. The device may identify a plurality of read operations corresponding to the operations. The plurality of read operations may be performed to obtain respective inputs of the operations. The device may generate a first data structure that identifies the operations and the plurality of read operations. The device may identify two or more operations, of the operations, that receive a particular input. The device may generate a second data structure that includes a combined operation. The combined operation may be generated based on the two or more operations, and may be associated with fewer read operations than the two or more operations. The device may determine the output value based on the second data structure.

Abstract: The present disclosure relates to processing write requests across a plurality of data sources. According to one embodiment, an example method includes determining a navigable path of nodes accessed to satisfy a write request in a graph projection of an application programming interface (API). An API service generates a plurality of subqueries, each subqueries being associated with a node in the navigable path. While traversing the navigable path to execute the write request, the API service identifies one or more nodes in the navigable path sharing an association with a data repository associated with the current node and upon which execution of a write operation associated with the current node depends. The API service coalesces a set of subqueries associated with the current node and the identified one or more nodes into a single subquery and executes the single subquery.

Abstract: A system and method is described for database split generation in a massively parallel or distributed database environment including a plurality of databases and a data warehouse layer providing data summarization and querying functionality. A database table accessor of the system obtains, from an associated client application, a query for data in a table of the data warehouse layer, wherein the query includes a user preference. The system obtains table data representative of properties of the table, and determines a splits generator in accordance with one or more of the user preference or the properties of the table. The system generates, by the selected splits generator, table splits dividing the user query into a plurality of query splits, and outputs the plurality of query splits to an associated plurality of mappers for execution by the associated plurality of mappers of each of the plurality of query splits against the table.

Abstract: Method and system are provided for log file analysis to locate anomalies. The method includes comparing each line of a log file with other lines of the log file to determine duplicate and similar lines of the log file. The step of comparing includes: locating two or more duplicate lines of the log file; and locating two or more similar lines of the log file using pattern matching of a string of each of the lines of the log file. The method also includes outputting a line of the log file as a line that is a potential anomaly if it is rejected as a duplicate or a similar line.

Abstract: A system and method of collecting statistics on a database for performing at least one insurance related structured query language (SQL) query are disclosed. The system and method includes providing at least one insurance related SQL query, determining the relationships of tables subject to the provided at least one insurance related SQL query, transforming the determined relationships of tables into a display representing communities of tables, and collecting statistics on at least one community of tables based on the at least one insurance related SQL query. The tables of the system and method represent insurance data.

Abstract: According to an exemplary embodiment of the present invention, disclosed is a method for synchronizing query results between databases executed in a first database server. The method may include: determining synchronization of a materialized view present in a second database server which is remotely located from the first database server in which the materialized view refers to a master table present in the first database server and the first database server and the second database server are heterogeneous; generating a synchronization command to be transmitted to the second database server in response to determination of synchronization; and transmitting the generated synchronization command to the second database server to allow the second database server to synchronize the materialized view present in the second database server and the master table present in the first database server.

Abstract: Methods and apparatus, including computer program products, for profile-based optimizations of Extensible Stylesheet Language Transformations (XSLT) transformations. A method includes generating a XSL (Extensible Stylesheet Language) Transformations (XSLT) and Extensible Markup Language (XML) Path Language (XPath) execution tree for an XSLT stylesheet, determining one or more optimizations for the XSLT and XPath execution tree, applying the one or more optimizations to the XSLT and XPath execution tree, verifying the one or more optimizations in the XSLT and XPath execution tree, making the verified one or more optimizations persistent in an optimized XSLT stylesheet, and transforming one or more source XML documents into one or more result documents using the optimized XSLT stylesheet.

Abstract: Methods and systems are described for creating a custom index in a multi-tenant database environment. In one embodiment, a method includes obtaining query for a multi-tenant database that is recommended as a candidate for creating an additional filter, evaluating the query against criteria to determine whether to select the query for creating the additional filter, and creating the additional filter for the query, if the query is selected.

Abstract: In accordance with disclosed embodiments, there are provided systems and methods for implementing and maintaining sampled tables in a database system.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for expressing inequality expressions as a bounded number of equality expressions. One of the methods includes receiving an original query having an inequality expression for an original attribute. A new query that replaces the inequality expression with a bounded number of equality expressions is generated, wherein each equality expression references a respective auxiliary attribute, each auxiliary attribute representing intervals of values for the original attribute. The new query having the bounded number of equality expressions is provided to a database system instead of the original query. Query results that satisfy the inequality expression for the original attribute are received from the database system.

Abstract: System, method, and computer program product to intelligently utilize non-matching weighted objects, by determining that a sort sequence of a query does not match a sort sequence of a shared weight object of a database, modifying the query based on the sort sequence of the query, and executing the modified query to obtain a result set, wherein the result set does not include a set of rows that would have been returned using the shared weight object to process the unmodified query.

Abstract: Methods and data structures are provided for allowing data mining with improved efficiency. During processing of a usage log (or multiple logs) for an activity, such as a usage logfile of network search activity, a common fact table is generated. The common fact table allows a plurality of auxiliary data structures to be formed from the common fact table. These auxiliary data structures are designed to allow users to submit queries against the contents of the data structure in order to investigate the data. The efficiency of access of the common fact table is improved by allowing users to access auxiliary data structures other than the auxiliary data structures that are associated with a user. Optionally, the common fact table and/or the auxiliary data structures can include dimension values that correspond to both pre-identified dimension values as well as dimension values that are identified during processing of the activity logfiles.

Abstract: A method and apparatus for automatically analyzing and providing feedback regarding the optimizability of a relational database query. A query developer's primary goal is to ensure that queries and DML operations are rewritten for the most efficient execution. Rewrite diagnosability captures metadata for each attempted query optimization including success or failure and the reasons for failure. The metadata is stored in association with the operators that were not removed through rewriting. Once all optimizations have been attempted and rewriting is complete, the metadata is selectively displayed based on the cost to perform the associated operation. The context of performing the operation may affect the cost. The cost may be based at least on the type of operation and where within the query tree the operation is located. A query developer may configure the database system not to execute the resulting query plan based on one or more criteria.

Abstract: System, method, and computer program product to intelligently utilize non-matching weighted objects, by determining that a sort sequence of a query does not match a sort sequence of a shared weight object of a database, modifying the query based on the sort sequence of the query, and executing the modified query to obtain a result set, wherein the result set does not include a set of rows that would have been returned using the shared weight object to process the unmodified query.

Abstract: A processing device receives a permission request indicating a user and an entity. The processing device modifies a permissions database to generate a modified database view. Using the modified database view, the processing device determines whether the user has permission to access the entity and returns an indication of whether the user has permission to access the entity.

Abstract: A data sharing space (DSS) is generated for a base table having a set of rows with stored data. Requests are received to generate tables, each request including a query to the base table. A row from the set of rows is then accessed. The query is then applied to the row to generate results. An index value is then determined and a portion of the row is stored in the DSS based on the index value.

Abstract: A data sharing space (DSS) is generated for a base table having a set of rows with stored data. Requests are received to generate tables, each request including a query to the base table. A row from the set of rows is then accessed. The query is then applied to the row to generate results. An index value is then determined and a portion of the row is stored in the DSS based on the index value.

Abstract: Systems and methods for handling queries are disclosed. A computer determines that a data-table includes a problematic-key. The problematic-key includes a key used in queries that fails to generate results within a threshold time period. The computer creates a variant-table configured to store at least a portion of the data in the data-table and optimize processing queries using the problematic-key. The computer receives a new query including a key. Upon determining that the query-key is a problematic-key and that resolving the new query using information associated with a latest update time of the variant-table is acceptable, the computer generates a result for the new query using the variant-table. Upon determining that the query-key is a not a problematic-key or that resolving the new query using information associated with a latest update time of the variant-table is unacceptable, the computer generates a result for the new query using the data-table.

Abstract: A system includes first and second data stores, each store having a set of materialized views of the base data and the views comprise a multistore physical design; an execution layer coupled to the data stores; a query optimizer coupled to the execution layer; and a tuner coupled to the query optimizer and the execution layer, wherein the tuner determines a placement of the materialized views across the stores to improve workload performance upon considering each store's view storage budget and a transfer budget when moving views across the stores.

Abstract: A method, system, and a computer program product for converting asymmetric requests into symmetric requests are disclosed. In a first aspect, the method comprises a computer partitioning a query into a set of partitions along a dimension of a multi-dimensional data source, wherein each partition of the set of partitions comprises more than one member and the query has a query result count. The method includes the computer creating a candidate query for each partition of the set of partitions, wherein each candidate query has a candidate query result count. Responsive to a determination that the query result count is greater than a sum of the candidate query result counts, the method includes the computer substituting the query with the candidate queries.

Abstract: A computer readable storage medium includes executable instructions to define an interface to a multi-dimensional cube divided into partitions distributed across nodes supporting a shared nothing multi-dimensional distributed database. The interface includes a metadata module characterizing access paths to data within the multi-dimensional cube and an access path module to convert a data request into an access path protocol to retrieve data from the multi-dimensional cube to satisfy the data request.

Abstract: Systems and methods for generating a report for a resource are described. The report is generated from databases comprising data sets related to a plurality of resources. An example method includes dynamic generation of a first query upon selection of at least one attribute by a user. The first query includes instructions for being performed on the data sets. The method further includes determining that the first query is stored in a table schema. The table schema is associated with a first trigger. The method also includes invoking the first trigger based on the determining. The first trigger is configured to execute the first query to generate a materialized view upon execution of the first query. The method may include generating the report by executing a second query on the materialized view. The second query may be created based on materialized view data.

Abstract: The present invention relates to computer implemented methods and system for creating and executing an query plan for SPARQL Protocol And Query Language (SPARQL) queries. The methods and systems are designed to accept as input a query in SPARQL syntax, convert this query to semQA2 and generate a parse tree, perform filter pushdown, generate an efficient query plan potentially using a cost function, and execute this query plan against data sources complying to or modeled as Resource Description Framework (RDF). The result of these methods and of the systems implementing these methods is a set of triples contained in the data sources that comprise a solution of the SPARQL query provided.

Abstract: Disclosed is a system allowing to query data warehouses using SPARQL. An aspect of the system may support the representation of multidimensional data as virtual graphs. Another aspect of the system may provide mapping of SPARQL queries directed against multidimensional data vis-à-vis the graphs to native queries directed against the multidimensional data. Responses from the native queries may then be translated to a SPARQL response format.

Abstract: Systems and methods are presented for performing concurrent updates on a shared value. A request to update a shared value is stored in a secondary database table, and the update to the shared value is deferred. Application of an aggregation function to delta values stored in the secondary database table may produce an aggregate value that can be applied to the shared value in a consolidated update.

Abstract: Web services hosted at a data center may employ architectural patterns that tend to obfuscate the source of queries made against databases and other resources in the data center. The queries may be the source of performance, capacity or utilization problems, and may contribute to the cost of hosting the web service. Web service invocations may be associated with identifiers that can be included in modified queries sent to databases and other resources. Summarized cost information may be calculated based on recorded associations between the identifiers and query performance information.

Abstract: Disclosed is a method including storing selected historical persist dimension attribute data utilizing a row insertion without updating all previous versions of the selected persist dimension attribute, and generating a view of persisted dimension attribute data as dual values utilizing a star join.

Abstract: Embodiments are directed are towards the transparent summarization of events. Queries directed towards summarizing and reporting on event records may be received at a search head. Search heads may be associated with one more indexers containing event records. The search head may forward the query to the indexers the can resolve the query for concurrent execution. If a query is a collection query, indexers may generate summarization information based on event records located on the indexers. Event record fields included in the summarization information may be determined based on terms included in the collection query. If a query is a stats query, each indexer may generate a partial result set from previously generated summarization information, returning the partial result sets to the search head. Collection queries may be saved and scheduled to run and periodically update the summarization information.

Abstract: In an embodiment, Partition Change Tracking (PCT) refresh is performed by using join dependencies on partitioning columns to derive and fill in identifiers of rows and/or partitions containing the rows in the refresh expressions. In an embodiment, the join dependencies that form the Materialized View's (MV's) query definition and the partitioning predicate of the table are used to automatically generate a statement which is run in order to derive and fill in identifiers of the rows and/or partitions that are being changed. The identifiers are then plugged into the refresh expression, and the refresh expression is run. Running the refresh expression causes the rows identified to be refreshed.

Abstract: Methods and systems for managing assessment of media content electronically submitted to a network-based media distribution system. A submitter can prepare a media package that is associated with a particular media asset (e.g. media title), and then electronically submit the media package to the media distribution system. The media distribution system can then process the media package to produce various components that are used by the media distribution system to electronically distribute media content of the media asset. According to one aspect, the media distribution system can manage a review process on the various components so that the components can be individually approved or rejected. According to another aspect, embodiments pertain to a reviewer's workspace that can assist a user in reviewing the submitted media content. According to still another aspect, embodiments can utilize a plurality of reviewers to review various media assets that have been submitted.

Abstract: A mechanism is provided in a data processing system for optimization of a distributed file system by log data analysis. A name node in the distributed file system initiates a log analysis map/reduce job on one or more connected data nodes via a map/reduce processing framework in the distributed file system and receives result data resulting from the log analysis map/reduce job from the one or more connected data nodes via the map/reduce processing framework in the distributed file system. The name node performs analysis on the received result data and generates an optimization plan for the one or more connected data nodes based on results of the analysis. The name node initiates the optimization plan on the one or more connected data nodes via the map/reduce processing framework in the distributed file system.