Abstract: Methods and a system are provided. A method includes automatically detecting, by an attribute structural variation detector, attribute structural variations in record schemas of a database lacking schema enforcement. The automatically detecting step includes encoding, by an encoder, nodes in the record schemas based on respective updated node labels to obtain a plurality of codes. The automatically detecting step further includes clustering, by a clusterer, the plurality of codes into one of a used category and an unused category. The used category and the unused category respectively consist of any of the plurality of codes used or unused to update a child label. The automatically detecting step also includes, when an intersection set formed from the used and unused categories has at least one member, retrieving, by the attribute structural variation detector, the at least one member as a structural variation between at least two of the record schemas.

Abstract: Technologies for computing rolling hashes include a computing device having a first hash table that includes a first plurality of random-valued entries and a second hash table that includes a second plurality of random-valued entries. The computing device retrieves a block of data from a data buffer and generates a hash based on the block of data, a previously generated hash, the first hash table, and the second hash table. The computing device further determines whether the generated hash matches a predefined trigger and records a data boundary in response to a determination that the generated hash matches the trigger.

Abstract: A stateful cluster may implement scaling of the stateful cluster while maintaining access to the state of the stateful cluster. A scaling event for a stateful cluster may be detected, and in response the stateful cluster may be adjusted to include a different number of nodes. The state of the cluster may then be logically distributed among the different number of nodes according to a monotone distribution scheme. The adjusted node may then service access requests according to the monotone distribution scheme. Prior to making the adjusted storage cluster available for servicing access requests, the nodes from the original cluster may still service access requests for state.

Abstract: The present disclosure provides systems and methods for Key-Value-Tuple-encoded (KVT-encoded) object storage. In accordance with an embodiment of the invention, chunks of objects, storing payload data or metadata, are persistently stored by servers using KVT-encoded storage. Furthermore, the KVT encoding may be applied to advantageously re-structure content within a distributed object storage cluster, especially for object storage systems that allow payload references to be cached extensively. For such systems, it is of considerable value to honor (use as valid) existing chunk references after the underlying content has been re-structured. Further, the KVT encoding taught herein is completely compatible with a fully-distributed object storage cluster. One embodiment relates to a storage server that includes a persistent storage module that provides a key-value application programming interface that encodes multiple key-value-tuple (KVT) entries for one chunk.

Abstract: Computer implemented methods for executing a database query in a database using an electronic computing device are presented, the method including: causing the electronic computing device to provide at least one data structure including at least one object having at least two properties of different data types; identifying a property of the at least one data structure that includes the smallest unique values in terms of type of data stored in that particular property; executing the database query, including any limiting parameters, configured to retrieve only data from the property including the smallest unique values that are retrievable for a record; retrieving a predefined number of results of the executed database query; and for each set of predefined number of retrieved results, executing a new database access thread that is configured to retrieve data that are present in the records identified with the smallest unique values.

Abstract: A session search relevance model identifies a user's dynamic information need based on a feedback model and a session relevance model. The feedback model is based on query changes in the session search and user interest in particular documents presented throughout the session search. The relevance model modifies a user's current query to retrieve documents most relevant to a user's information need.

Abstract: A data store may implement incremental out-of-place updates to a dataset. A dataset may maintain data across different storage locations linked together according to an ordering schema for servicing queries. As updates to the dataset are received, the updates may be persisted but not maintained in-place. In order to update the data store and maintain the ordering schema, incremental updates to the dataset may be performed without blocking queries directed toward the dataset. The dataset may be divided into multiple data chunks that correspond to different storage locations and an updated version of the data chunk may be generated in new storage locations. The new storage locations may then replace the storage locations of the prior version of the data chunk in order to link the new storage locations to the other linked storage locations in the dataset for servicing queries.

