Abstract: The present disclosure relates to a system and method for managing the storage of files in a storage medium of a computing device. The method may comprise detecting a file to be stored in the storage medium. The method may also comprise determining a file assignment mode and a granularity, wherein the granularity includes at least two file system blocks occupying consecutive physical addresses of the storage medium. The method may further comprise allocating one or more storage regions for storing the file based at least on the file assignment mode and the granularity, and storing the file into the allocated one or more storage regions.

Abstract: A selected data chunk associated with an object is determined to be sent to a destination. A chunk compression grouping storing the selected data chunk associated with the object is identified. The identified chunk compression grouping includes a plurality of data chunks compressed together. A data content version that includes the selected data chunk associated with the object to be provided to the destination is determined from a plurality of data content versions based at least in part on a metric associated with the identified chunk compression grouping.

Abstract: Tiers of compression algorithms may be determined using compression information collected regarding compression ratios achieved for data sets using compression algorithms. Each tier may meet specified criteria regarding expected compression ratios achieved for a specified portion or number of data sets. Compression algorithms of each tier may be implemented by a different hardware device that may include hardware accelerators for the algorithms of the tier. Different tiers, and thus different hardware devices, achieve different levels of compression. A recommendation may be provided using compression information collected, such as from one of the hosts, regarding which hardware device to use for compression. The recommendation may be to purchase a license to use or whether to purchase a particular hardware device for compression. Compression information may be collected by a host that issues tagged I/Os providing a hint regarding what compression algorithm to use for the particular I/O operation data.

Abstract: A predictive model can be applied to data representing a history of events for an entity to compute a value indicative of an outcome related to a reference time for that entity. The effect of an event from an entity's history of events on an outcome for the entity at a reference time can vary based on the type of event and relative time of that event with respect to the reference time. The effect of an event from an entity's history of events on an outcome for the entity also can vary due to other characteristics of the entity in combination with the event. These effects are captured as weights. For an entity, functions of sets of events from the history of events are computed for the entity and a set of weights for events. The computed results are inputs to the predictive model.

Abstract: The present disclosure relates to systems and methods for backing up a distributed database provided as a database instance across servers within a first geographic region. In one example, such a system may include at least one processor configured to: generate and transmit a command to duplicate the distributed database in object databases on first region servers; generate and transmit a command to duplicate the object databases on servers in at least a second geographic region independent from servers in the first region; and, when an error is detected with at least one server within the first region: generate and transmit a command to initiate a new distributed database on second region servers, generate and transmit a command to populate the new distributed database using the object databases on second region servers, and generate and transmit a command to re-route traffic from the distributed database to the new distributed database.

Abstract: Computer-implemented methods and systems are disclosed for receiving and indexing a plurality of files for later querying, for dynamically generating scripts to be executed during a query of a data store, and for horizontally distributing a query and aggregating results of the distributed query.

Abstract: A data intake and query system receives a message including raw machine via an internet protocol (IP) such as the hypertext transfer protocol (HTTP). The message includes a distinct payload portion and a distinct custom field portion. The payload portion includes raw machine data, while the custom field portion includes values for fields. An event that includes the raw machine data and the values is generated from the payload portion and the values are extracted from the custom field portion. The event is then stored such that the values are associated with the event.

Abstract: A distributed database may comprise a plurality of nodes maintaining a collection of data items indexed by key values. Upon receiving a request to store a data item, a node of the database may be selected based on the node's suitability for storing the data item. The distributed database may generate a key to identify the data item, such that the generated key identifies the data item and comprises information indicative of the selected node. The distributed database may provide the generated key to an application programming interface client in response to the request.

Abstract: Key name synthesis is disclosed. A metrics data point is received. Based at least in part on a translation statement, at least a portion of the received metrics data point is associated with a key specified by the translation statement such that the specified key and the associated at least portion of the received metrics data point form a key-value pair. The key-value pair is associated with the received metrics data point.

Abstract: Apparatus for performing searching of a plurality of reference images, the apparatus including one or more electronic processing devices that search the plurality of reference images to identify first reference images similar to a sample image, identify image tags associated with at least one of the first reference image, search the plurality of reference images to identify second reference images using at least one of the image tags and provide search results including at least some first and second reference images.

