Abstract: A System, Computer Program Product, and Computer-executable method for managing an object based storage within a cloud storage provider, the System, Computer Program Product, and Computer-executable method including receiving a data I/O, determining whether the data I/O relates to an existing object within the object based storage, if the data I/O relates to an existing object, updating a stream and existing data object in the object based storage, and creating a new data object and key based on the data I/O and updating the object based storage.

Abstract: Various embodiments of dynamically switching between query and scan for optimizing table reads are described. A particular client of a shared table can use various criteria in determining whether to query for individual entries in a table, or whether to scan the entire table. Criteria can be, in some embodiments, whether there are fewer than a threshold number of other clients accessing the same portion of the table as the particular client, or the size of the portion accessed by the client. If there are fewer than a threshold number of other clients accessing the same portion of the table, and the size of the portion is below a size threshold, for example, then querying individual entries in the table might be appropriate in those circumstances. By querying instead of scanning, for example, clients can reduce the total number of I/O operations per second on the shared table.

Abstract: A method and apparatus for processing packets in a network are disclosed. For example, the method scans one or more packets representing a content that is being transferred via the network, where the scanning acquires one or more content elements. The method then builds a keyterm index from the one or more content elements, and stores the keyterm index in a repository. A query handler then responds to queries in accordance with the keyterm index.

Abstract: Disclosed herein is a system and method for interoperability of blockchains thereby allowing use of smart contracts across blockchains in real time and in a secured manner. A plurality of blockchains are connected to each other and allow use of smart contracts written on them by other connected blockchains without the need of rewriting and/or downloading the smart contract on other blockchain. The disclosed system and methods use a distributed file system storage for secured processing of information flowing from one blockchain to other connected blockchain. Further, each connected blockchain is associated with distinct private and public key in order to encrypt and decrypt the data flowing across blockchains.

Abstract: A system for updating a file and resolving conflict in updating of the file in a distributed file store is disclosed. The system includes a receiver, an updater, and a conflict detector. The receiver receives the file formed of a plurality of extents to be updated. An extent is indicative of a piece of data content of the file and formed of a plurality of packets of substantially equal size. The receiver further receives instructions indicative of one or more extents of the file in which the updates are to be made. The updater updates one or more packets, based on the instructions. The conflict detector detects that a portion of the file is being currently updated, receives a request to update the same portion from another application, and decline the request by the other application to update the same portion to resolve the conflict.

Abstract: Described herein are systems and methods for multi-dimensional analysis of complex data sets to generate multi-factorial overlap intervals used in lookup tables to classify input data. Also disclosed are systems and methods for provisioning searchable databases comprising the multi-factorial overlap intervals through a distributed network for remote access.

Abstract: Techniques and solutions are described for providing integration objects that can be used to enhance data retrieval, and can be used to provide shared data access for multiple applications, and to allow access to application functionality through an interface. The integration object includes a plurality of integration data objects, at least a portion of which are mapped to data objects stored in one or more data sources. The integration data objects can hold values stored in correspondingly mapped locations of the data objects, such as in a value field. A reference field of the integration data objects can hold reference information regarding a location of a value in a respectively mapped data source. At least a portion of the integration data objects can include a defined sequencing with one or more other integration data objects.

Abstract: In an embodiment of the present invention, a command for performing a database operation with respect to a table of a database is received, whereby the table has a visible key column for identification information and one or more invisible token columns for token information. The user's role from the command is obtained. A record is identified in the table based on a combination of the identification information and the token information corresponding to the user's role. The database operation is performed on the identified record.

Abstract: A data storage and retrieval system employs online supervised hashing for indexing a data set and retrieving data items therefrom. A hash-based mapping is used to generate hash codes for indexing content items. Data items may be retrieved based on either/both a query label (using corresponding codewords) and the content item itself (using the hash codes). The hash-based mapping is updated using an objective function of distance between the hash codes and respective codewords for labels of labelled content items, preserving semantic similarities of content items. The codewords may be error-correcting codes. Techniques for efficiently updating the index include (1) cycle-based updating and ternary codewords, and (2) reservoir sample-based method of determining when to trigger an update.

Abstract: Various systems, methods, and processes for caching and referencing multiple fingerprints while data operations are ongoing are disclosed. A first fingerprint is generated based on a first fingerprinting process. The first fingerprint is stored in association with a second fingerprint, which is based on a second fingerprinting process. The first fingerprint and the second fingerprint are associated with the same data segment. Data operations such as a backup operation, a restore operation, or a replication operation can be performed while the conversion of the data segment from the second fingerprint to the first fingerprint is ongoing.