Abstract: Incremental, out-of-place updates may be implemented for index structures maintained for data stores. Portions of the index structure may be selected for updating, and an updated version of the portion of the index structure generated in another storage location different than a current storage location for the index structure such that the index structure may be searched in order to perform access requests. Updating the portion of the index structure may include compacting the portion of the index structure and/or merging the portion of the index structure with a sub-index structure generated from a portion of a log of index updates that may be maintained. The current portion of the index structure may then be replaced with the updated version of the current portion so that the updated version may be evaluated when searches of the index structure are performed.

Abstract: In one embodiment, a computer-implemented method includes selecting one or more sub-expressions of a query during compile time. One or more pilot runs are performed by one or more computer processors. The one or more pilot runs include a pilot run associated with each of one or more of the selected sub-expressions, and each pilot run includes at least partial execution of the associated selected sub-expression. The pilot runs are performed during execution time. Statistics are collected on the one or more pilot runs during performance of the one or more pilot runs. The query is optimized based at least in part on the statistics collected during the one or more pilot runs, where the optimization includes basing cardinality and cost estimates on the statistics collected during the pilot runs.

Abstract: Embodiments relate to joining data across a parallel database and a distributed processing system. Aspects include receiving a query on data stored in parallel database T and data stored in distributed processing system L, applying local query predicates and projection to data T to create T?, and applying local query predicates and projection to L to create L?. Based on determining that a size of L? is less than a size of T? and that the size of L? is less than a first threshold, transmitting L? to the parallel database and executing a join between T? and L?. Based on determining that a number of the nodes distributed processing system n multiplied by the size of T? is less than the size of L? and that the size of T? is less than a second threshold; transmitting T? to the distributed processing system and executing a join between T? and L?.

Abstract: An information management system provides a data deduplication system that uses a primary table, a deduplication chunk table, and a chunk integrity table to ensure that a referenced deduplicated data block is only verified once during the data verification of a backup or other replication operation. The data deduplication system may reduce the computational and storage overhead associated with traditional data verification processes. The primary table, the deduplication chunk table, and the chunk integrity table, all of which are stored in a deduplication database, can also ensure synchronization between the deduplication database and secondary storage devices.

Abstract: Computer implemented methods for storing ad hoc relations between previously unrelated database objects assigned to different database structures using an electronic computing device are presented, the methods including: causing the electronic computing device to define at least three database structures: structure A, structure B and structure C, where each of the at least three database structures each includes a number of objects, where there exists at least one relation between objects of structure A and objects of structure B, and where there exists at least one relation between objects of structure B and objects of structure C; filtering data of structure A; accessing structure B using a first selected relation between structure A and structure B; storing information about filtering of structure A and information on a first selected path between structure A and structure B; filtering results obtained from structure B.

Abstract: An apparatus, system, and method for distributing authority for data objects. Each of the data objects in a replication set is stored at a different data storage site and comprises a copy of a content. An edit authority is assigned to only one of the data storage sites at a time using an edit authority object corresponding to the replication set that is transferable between the data storage sites. Responsive to a change to the content of a data object located at a particular data storage site having the edit authority, an update is propagated to a remaining portion of the data storage sites to affect eventual consistency of the replication set. Usability of the data objects at the remaining portion of the data storage sites is maintained until the update is received and processed to thereby reduce a time and expense associated with maintaining data consistency.

Abstract: In an embodiment, a method of electronically visualizing a life history includes, using a processor, generating a first visual representation of a first life history as a function of a first set of multiple events that are defined by event data stored in a tangible storage medium. Each event is identified within the event data as being one of a positive life event and a negative life event. Within the event data, each event is associated with an age within the first life history.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining when to implement native application that has been identified in response to a search query, the implementation occurring without user intervention. The implementation may involve installing and launching a native application on a user device in response to a query, or launching a native application already installed on a user device in response to the query.

Abstract: In one aspect, a method includes sending a first short hash handle and a first identity bit associated with the first short hash handle to a replication site, determining if a second hash handle is identical to the first short hash handle, determining if a second identity bit associated with the second short hash handle at the replication is set if the second short hash handle is identical to the first short hash handle and using the second hash handle to identify the data if the second identity bit being is set. The first short hash handle is an identifier of data stored on a disk.