Abstract: A method for execution by a node of a computing device includes determining a plurality of queries for concurrent execution. A plurality of sets of segments required to execute the plurality of queries is determined, and a set of virtual segments in the plurality of sets of segments is determined. A subset of the set of virtual segments is be determined by identifying ones of the set of virtual segments that are required to execute multiple ones of plurality of queries. A locally rebuilt set of rows for each of the set of virtual segments is generated by utilizing a recovery scheme. For each one of the set of virtual segments included in the subset, in response to generating the locally rebuilt set of rows, concurrent partial execution of corresponding multiple ones of the plurality of queries is facilitated.

Abstract: Optimized query plans may be generated independent of the query engine that performs the optimized query plan. A request to generate an optimized query plan for a query may be received and a type of engine for performing the query may be identified. An initial plan may be generated in an engine-specific format for the type of engine that is translated into an optimization plan format. An analysis of the initial plan optimization plan format may be performed to generate an optimized query plan. The optimized query plan may be translated into the engine-specific format and sent in response to the request for the optimized query plan.

Abstract: Systems and methods for granularly recovering a backup are provided. An image of a backup is mounted as a file system such that the files can be granularly restored. Image-level recovery and file-level recovery can be achieved from the same backup. The backup may also be de-duplicated.

Abstract: Systems, methods, and non-transitory computer-readable media can generate at least one fingerprint based on a set of frames corresponding to a test content item, generate a set of distorted fingerprints using at least a portion of the fingerprint, and determine one or more reference content items using the set of distorted fingerprints, wherein the test content item is evaluated against at least one reference content item to identify matching content.

Abstract: Various technologies and techniques are disclosed for creating and managing persistent document collections. A data store is used for storing one or more persistent document collections. A content management application is used for managing documents for users, for creating one or more persistent document collections of a sub-set of the documents upon user request, and for storing the one or more persistent document collections in the data store. Users can create one or more persistent document collections from a sub-set of the documents. Users can also modify the one or more persistent document collections. A requested portion of one or more persistent document collections can be output upon request from an external application so that the external application can download one or more of the documents that are represented by the persistent document collection for further modification by the user.

Abstract: In managing a relational database, a relational manager sets a foreign key lookup value to an unavailable state in a source table row containing each of a foreign key value and the foreign key lookup value in a source table in a relational database, wherein the foreign key value references a primary key value in a referenced row in a separate destination table in the relational database. The relational manager, responsive to looking up, for the foreign key value, in a data structure separate from the source table, a location of the referenced row in the relational database, when the foreign key lookup value is set to the unavailable state, updating the foreign key lookup value with the location, wherein the foreign key lookup value in the source table is looked up for identifying the location of the referenced row for subsequent retrievals of the referenced row for the foreign key value.

Abstract: Methods and systems for maximizing data utility efficiency to maximize dynamic application of content in a database as applied to a validation are disclosed herein. A system for maximizing data utility efficiency to maximize dynamic application of content in a database as applied to a validation can include a memory having a first database containing information identifying a plurality of topics and a second database containing a plurality of content items. The system can further include a server that can maximize data utility efficiency by identifying multipurpose content items.

Abstract: Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data.

Abstract: Methods and systems for simplifying object mapping for user interfaces are described. Client requests can be accepted from the client computers to access a resource of an application dialogue language (ADL). The client requests can be distributed across participating back ends. Each client request can be evaluated by the ADL before an ADL result is returned. If a governor does not detect a violation, expressions can be analyzed to determine whether any expression can be calculated locally by the ADL to produce the ADL result. The ADL result can be associated to a logical object in order to minimize a representational gap between each client request and a physical object. The logical object can be converted to the physical object, and the physical object can be mapped to the relational database. A response to each client request can be produced based on the mapping between the physical object and the relational database.

Abstract: Disclosed are methods and apparatuses to provide a redo repeater that allows for no data loss protection without the performance impact to the primary database even when a significant geographical distance separates the primary and standby databases. The Repeater is a lightweight entity that receives redo from the primary database with the purpose of redistributing that redo throughout the primary/standby system configuration. The Repeater able to extend no data loss protection and switchover functionality to terminal standby databases even though the primary database does not need to have a direct connection with those destinations.

Abstract: A social networking system provides relevant third-party content objects to users by matching user location, interests, and other social information with the content, location, and timing associated with the content objects. Content objects are provided based on relevance scores specific to a user. Relevance scores may be calculated based on the user's previous interactions with content object notifications, or based on interests that are common between the user and his or her connections in the social network. Context search is also provided for a user, wherein a list of search of results is ranked according to the relevance score of content object associated with the search results. Notifications may also be priced and distributed to users based on their relevance. In this way, the system can provide notifications that are relevant to user's interests and current circumstances, increasing the likelihood that they will find content objects of interest.

