1144results about How to "Reduce storage space" patented technology

A billing process is disclosed for a information dispersal system or digital data storage system. In one embodiment of the invention, the original data to be stored is separated into a number of data “slices” or shares in such a manner that the data in each subset is less usable or less recognizable or completely unusable or completely unrecognizable by itself except when combined with some or all of the other data subsets. These data subsets are stored on separate digital data storage devices as a way of increasing privacy and security. As dispersed file shares are being stored or removed from a grid of distributed storage locations, a set of metadata tables are created, separate from the dispersed file share storage, to maintain information about the original data size of each block, file or set of file shares dispersed on the grid. The original data size information in these separate metadata tables is used to determine usage information based upon the original file size even though the file has been dispersed onto a storage grid that contains file slices who size may not relate to the original file size and the file slices may have been compressed by the system in order to reduce storage space or improve transmission time. As such, the billing process is able to enable a broad range of commercial billing options for billing for commercial data services on an information dispersal grid.

A computer implemented method and a secure relational file system (SRFS) for storing and managing data for backup and restore are provided. The SRFS receives data, generates first metadata including file-to-sector mapping information, splits the data into fixed sized data chunks (FSDCs), generates second metadata including logical boundaries used for splitting, creates fixed sized data blocks by prepending the second metadata to the FSDCs, splits each FSDC into variable sized data chunks (VSDCs), generates third metadata including unique identifiers (UIDs) for the VSDCs, creates variable sized data blocks (VSDBs) by prepending the third metadata and the second metadata to each VSDC, identifies unique variable sized data chunks (UVSDCs) of the VSDBs using the UIDs, stores the UVSDCs in chunk files, and stores the first metadata, the second metadata extracted from the VSDBs, and storage locations of the UVSDCs with the third metadata of the UVSDCs and duplicate VSDCs in databases.

Multiple versions of a runtime system, such as a software emulation application that emulates a legacy hardware architecture, are allowed to co-exist in the memory of a new hardware architecture. The operating system software of the new hardware architecture reads configuration data from a database or table to decide which version of the runtime system is desirable for an application program or game that is being loaded or is currently running, and, if a match is found, only that runtime system is invoked. To reduce storage footprint, the different versions of the runtime system may be stored using “differential patching” techniques. In this configuration, the operating system will always launch the same basic runtime system binary, but it will select a different differential patch to apply at run-time based on the title as determined during the database lookup. In this fashion, future changes to the runtime system to correct software bugs, incompatibility issues, and the like only need to be tested for the relevant target application programs or games.

Disclosed are system and methods for processing and storing data files, using a data edge file format. The data edge file separates information about what symbols are in a data file and information about the corresponding location of those symbols in the data file. An index for the data files can be generated according to the data edge file format. Using the data edge index, a materialized view of a result set can be generated in response to a search query for the source data objects stored in object storage.

An airport map display system for an aircraft displays the airport paved surfaces and structures to a pilot or crew member. The system displays runways, taxiways, connectors, ramps, gates, and buildings. Hold and yield points may also be displayed. A compact set of specific data points and associated pavement width values is used to store unique data for each airport.

This magnetic memory with a thermally-assisted write, every storage cell of which consists of at least one magnetic tunnel junction, said tunnel junction comprising at least:

one magnetic reference layer, the magnetization of which is always oriented in the same direction at the time of the read of the storage cell;

one so-called “free” magnetic storage layer, the magnetization direction of which is variable;

one insulating layer sandwiched between the reference layer and the storage layer.

The magnetization direction of the reference layer is polarized in a direction that is substantially always the same at the time of a read due to magnetostatic interaction with another fixed-magnetization layer called the “polarizing layer”.

The invention discloses a high dynamic-range synthetic imaging method and device, aiming at providing a method for synthesizing two pieces of images with lower dynamic ranges into a piece of image with higher dynamic range. The high dynamic-range synthetic imaging method comprises the steps of: shooting a same scene at different exposure time to obtain two pieces of different exposed images; respectively converting the two different exposed images to be in exposure value spaces according to response curves of a shooting device; weighted-synthesizing scene brightness which is calculated by utilizing exposure value and exposure time according to brightness of the two pieces of images; and simulated-exposing the synthesized scene brightness through the response curves to obtain the image with high dynamic range. According to the invention, two pieces of different exposed images are synthesized, and thus the difficulty of image alignment is reduced; moreover, the operand and the required storage space in the processing procedure are reduced, so that the high dynamic-range synthetic imaging method and device can be applied to a small-sized handheld device; and at the same time, the image with high dynamic range is rich in details at light parts and shadow parts, and the color and the details of the image are in conformity with those of the original scene.