Abstract: A method of searching for videos includes receiving, by a computer device, a search query from a user computer device. The method also includes determining, by the computer device, a set of videos that satisfy the search query. The method further includes determining, by the computer device, a subset of related videos from the set using metadata to determine a relationship based on date, time, and location. The method additionally includes generating, by the computer device, a consolidated video from the subset of related videos by merging a first portion of a first one of the subset of related videos with a second portion of a second one of the subset of related videos.

Abstract: A method, computer program product, and computer system for identifying duplicate sectors in a block of a plurality of blocks. The duplicate sectors in the block may be zeroed out. A data reduction operation may be performed on the block after the duplicate sectors are zeroed out.

Abstract: This invention relates to computer engineering and operating system components, in particular, it discloses a new method of building a hierarchal file system, which provides new functionality and flexibility, including: unlimited maximum possible file system size (number of elements), unlimited size of a single element, unlimited types of data, that can be represented as a file. In addition, the disclosed file system allows for user-defined types of data and can be used as a registry for OS system components, saving space important for resource-restricted embedded systems. The minimum file system size is 2 Bytes only. File system supports empty or non-unique files naming and natively provides built-in security using specification-based nodes header encoding. This result is achieved by using file systems nodes metadata comprising: the unique identifier (ID), an ASN.1 header with PER encoding, and a doubly linked list of logical blocks of its data.

Abstract: The present disclosure includes apparatuses, methods, and systems for acceleration of data queries in memory. An example host apparatus includes a controller configured to generate a search key, generate a query for particular data stored in an array of memory cells in a memory device, and send the query to the memory device. The query includes a command to search for the particular data. The query also includes a number of data fields for the particular data including a logical block address (LBA) for the particular data, an LBA offset for the particular data, and a parameter for an amount of bits in data stored in the memory device that do not match corresponding bits in the search key that would result in data not being sent to the host.

Abstract: A big data processing method based on direct computation of compressed data. The method includes 1) compressing, based on a modified Sequitur compression method, original input data according to a smallest compression granularity given by an user, and transforming them into a directed acyclic graph, DAG, consisting of digits; and 2) determining an optimal traversal pattern, and performing a top-downward traversal or a bottom-upward traversal on the DAG in the step 1) based on the determined optimal traversal pattern so as to enable direct processing of the compressed data. By providing a modified Sequitur algorithm and top-downward and bottom-upward traversal strategies in the disclosure, direct processing of compressed data is enabled, significant improvement in time and space has been gained with broad applicability, and certain representations with respect to more advanced document analytics can still be derived on the basis of these.

Abstract: System and methods are described for a server computing node including a processing device and a memory device. The processing device executes instructions stored in the memory device to receive a request to update a data object in a shared storage of a distributed computing system; get a current version identifier (ID) of the data object; get the data object identified by the current version ID from the shared storage; update the data object; write the updated data object to shared storage using a unique new version ID; and cause the conditional update of the current version ID of the data object to the new version ID.

Abstract: A system and method for providing a secure and auditable means for exchanging files related to 3D objects intended for replication is provided. A secure system and method to facilitate the acquisition of files (such as 3D design files) that can involve intellectual property rights management, standard of quality assurance for 3D printed objects, warranty protection for the printed object, and audit and report tools for the results of a 3D replication.

Abstract: An archive file that includes an archive start point and an archive end point is received to be segmented and compressed. A first set of compression start points to segment the archive file according to a first function and a second set of compression start points to partition the archive file according to a second function are created. The first set of compression start points and the second set of compression start points are combined to create a set of merged compression start points to partition the archive file into portions between the archive start point and the archive end point. Each portion between the archive start point and the archive end point are compressed to create a compressed archive file.

Abstract: A method, an electronic device, and a computer program product for managing a file system are provided. For example, the method comprises causing multiple data blocks to be written to a storage space of the file system, the size of each of the multiple data blocks being not lower than a threshold size, and creating at least one space fragment in the storage space, the size of each of the at least one space fragment not exceeding the threshold size. Therefore, this solution can quickly and efficiently age a file system.

Abstract: Replica unavailability in a distributed file system can be managed. For example, a processing device can detect that a replica of data in a volume of a distributed file system is unavailable. In response to detecting that the replica is unavailable, the processing device can create a copy of the data in a memory location that is within the distributed file system and external to the volume. The processing device can then execute a write request by modifying both the data in the volume and the copy in the memory location (e.g., to ensure consistency between the two).