Abstract: A computer-implemented method for importing data for an Entity Relationship (E-R) model includes receiving an exported E-R model data file of the E-R model, and determining a dependency type correlation of an entity and importing the entity directly if the determined dependency type is one of weak correlation and no correlation. The method also includes determining whether the imported entity with no correlation or weak correlation affects an entity recorded in a strong correlation table, and storing the entity in the strong correlation table until a minimum reference number of a strong correlation is satisfied if the dependency type correlation is strong. The method further includes importing the entity recorded in the strong correlation table, and deleting the entity recorded in the strong correlation table from the strong correlation table when the imported entity with no correlation or weak correlation affects an entity recorded in the strong correlation table.

Abstract: The present disclosure provides systems, methods, and products for high performance implementation of traffic management rules. In various embodiments, traffic management rules, such as DNS traffic management rules, are functionally expressed as rows in one or more lookup tables that are deployed to DNS resolution servers. The DNS resolution server uses the domain name, resource record type, traffic management rule types, and/or traffic management variable values to search for or look up an answer, from among multiple answers corresponding to the domain name and resource record type that meets the traffic management criteria. This look up is done without executing conventional traffic management code or scripts.

Abstract: The claimed subject matter provides a system and method for automatic allocation of tenants to database services. An exemplary method comprises determining a query plan based on a workload for each tenant. A distance metric is created based on the query plan for each tenant, and tenants are clustered based on the distance metric into a predetermined number of clusters which is equal to the predetermined number of databases.

Abstract: A method for collecting monitoring data on a set of monitored computers. The method comprises providing definitions for collection methods for a set of monitoring data, wherein the monitoring data is collected from agents running at monitoring computers, wherein each item of monitoring data has at least one respective collection method. The method further comprises determining a subset of monitoring data to be updated. The method further comprises identifying collection methods corresponding to the subset of monitoring data and triggering the agents running at the monitoring computers to collect monitoring data using the identified collection methods.

Abstract: In an approach for manipulating columns in a projection list in a database result set, a processor receives a database request having a projection operation for a plurality of columns in one or more tables, wherein the projection operation comprises a SELECT statement having a column list that includes having (a) a shorthand that specifies the plurality of columns and (b) a column sequence clause that specifies a column name from the plurality of columns and a resulting column position. A processor retrieves data records having the plurality of columns including the specified column name and the resulting column position. A processor generates a result set comprised of the data records having the plurality of columns, such that for the result set, values within the specified column name are inserted into the result set at the resulting column position.

Abstract: According to an embodiment, a search device searches paths of a digraph and includes a retriever, and an expander. The retriever is configured to, from among hypotheses stored in a storage, retrieve, as a target hypothesis, a single hypothesis for which a weight obtained by addition of a weight of an already-searched path corresponding to each hypothesis and a weight of the best path from a state of the head of concerned path to a final state is the best weight. The expander is configured to, when the retrieved target hypothesis is not a final hypothesis for which the search has been completed up to a final state, generate new hypotheses each holding an input symbol string that is present in a path in which the search has been performed from states held by the target hypothesis until finding a single input symbol, and write the generated hypotheses in the storage.

Abstract: In an approach to backup and restore one or more clone file trees, one or more processors generate a clone management table. One or more processors record a clone management information in the clone management table about each clone file. To backup a clone file, one or more processors update the clone management information, and store one or more data blocks that are in the clone file trees. To restore a clone file, one or more processors analyze a clone management information and restore one or more data blocks in the clone file. To restore a clone file parent, one or more processors analyze a clone management information and restore one or more data blocks in the clone file parent. To restore a clone file tree, one or more processors analyze a clone management information and restore one or more data blocks in the clone file tree.

Abstract: In an approach to backup and restore one or more clone file trees, one or more processors generate a clone management table. One or more processors record a clone management information in the clone management table about each clone file. To backup a clone file, one or more processors update the clone management information, and store one or more data blocks that are in the clone file trees. To restore a clone file, one or more processors analyze a clone management information and restore one or more data blocks in the clone file. To restore a clone file parent, one or more processors analyze a clone management information and restore one or more data blocks in the clone file parent. To restore a clone file tree, one or more processors analyze a clone management information and restore one or more data blocks in the clone file tree.

Abstract: A computer querying stored information by application of a user-defined importance condition, a preference probability in relation to a user-defined preference condition, and a user-defined target condition is provided. The computer may perform a search operation, filtering operation, and matching operation based on a result of the querying and generate a search result, filtering result, and matching result. The computer may also generate an indication of a ranking of the search result, filtering result, and matching result.