Abstract: The present technology pertains to automatically contextlabeling media items with relevant contexts, and further for algorithmically generating high quality playlists built around a context that are personalized to a profile of an account. This is accomplished by combining data from observed playlists, and data representing intrinsic properties of media items to predict contexts for media items.

Abstract: A distributed file system is provided having multi-stream object-based data upload. A distributed file system comprises a plurality of client processing nodes, wherein one or more of the plurality of client processing nodes selectively operate in one or more of an object-based mode and a POSIX-style mode; and a plurality of storage nodes, wherein one or more of the plurality of client processing nodes transfer multiple portions of the same data entity (e.g., an object or a file) substantially simultaneously to one or more of the storage nodes. A uniform interface is optionally provided to access the object-based mode and the POSIX-style mode. The multiple portions of the same data entity comprise blocks and multiple blocks can be committed substantially simultaneously in parallel. Committed data containing an error that was uploaded using the object-based mode becomes unavailable for further object-based access until the error is repaired using the POSIX-style mode.

Abstract: The disclosed computer-implemented method for performing a database backup for repairless restore may include (1) receiving replica data records representing copies of a database from each of a group of data storage nodes in a production cluster, (2) processing the replica data records in parallel without inter-node communication between the data storage nodes, (3) merging updates to the replica data records, (4) identifying stale or redundant data records in the updated replica data records, (5) discarding the stale or redundant data records from the updated replica data records to create a single copy of updated data records, and (6) restoring the copy of the updated data records to the production cluster by replicating the updated data records to the data storage nodes such that each of the updated data records is consistent thereby obviating subsequent repair. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: System and method are disclosed for stream computing. An exemplary method may include receive data from a data processing module and determining whether the received data are effective data that are neither incomplete nor duplicative. The method may also include obtaining the effective data when it is determined that the received data are either incomplete or duplicative. In addition, the method may include storing the effective data in a log file of a file system.

Abstract: This data conversion system is characterized by including: a storage unit that stores a column including a plurality of data elements; a range specification module that specifies the range of each of the data elements of the column; an information amount evaluation module that calculates the information amount of the data element within the specified range of the column; and a change point detection module that detects a point at which a change in the information amount according to a change in the specified range satisfies a predetermined condition.

Abstract: Deleting a data record from the second level storage or main store is disclosed. A look-up is performed for the data record in the first level storage, where the data record is defined by a row identifier. If the row identifier is found in the first level storage, a look-up is performed for an updated row identifier representing an update of the data record in the second level storage and the main store, the update of the data record being defined by an updated row identifier. If the updated row identifier is found in the second level storage, an undo log is generated from the first level storage to invalidate a row identifier of the row identifier. A flag is generated representing an invalid updated row identifier, and a redo log is generated to restore the data record in the first level storage.

Abstract: A system and method of logless atomic data movement. An internal transaction is started within a multi-level storage architecture, the internal transaction to merge data from the first level storage structure to the second level storage structure. Committed data is read from a first level storage structure of the multi-level storage architecture as specified by the internal transaction. The committed data from the first level storage structure is inserted into a second level storage structure in a bulk insertion process, and the committed data is marked as being deleted from the first level storage. The internal transaction is then committed to the multi-level storage architecture when the committed data has been inserted into the second level storage structure.

Abstract: System creates three tries based on values stored in first three fields by records. System associates node in third trie with record, based on value stored in third field by record. System associates node with first dispersion measure, based on values stored in first field by records associated with node, and with second dispersion measure, based on values stored in second field by records associated with node. System identifies branch sequence in third trie as key for prospective record, based on value stored in third field by prospective record. System uses key to identify a subset of records that match prospective record. If a count of the subset exceeds threshold, the system identifies other branch sequence in first trie or second trie as other key for prospective record, based on first dispersion measure and second dispersion measure. System uses the key and the other key to identify at least one record that matches prospective record.

Abstract: A system identifies a first number of distinct values stored in a first field by a dataset of records. The system identifies a second number of distinct values stored in a second field by the dataset of records. The system creates a trie from values stored in a field by multiple records, the field corresponding to the first field or the second field, based on comparing the first number to the second number. The system associates a node in the trie with one of the multiple records, based on a value stored in the field by the record. The system identifies a branch sequence in the trie as a key for a prospective record, based on a prospective value stored in a corresponding field by the prospective record. The system uses the key for the prospective record to identify one of the multiple records that matches the prospective record.

Abstract: Techniques relate to managing a document throughout its lifecycle according to configurable metadata associated with the document. A processor may receive the document in association with an operation and may determine suitable metadata, which may be configurable, to associate with the document. After the operation is closed, the processor may suitably handle the document based on the metadata. Handling the document may include moving the document to an associated profile and/or purging the document. Further, with the configurable metadata, the processor may control the document with increased granularity.