Abstract: According to an aspect, a system includes a query engine configured to obtain a multi-provider query model for a query specifying a filter to be applied on provider partitions. The obtained multi-provider query model incorporates a pruning plan. The query engine includes a query optimizer configured to execute the pruning plan during optimization of the multi-provider query model. The pruning plan determines if each of the provider partitions includes content that is required to execute the filter based on pruning information. The query optimizer configured to reduce a scope of the query by excluding at least one provider partition that is determined as not required to execute the filter.

Abstract: Consolidated lists of items provided by or generated based on data provided by multiple provider systems can be presented, at a requestor system, in a series of pages. Navigation between pages in the series of pages can occur with a re-querying of the multiple provider systems in a manner that correctly populates the requested new page to reflect up to date information about the items that belong on that page.

Abstract: Mechanisms are provided for resolving database queries. These mechanisms identify a connected component in a query graph corresponding to a database query. They then determine a longest path length for the connected component. Next, the mechanisms select a path having the longest path length and build an algebraic expression for the path. Finally, the mechanisms solve the algebraic expression using matrix-matrix multiplication to provide a solution, and then respond to the query based on the solution.

Abstract: A method is provided for automatically discovering topics in electronic posts, such as social media posts. The method includes receiving a corpus that includes a plurality of electronic posts. The method further includes identifying a plurality of candidate terms within the corpus and selecting, as a trimmed lexicon, a subset of the plurality of candidate terms using predefined criteria. The method further includes clustering at least a subset of the plurality of electronic posts according to a plurality of clusters using the lexicon to produce a plurality of statistical topic models. The method further includes storing information corresponding to the statistical topic models.

Abstract: Methods and apparatus for providing consistent data storage in distributed computing systems. A consistent distributed computing file system (consistent DCFS) may be backed by an object storage service that only guarantees eventual consistency, and may leverage a data storage service (e.g., a database service) to store and maintain a file system/directory structure (a consistent DCFS directory) for the consistent DCFS that may be accessed by compute nodes for file/directory information relevant to the data objects in the consistent DCFS, rather than relying on the information maintained by the object storage service. The compute nodes may reference the consistent DCFS directory to, for example, store and retrieve strongly consistent metadata referencing data objects in the consistent DCFS. The compute nodes may, for example, retrieve metadata from consistent DCFS directory to determine whether the object storage service is presenting all of the data that it is supposed to have.

Abstract: Techniques for duplicating deduplicated data include identifying a connection between a source deduplicated data storage and a target deduplicated data storage. A location of a block of data is determined that is located on the source deduplicated data storage for copying to the target deduplicated data storage. A first reference on the target deduplicated data storage is created to the location of the block of data on the source deduplicated data storage. A second reference is created on the source deduplicated data storage to the location of the block of data on the source deduplicated data storage.

Abstract: A technique implements a dataflow graph, taking a number of streams of data inputs and transforms these inputs into a number of streams of outputs. The dataflow graph can perform pattern matching. The technique implements reactions via the composition of pattern matching across joined streams of input data. A completeness of matching an input sequence to a particular input pattern can be characterized as having at least three different degrees, such as cold (not yet matched), warm (e.g., minimally matched), and hot (e.g., maximally matched). The input pattern to be matched can have a variable length, including zero length or unlimited or arbitrarily large length. Data flows can be on a push basis or pull basis, or a combination, and may change depending on the state.

Abstract: Garbage collection of objects within the heap of a computing system, and movement of adjacent sets of live objects as a whole in order to perform compaction. The compaction may be performed even if there are adjacent sets of live objects that include one or more pinned objects that should not be moved by the garbage collector. The garbage collector uses gaps to include relocation information with respect to sets of adjacent objects of the same pinned status. Some gaps may be formulated by writing over the live objects themselves, in which case that written over data is saved off prior to formulating the gap. When compaction is performed, the saved off data is used to fully integrate the adjacent objects of the same pinned status in the process of compaction.

Abstract: A system for exploring data receives the data from a database and indexes the data in a server. The system displays one or more selectable datasets from the indexed data, where the selectable datasets include a plurality of attributes. The system receives a selection of one of the plurality of attributes. The system then sorts the one or more attributes by level of interestingness relative to the selected attribute, and displays the sorted attributes.

Abstract: A data placement device creates a similarity index for each of computational resources based on a similarity between each of the pieces of acquired data and each of the pieces of data stored in the computational resources. The data placement device allocates on the basis of the similarity index of each of the computational resources with respect to the pieces of the data, the pieces of the data to each of the computational resources by using a matching system in which the similarity index associated with each allocation becomes stable in a direction in which the similarity index is small. The placement device places the pieces of the acquired data into the computational resources on the basis of the allocation result.

