Abstract: A method for deduplication applicable to a file chunked into a plurality of deduplicated chunks is provided and includes: defining a calculation range in the file according to types of the chunks in the file, where the calculation range includes a plurality of consecutive chunks in the file; generating an evaluation value according to the types of the chunks in the calculation range to determine whether to mark the chunks in the calculation range; and re-chunking and deduplicating the marked chunks in the file. A computer-readable medium and a file system corresponding to the method for deduplication are also provided.

Abstract: An event historian system receives event data from a client system via a network connection and stores the event data in a block data storage system. An event data block in which to store the received event data is selected based on the time range of the occurrence of the received event data. The received event data is stored in a snapshot within the event data block. Event property data is extracted from the received event data and used to build a plurality of event property index files.

Abstract: A system for improving a distributable model with distributed data is provided, comprising a network-connected distributable model source configured to serve instances of a distributable model; and a directed computation graph module configured to receive at least an instance of the distributable model from the network-connected computing system, create a cleansed dataset from data stored in the memory with at least biases within the data stored in memory corrected, train the instance of the distributable model with the cleansed dataset, and generate an update report based at least in part by updates to the instance of the distributable model.

Abstract: Unsorted sparse dictionary encodings are transformed into unsorted-dense or sorted-dense dictionary encodings. Sparse domain codes have large gaps between codes that are adjacent in order. Unlike spare codes, dense codes have smaller gaps between adjacent codes; consecutive codes are dense codes that have no gaps between adjacent codes. The techniques described herein are relational approaches that may be used to generate sparse composite codes and sorted codes.

Abstract: In response to receiving a request for an identity key from a first entity, an identity key for the first entity is generated. A first request from the first entity to replicate a set of data is received. The generated identity key for the first entity is added to the metadata of the set of data requested to be replicated. A determination is made whether a replication rule exists for the first entity. In response to determining that a replication rule exists for the first entity, the set of data is replicated according to the replication rule for the first entity.

Abstract: A method includes receiving a series of writes that each requests respective data to be stored at a database. For each respective write, the method includes storing the respective data in a first buffer associated with a first data streaming application and a second buffer associated with a second data streaming application. The method includes transmitting the respective data to the database. The method includes receiving, from the database, confirmation that the respective data of the respective write has been committed to the database. The confirmation includes an order indicator indicating an order the respective data of the respective write was committed to the database relative to other writes in the series of writes. In response to receiving the confirmation, the method includes sending the respective data from the first buffer to the first data streaming application and from the second buffer to the second data streaming application.

Abstract: A streaming ingest platform can improve latency and expense issues related to uploading data into a cloud data system. The streaming ingest platform can organize the data to be ingested into per-table chunks and per-account blobs. This data may be committed and may be made available for query processing before it is ingested into the target source tables. This significantly improves latency issues. The streaming ingest platform can also accommodate uploading data from various sources with different processing and communication capabilities, such as Internet of Things (IOT) devices.

Abstract: In one embodiment, a method includes, by one or more computing systems, receiving, from a client system via an assistant xbot, a first audio input from a user, parsing the first audio input to identify a request for a content digest from an online social network, retrieving a plurality of content objects from the online social network, each of the content objects being accessible by the user, generating a customized newsfeed summary based on a determined semantical meaning of each of the plurality of content objects, and sending, to the client system via the assistant xbot, instructions for presenting an audio clip to the user responsive to the request for the content digest, wherein the audio clip comprises the customized newsfeed summary.

Abstract: The technology disclosed relates to streamlined analysis of security posture of a cloud environment. In particular, the disclosed technology relates to a data schema detection system that uses a content-based data classifier to classify data items in a cloud environment. A computer-implemented method includes accessing a data store in the cloud environment and obtaining metadata representing a structure of schema objects in the data store. The method includes executing, based on the metadata, a content-based data classifier to classify data items in the schema objects and outputting a classifier result that represents the classification of the data in the schema objects.

Abstract: A technique for automated preparation of tabular data for machine learning, including options for machine learning derived infill, feature importance evaluations, and/or dimensionality reduction. Validation data sets may be consistently prepared to training data sets based on properties of the training data saved in a metadata database. Additional data sets may be consistently prepared to training data sets based on properties of the training data saved in a returned metadata database such as for use in generating predictions from the trained ML system. Returned data sets may be prepared for oversampling of labels with lower frequency occurrence. Columns of a training data set are evaluated for appropriate categories of transformations, with the composition of transformation function applications designated by a defined tree of transformation category assignments to transformation primitives.