A distributed data management system has multiple virtual machine nodes operating on multiple computers that are in communication with each other over a computer network. Each virtual machine node includes at least one data store or “bucket” for receiving data. A digital hash map data structure is stored in a computer readable medium of at least one of the multiple computers to configure the multiple virtual machine nodes and buckets to provide concurrent, non-blocking access to data in the buckets, the digital hash map data structure including a mapping between the virtual machine nodes and the buckets. The distributed data management system employing dynamic scalability in which one or more buckets from a virtual machine node reaching a memory capacity threshold are transferred to another virtual machine node that is below its memory capacity threshold.

Novel data structures, methods and apparatus for a Software Managed Tree (SMT) which provides a mechanism to create tree structures that follow a search mechanism defined by a control point processor. The search mechanism does not require storage on the previous pointer and uses only a forward pointer along with a next bit or group of bits to test thereby reducing storage space for nodes. The search mechanism processes multiple filter rules for an application without requiring multiple searches and also allows various filter rules to be chained. Two patterns of the same length are stored in each leaf to define a range compare. A compare at the end operation is either a compare under range or a compare under mask. In a compare under range, the input key is checked to determine if it is in the range defined by the two patterns. In a compare under mask, the bits in the input key are compared with the bits in a first leaf pattern under a mask specified in a second leaf pattern.

A distributed data management system has multiple virtual machine nodes operating on multiple computers that are in communication with each other over a computer network. Each virtual machine node includes at least one data store or “bucket” for receiving data. A digital hash map data structure is stored in a computer readable medium of at least one of the multiple computers to configure the multiple virtual machine nodes and buckets to provide concurrent, non-blocking access to data in the buckets, the digital hash map data structure including a mapping between the virtual machine nodes and the buckets. The distributed data management system employing dynamic scalability in which one or more buckets from a virtual machine node reaching a memory capacity threshold are transferred to another virtual machine node that is below its memory capacity threshold.

The present disclosure provides a contact lens package containing a contact lens in a compressed state. In one exemplary embodiment, the overall internal depth of the package is less than the natural sagittal depth of the contact lens. Different single-use contact lens package shapes and configurations may be used. In some embodiments, a spring disc is included in the packages to help present the contact lens to the user when the package is opened. The contact lens packages may be adhered or clipped to a card or other carrier sheet, and may be housed in a number of different secondary packages.

The invention provides an object serializing method as well as an object de-serializing method, device and system, which can preset a type value of each field in an object. The object serializing method comprises the following steps of: carrying out binary conversion on the type value of each field so as to obtain a binary sequence of the type value of each field, and carrying out the binary conversion on a label value of each field so as to obtain a binary sequence of the label value of each field; combining the binary sequence of the label value of each field with the binary sequence of the type value of each field, so as to obtain a binary sequence of a key value of each field; carrying out the binary conversion on value information of a field name of each field, so as to obtain a binary sequence of the value information of each field; connecting the binary sequence of the key value of each field with the binary sequence of the value information, so as to obtain a binary sequence of each field; and connecting the binary sequence of each field, so as to obtain the binary sequence of an object.

The invention provides a neural network compression and acceleration method, storage equipment and a terminal. The method comprises the steps that the original neural network is pruned; clustering quantification is carried out on a network weight of the pruned original network, and the original network after clustering quantification is trained to obtain a target neural network; a sparse matrix isused to store the target neural network; an input feature map is converted into an input matrix; and the sparse matrix is multiplied by the input matrix to obtain an output feature map correspondingto the input feature map. Thus, the computing resource and storage space of the neural network are reduced, and thus, the computing cost is reduced.

The present invention introduces unique functionality whereby there is a substantial reduction in the storage and replication requirements for the locally initiated electronic mail messages, which include locally sourced attachments. In the method of the present invention, at the origination location of an electronic message, there is an identification of electronic messages containing locally sourced attachment documents. During the storage of the transmitted message, there is determination of whether any attachment to the message was a locally sourced attachment. If the attachment was a locally sourced attachment, the attachment may not be stored with the message. Instead a pointer or link can be created to the original or locally sourced document. This approach will reduce the storage space required by electronic messages.

A data structure for a point of interest (POI) and a method for use and application of POI information with the data structure, and is applied in a handheld device. The POI information for a single POI is sorted based on attributes of the POI and the sorted sets of POI information are included in folders, file names or POI information. As such, when a locating operation for the POI information is requested, the amount of operations for locating the handheld device may be reduced and processing thereof may be sped up. Further, the sorting technology with respect to the POI information corresponding to the POI may be performed based on an attribute district of the POI. A plurality of sets of POI information thus obtained may be compressed to a single set of POI information so that the total information stored in the handheld device may be reduced.