Abstract: An embodiment of the invention provides an apparatus and method for classifying a workload of a computing entity. In an embodiment, the computing entity samples a plurality of values for a plurality of parameters of the workload. Based on the plurality of values of each parameter, the computing entity determines a parameter from the plurality of parameters that the computing entity's response time is dependent on. Here, the computing entity's response time is indicative of a time required by the computing entity to respond to a service request from the workload. Further, based on the identified significant parameter, the computing entity classifies the workload of the computing entity by selecting a workload classification from a plurality of predefined workload classifications.

Abstract: The subject matter disclosed herein provides methods for identifying the type of content found in a database or source file having data records. A source file having one or more data records may be accessed. The data records may be associated with one or more data values arranged into columns. One or more data types may be proposed for at least one column by examining the data values in the column. A confidence score may be calculated for each proposed data type. The proposed data types may be arranged into a prioritized list based on each data type's confidence score. One or more rules may be applied to the column to finalize priorities of the proposed data types. The rules may be applied without referring to the data values in the column. Results may be provided based on the finalized priorities. Related apparatus, systems, techniques, and articles are also described.

Abstract: A system involves a network-connected service platform including a computerized server, a processor operating in the computerized server, executing instructions from a non-transitory physical medium, a data repository coupled to the network-connected server, a programmable interface operable in the service platform, enabled for two-way communication with a content platform, enabling the service platform to access and retrieve data from the content platform, and classification data and profile data stored in the data repository.

Abstract: For an augmented reality (AR) content creation system having a marker database, when a user requests this system to use a first sub-image of an image to update the marker database, this system computes a suitability score of the first sub-image for rating feature richness of the first sub-image and uniqueness thereof against existing markers in the marker database. When the suitability score is less than a threshold value, a second sub-image of the image having a suitability score not less than the threshold value and completely containing the first sub-image is searched. Then the second sub-image, the suitability score thereof and the suitability score of the first sub-image are substantially-immediately presented to the user for real-time suggesting the user to use the second sub-image instead of the first sub-image as a new marker in updating the marker database to increase feature richness or uniqueness of the new marker.

Abstract: Validation rules are specified for validating data included in fields of elements of a dataset. Cells are rendered in a two-dimensional grid that includes: one or more subsets of the cells extending in a direction along a first axis, each associated with a respective field, and multiple subsets of the cells extending in a direction along a second axis, one or more of the subsets associated with a respective validation rule. Validation rules are applied to at least one element based on user input received from at least some of the cells. Some cells, associated with a field and a validation rule, can each include: an input element for receiving input determining whether or not the associated validation rule is applied to the associated field, and/or an indicator for indicating feedback associated with a validation result based on applying the associated validation rule to data included in the associated field.

Abstract: Methods, systems and computer program products for using a selected cohort of content consumers to rate a media object is provided by identifying a media object, determining a first value, where the first value is equal to a number of content consumers who belong to a cohort and who have played the media object, determining a second value. The second value is equal to a total number of content consumers who played the media object. A rating is computed using the first value and the second value.

Abstract: A system, method, and computer-readable medium for optimized processing of queries that feature maximum or minimum equality conditions are provided. The disclosed mechanisms provide for a single-scan of the table on which the group-by query is applied. When the table is scanned, each processing module dynamically keeps track of the row(s) having a value of the attribute on which the equality condition is applied that equals or exceeds the maximum attribute value (assuming a maximum equality condition is applied) previously encountered by the processing module. Subsequently, a global aggregation process is then performed to compute the query's result without rescanning the table. Queries featuring a minimum equality condition are similarly processed in accordance with the disclosed embodiments.

Abstract: Methods and apparatus are provided for authenticated pattern matching and authenticated exact path queries on outsourced data by a third party server. A source of the outsourced data computes verification information for node and suffix accumulators and sends the data, accumulation values and suffix tree or label trie information to the server; and publishes its public key and the verification digests. The verification may comprise an accumulation tree (AT) or any other public key authentication scheme, such as digital signatures, Merkle Trees and publishing the accumulation values. The server receives the query from a client and the server computes an answer ? to the query and a verification proof that are provided to the client. The client then verifies the answer.

Abstract: A system and method is described for database split generation in a massively parallel or other 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: A method is used in managing file deletions in storage systems. A request to delete a portion of a file of a file system is received. A first indirect block is associated with the portion of the file and includes a set of file system blocks. A second indirect block associated with a replica of the file is identified. The first and second indirect blocks share a subset of the set of file system blocks. The replica of the file represents a state of the file at a particular prior point in time. Metadata of the second indirect block is updated indicating that the subset of the set of file system blocks are no longer shared between the first and second indirect blocks.