Abstract: Embodiments facilitating data exploration in a computing environment by a processor. A multidimensional dataset may be received. The multidimensional dataset may be processed according to booting operation parameters. A visualization and exploration of an interactive representation of one or more probabilistic models using multidimensional dataset.

Abstract: A method includes executing, by a computing device, a reorganization command within an environment; monitoring, by the computing device, unprocessed replication transactions within the environment; determining, by the computing device, whether the unprocessed replication transactions exceed a threshold; and pausing, by the computing device, the executing the reorganization command in response to determining the unprocessed replication transactions exceed the threshold.

Abstract: The present invention provides for employing SQL to introduce blockchain technologies into a relational database, and thereby leverage the inherent tamper-resistant properties of blockchain, without the need to completely rewrite existing or legacy relational database software. The invention creates a relational database inside of a blockchain and uses a conventional SQL interface for standard database operations. This reduces the burden of introducing blockchain technologies, while providing the benefits of the intrinsic security and verification features of blockchain technology. The invention provides a rich historical record of every transaction thereby greatly reducing, if not eliminating, the relational database's susceptibility to tampering. This allows for temporal queries on arbitrary records within the database and the generation of reports and audits for any point in the history of the database.

Abstract: Updates for transactions to a replication log for a database may be amortized. As updates are received as part of an active transaction, replication log records may be generated. When the size of replication log records exceeds a transaction size threshold, the replication log records may be stored in a remote data store instead of a local data store. When a request to commit the active transaction is received, an replication log for the database may be updated to include the replication log records from a transaction data object in the remote data store.

Abstract: Storage management techniques involve determining, if it is determined that lock information associated with a lock operation performed on an object is to be inserted into a storage device, a target digest for representing the lock information; determining whether an idle index not associated with a historical digest exists in an index array for indicating a plurality of storage positions in the storage device; and inserting, if it is determined that an idle index exists in the index array, the lock information into a target storage position in the plurality of storage positions by associating the target digest with the idle index. Accordingly, lock information can be quickly inserted and cleared, thereby improving the system performance.

Abstract: A method for deduplicating a distributed ledger, a blockchain, and a computer program product. One embodiment may comprise splitting a new block on a distributed ledger into a plurality of partitions, comparing the plurality of partitions to a deduplication (dedup) map, replacing a first partition of the plurality of partitions with a first reference to the dedup map to produce a transformed block, and communicating the transformed block via a network interface to one or more peers.

Abstract: Methods, systems, and apparatus, including computer programs stored on computer-readable media, for providing contextually-relevant database content. Techniques are described for monitoring conditions of a computing device and detecting when database content is relevant to a current context of the computing device. In some implementations, a first computing device is monitored to detect actions of the first computing device that involve calendar data for a user. In response, a determination that text corresponding to the calendar appointment includes a term associated with a particular entity is made. Data for a user information card including information related to the particular entity is obtained. The first computing device is then caused to display the user information card or an interactive control configured to initiate display of the user information card.

Abstract: The subject technology performs a locking operation on a first set of keys by a first statement of a first transaction. The subject technology determines that a conflict occurred between the first statement and a second transaction. The subject technology determines that the second transaction has yet to complete after a predetermined period of time. The subject technology performs a deadlock detection process where the subject technology stores a key and value in a table indicating the first transaction and the second transaction, detects, based at least in part on a graph traversal of the table starting from the first transaction, a cycle between the first transaction and the second transaction, and determines that the first transaction is a youngest transaction in the detected cycle. The subject technology ceases execution of the first transaction in response to the first transaction being a youngest transaction in a detected cycle.

Abstract: To reduce the amount of data traffic flowing between a remote computing platform and a client device, a manager for a data store of the client device is configured to observe upserts to the data store for one or more objects for a current connection session reflected therein; track fresh objects of a plurality of objects stored within the local data store, wherein fresh objects are identified as having an upsert during the current connection session; observe gets from the data store for one or more objects of the plurality of objects, and upon detecting a get for a particular object, determining whether the particular object is fresh, and if the object is detected to be stale, initiate an upsert from the remote computing platform to the data store for the particular object.

Abstract: A method for a multi-tenant server to manage data in a peer-to-peer blockchain network is described. The method includes monitoring one or more fields of a first physical object of a first tenant in the peer-to-peer blockchain network to determine when one or more conditions of a smart contract have been fulfilled; determining that one or more conditions of the smart contract have been met by the first physical object of the first tenant; and performing one or more operations of the smart contract, which are associated with the one or more conditions, in response to determining that the one or more conditions of the smart contract have been met by the first physical object of the first tenant, wherein the one or more operations are performed in relation to a second physical object of a second tenant in the peer-to-peer blockchain network.