11 results about "Bitmap index" patented technology

The application relates to the field of data analysis, and provides a data sampling method based on data modeling, a device and a storage medium.The method comprises the following steps: obtaining a data sampling requirement, the data sampling requirement comprising data attributes and a sampling quantity; comparing the data attributes with preset statistical attributes to obtain target attributes and non-statistical attributes; extracting target data corresponding to the sampling quantity from a preset bitmap index according to the target attributes; randomly generating virtual data of the sampling quantity according to the non-statistical attributes; and combining the target data and the virtual data to obtain sampling data, each piece of the sampling data comprising target data corresponding to the target attributes and virtual data corresponding to the non-statistical attributes. The target attribute data meeting the data sampling requirement is quickly generated in the form of the bitmap index, and the data of the non-statistical attributes is generated in a random manner, so that the data requirement and the quantity requirement of the data sampling are met, and the sampling efficiency is effectively improved, and the reliability of the sampling data is ensured.

This invention belongs to the field of memory, specifically relating to a wear-aware space allocation method for persistent memory file systems based on multi-level bitmaps. The method includes constructing a fine-grained multi-granularity allocation heap based on the number of consecutive pages contained in the free block min-heap; constructing an index structure based on multi-level bitmaps based on the availability of the min-heap; and quickly locating the first available min-heap with a granularity greater than or equal to the requested granularity using the multi-level bitmap index structure, based on the selected granularity requested by the upper-layer application, and allocating the free block with the lowest average wear from this min-heap. This invention solves the problem of low wear leveling accuracy in existing persistent memory file systems, further improving wear accuracy; it also solves the problem of high performance overhead caused by large block partitioning and sub-block average wear, significantly improving the performance of persistent memory file systems.

The application relates to a data query method and device, computer equipment, a storage medium and a computer program product. The method comprises the following steps: obtaining a data query request for a multidimensional data space; the data query request carries a target dimension combination; obtaining a space index corresponding to the multidimensional data space; the multidimensional data space comprises a plurality of data subspaces, the space index comprises index bitmaps corresponding to dimension members included in each dimension, each position in the index bitmap indicates a data subspace, and the element value of the same position in each index bitmap is used to indicate a subspace dimension combination corresponding to the corresponding data subspace; performing logical operation on the index bitmaps corresponding to each target member in the space index to obtain a result bitmap corresponding to the target dimension combination; and determining a query result corresponding to the data query request based on the result bitmap. The method can improve the efficiency of data query.

The present application belongs to the field of information retrieval and big data analysis, and particularly relates to a bitmap index compression method for genomic variation data, comprising: splitting original genomic variation data sequences according to field attributes, and storing in a columnar database; establishing original bitmap indexes for genomic variation data in the columnar database; dividing the original bitmap indexes into several segments; using a run-length algorithm to compress and store the public part of the segmented bitmap data, and using an integer list or a bit sequence to compress and store the non-public part. The present application saves more storage space by merging public affixes in the bitmap sequence, improves the bit operation speed, and makes the bitmap index load into the memory faster.

A method of writing data in a replay protected memory block (RPMB) area of a storage device in response to a request of a host device includes receiving a write request, including a message authentication code, data, and a bitmap index, from the host device and verifying the write request based on the message authentication code and the bitmap index. The verifying the write request may include calculating a message authentication code based on data and a bitmap index received from the host device, comparing a message authentication code, calculated in the storage device, with the message authentication code of the write request, and comparing the bitmap index of the write request with bitmap indexes, stored in the storage device, to check whether a replay attack has been made.

The application relates to the field of data storage, and discloses a big data compression storage and fast retrieval method and system, which comprises the following steps: dynamically generating a dimension weight vector based on multi-dimensional information entropy, and generating a rotating Hilbert code by adjusting the direction of a space-filling curve; adaptively determining the number of segments and an error threshold by using a time series prediction model, and compressively storing coding residual errors by using a linear model; constructing a double-layer collaborative index structure comprising a space bitmap index and a value range B+ tree index, and realizing local index reconstruction when the weight changes through an incremental updating mechanism; mapping a query range to a coding interval, screening candidate data segments in combination with the index, and returning a result by fusing model parameters and residual error decoding; asynchronously processing new data coding correction and obsolete data elimination, and optimizing storage space consistency. The application realizes the unification of high compression rate, fast retrieval and adaptive update.

A data item identification service may use locality sensitive hashing to identify data items which are relevant to a search based on a hash of a search vector based on the search. Hashes of vectors based on data items may be stored using a set of bitmaps, where a given bitmap corresponds to a given bit position of a hash. Data items with matching or similar hashes may be related to each other. The data item identification service may perform searches by generating a hash for a search vector and comparing the hash to hashes for data items using one or more logical operations on the set of bitmaps to identify related data items.

The application discloses a bitmap fast operation method based on CPU hardware instructions and relates to the technical field of data processing. The bitmap fast operation method based on CPU hardware instructions realizes analysis on the stored data in the bitmap index compressed through WAH, quickly obtains the position of the effective data in the current bitmap index and the total number of the effective data, quickly obtains the positioning of the '1', significantly shortens the time for calling related data, quickly inquires the related information of the data during database query, can significantly improve the throughput of the system, fully utilizes the CPU resources, compared with the traditional traversal method, can process larger-scale data at one time, greatly reduces the time cost of data acquisition, and improves the data processing efficiency.

This invention relates to the field of data security technology, specifically to a cloud-based system for efficient storage and recovery of game security data. The system includes a heterogeneous dual-track compilation module, used to compile and output main and backup track program files based on the game logic calculation node source code, generating a dual-track heterogeneous execution carrier, and calculating and generating a dual-track status checksum based on the dual-track heterogeneous execution carrier. In this invention, the dirty page bitmap index parameters are used to match the underlying memory page table of the exception stack, forming a set of damaged memory addresses. Then, the memory page data associated with the original redundant backup pages is extracted by address and overwritten, while the execution frame records within the exception stack are cleared. This allows the recovery action to simultaneously cover both the data and execution planes, repairing the damaged page content and eliminating the continuous interference of residual call chains on subsequent operations. This is suitable for high-concurrency cloud gaming scenarios with requirements for both real-time performance and security.