74 results about "Distributed object" patented technology

The invention relates to an intelligent network card and a distributed object access method based on the intelligent network card. The intelligent network card comprises a read-write merging module and a self-adaptive prefetching module. And the read-write merging module is used for merging the access request times of the read-write requests for accessing the same destination address from the computing node in the time window so as to reduce the redundant read-write request times. The self-adaptive prefetching module is used for checking whether an on-chip memory of the intelligent network card is hit or not when the computing node initiates an access request to a far-end memory node, adding an entry in a read-write request into a pseudo prefetching queue in the message buffer area if the on-chip memory of the intelligent network card is not hit, and sending the read-write request to the message buffer area; and according to the access cache hit rate, the pre-fetching module corresponding to the read-write request is scored, and the access priority is adjusted based on the score of each pre-fetching module, so that the pre-fetching strategy is dynamically adjusted. According to the invention, the intelligent network card is used as a coordinator of different computing resources in the computing node, and uniform access and prefetching are carried out on the on-chip resources to reduce redundancy.

The invention provides a life cycle deletion optimization method for a distributed object storage system, which comprises the following steps of: S1, detecting the business volume of a cluster, starting a pre-scanning operation when the business volume is lower than a preset threshold value, and identifying an object to be deleted according with a life cycle rule; s2, respectively writing the to-be-deleted object information of different dates into corresponding omaps, and storing omap data in a disk according to a preset packaging frequency; s3, when the life cycle expires, directly reading the omap of the corresponding date, skipping a real-time scanning step, and executing batch deletion operation; and S4, recording statistical information such as the deletion quantity scanned every day on the xattr of the barrel, so that management software performs data trend analysis and operation and maintenance decision. According to the embodiment of the invention, the life cycle deletion efficiency can be improved, the metadata operation pressure is reduced, and the cluster storage space utilization rate is optimized.

The invention discloses a resource adjustment method, electronic equipment, a storage medium and a program product, and relates to the technical field of distributed storage, the weight can be dynamically adjusted according to the use condition, the emergency state and the priority of real-time IO resources of clients, the differentiated IO requirements of multiple clients can be better met, and the user experience is improved. A stable low-delay demand or a periodic burst demand can be timely and effectively responded, and the dynamic adaptability is high; by dynamically adjusting the resource allocation strategy, the bandwidth can be flexibly and reasonably allocated according to the real-time demand of each client, so that the system can operate more efficiently, and services are provided for more clients; in a distributed object storage environment and under the same hardware resource condition, the optimized IO scheduling algorithm enables the system to be more efficient when processing a client request, system response delay is reduced, the data read-write speed is increased, and therefore the performance of the whole distributed storage system is improved.

Disclosed in the present application are an erasure code data updating method and apparatus. The method comprises: in response to a write operation for a target shard of a target object in a main object storage device, acquiring a state identifier of the target shard; if the state identifier is a first state identifier, storing, in a reserved object in a parity object storage device, initial data in the target shard and initial parity data for the target object, using updated data to overwrite the initial data, and modifying the state identifier to a second state identifier; if the state identifier is the second state identifier, using the updated data to overwrite current data in the target shard and updated data that is stored in the reserved object; and when a distributed object storage system is idle, determining target parity data on the basis of the initial parity data and the initial data and the updated data that are currently stored in the reserved object, and modifying the state identifier to the first state identifier.

The invention discloses a metadata space management method, device and equipment and a readable storage medium, and relates to the technical field of computers, the method comprises the following steps: selecting a target metadata service as a default metadata service; the default metadata service is used for distributing the logic space of the management storage pool; when the metadata spaces of other metadata services except the target metadata service are lower than a lower use limit threshold value, sending a space application instruction to the target metadata service; and after the target metadata service responds to the space application instruction and distributes part of logic space of the storage pool to other metadata services, the other metadata services store the distributed space as own metadata space. In this way, the metadata service manages the metadata space, management of the metadata service space of multiple nodes is achieved only through one storage pool, and no longer depends on an object storage daemon process and reliable and automatic distributed object storage.

Systems and methods are provided for receiving a vector to be inserted into a set of vectors, wherein the set of vectors is stored as a plurality of leaf objects of a distributed proximity-based graph across a plurality of storage devices of a distributed object storage system, identifying a subset of the plurality of leaf objects based at least partly on a similarity of the vector to one or more vectors stored in the subset of the plurality of leaf objects, storing the vector in an insert buffer associated with the subset of the plurality of leaf objects, and in response to a vector query, generating query results comprising the vector stored in the insert buffer, and at least one of the one or more vectors stored in the subset of the plurality of leaf objects.

The invention provides a virtual item processing method and device, equipment, a storage medium and a program product, and relates to the technical field of computers, the method comprises the following steps: determining a camp skill pool at least composed of object skills of camp objects in a first camp; in response to the fact that the first camp meets the skill distribution condition, at least part of object skills in the camp skill pool are distributed to the first camp, so that the first camp can control camp objects in the first camp to fight with the second camp by using the distributed object skills; in response to the attack of the first virtual object in the second camp, controlling to configure a virtual item for the first camp; and in response to a trigger operation for the virtual item, controlling the target object skill allocated to the first camp to use the virtual item, so that the target object skill obtains a specified skill gain when acting on a second virtual object in the second camp. The resource utilization rate of the terminal equipment can be improved.

This application relates to a method, apparatus, computer device, storage medium, and computer program product for distributing objects awaiting review. The method includes: responding to an object retrieval request, searching for a historical review index matching the requester; determining, based on the historical review index, a historical object identifier and a historical source identifier for the historical review object corresponding to the requester; searching for at least one target class index including the historical object identifier, and obtaining a first object awaiting review associated with each target class index, wherein the target class indexes are established based on object similarity; searching for a target source index from multiple source indexes based on the historical source identifier, and obtaining a second object awaiting review associated with each target source index; and determining a target object awaiting review matching the requester based on the first and second objects awaiting review, and pushing the target object awaiting review. This method enables accurate delivery of objects awaiting review.

The present application discloses a method, apparatus, device and storage medium for migrating a database to the cloud, including: performing a physical backup on the entire target database to obtain a target physical backup file, and uploading the target physical backup file to a distributed object storage on the same cloud platform; obtaining a validity verification result obtained by the cloud platform for performing validity verification on the target physical backup file; if the validity verification result indicates that the target physical backup file is a valid file, determining the import type of the target physical backup file; and importing some or all of the target physical backup files into a target database instance on the cloud platform according to the import type. The present application imports in the form of physical files and pre-verifies the physical backup files before import to prevent the impact caused by directly importing into the target database instance, and can migrate the physical backup data of the database to the cloud database instance more safely and efficiently.

This invention proposes a 3D semantic scene completion method based on hierarchical grouping and aggregation. The model proposes a novel dual-branch structure. The explicit constraint branch starts with the overall 3D scene features, focusing on regional aspects of the scene and aggregating explicitly similar features into grouped regional features. The implicit diffusion branch starts with the visible voxel query suggestions output by the query suggestion network, focusing on the details of objects in the scene and learning the implicit fine-grained features of the objects. A hierarchical grouping module is also proposed, which divides the 3D space into multiple sub-regions and performs similarity calculation and aggregation on the voxel features within each region, thereby generating a compact regional feature representation. This grouping method can focus on the local regions of specific objects in the scene, avoiding mutual interference from features of independently distributed objects in the distance, thus extracting more detailed and accurate semantic features.

This application relates to a method, apparatus, device, and computer-readable medium for dynamic garbage data recycling. The method includes: collecting operating parameters of a distributed object storage cluster and submitting these parameters to an analysis cluster; constructing dynamic load profiles of multiple storage buckets in the distributed object storage cluster based on the operating parameters in the analysis cluster; generating corresponding dynamic recycling strategies for each storage bucket according to its dynamic load profile; and recycling garbage data from each storage bucket according to the dynamic recycling strategies. This application constructs dynamic load profiles of storage buckets based on the collected operating parameters, achieving real-time perception and accurate characterization of the cluster's load status. This allows for the generation of targeted dynamic recycling strategies adapted to the load characteristics of each storage bucket, replacing the traditional static threshold triggering mechanism. This avoids resource contention during peak business periods and solves the technical problem that the static threshold triggering mechanism for garbage data recycling cannot adapt to dynamic load changes, leading to system performance degradation.

The invention provides a memory page allocation method, a readable storage medium and a computer program product. The allocation method is applied to a random access memory of a microcontroller, and comprises the following steps: obtaining a to-be-allocated object; sequentially taking each page in the N pages as a to-be-selected page, and according to the to-be-distributed object and the adjacent relation data, determining a page cutting overhead reduction amount between the to-be-distributed object and all adjacent objects when the to-be-distributed object is distributed to the to-be-selected page; according to the page cutting overhead reduction amount, the size of the to-be-distributed object and the page size of the to-be-selected page, calculating the income density when the to-be-distributed object is distributed to the to-be-selected page; wherein the adjacent object is an object having an adjacent access relationship with the to-be-distributed object; determining a target page from the N to-be-selected pages according to the revenue density, and distributing the to-be-distributed object to the target page; according to the method, the page cutting overhead of the RAM of the microcontroller can be reduced, and the ROM space of the microcontroller can be optimized.

The application discloses a data backup system and method, a storage medium and an electronic device, and relates to the field of financial technology. The system comprises: a ledger database, which is used to acquire information of a database group and generate a backup strategy corresponding to the database group; a backup management platform, which is used to acquire the backup strategy, execute a backup task of the database group through a backup database in the case that a backup mode is remote backup, and backup data generated by the backup task to a distributed object storage system; and the distributed object storage system, which is used to receive the data generated by the backup task. Through the application, the problems of large occupation of built-in SSD storage disk space by backup data and difficult management of backup data in the related art are solved.

The invention discloses a water conservancy knowledge base and intelligent question and answer construction method based on a large model and RAG, and the method comprises the steps: 1, combing a water conservancy knowledge system, and sorting water conservancy professional documents and data as materials of the knowledge base; step 2, constructing a water conservancy knowledge library management system through a J2EE system, a B / S architecture and a distributed object storage system; step 3, based on the RAG technology, forming different knowledge bases according to the sorted knowledge classification and confidentiality security level of the water conservancy industry, and establishing a water conservancy knowledge intelligent question-answering system on the knowledge bases; 4, performing extended application on the basis of the constructed water conservancy knowledge intelligent question-answering system; the problems that in the prior art, due to the fact that unstructured data processing is weak when a water conservancy knowledge base is constructed, a large number of image-text mixed documents such as PDF and PPT cannot be effectively utilized, and the recall rate and the accuracy rate are not high are solved.

The invention provides a real-time online visualization method and device for multi-resolution grid data, and belongs to the technical field of data processing and visualizing.The method comprises the steps that firstly, grid data are merged into sequence columns in the Z direction to form a multi-resolution stacked grid model, the multi-resolution stacked grid model is stored in an HDF5 file according to resolution levels, and parallel I / O is achieved in combination with MinIO distributed object storage; secondly, a Z-Order index and directory server strategy is designed, and the data scheduling and transmission efficiency is improved; a browser end adopts a virtual quadtree structure to organize data, and realizes multi-thread real-time data receiving in combination with WebWorker and WebSocket, so that the blockage of a main thread is avoided; finally, the LOD level is dynamically selected based on the viewpoint distance, and efficient volume rendering is achieved through a GPU texture array and LOD InfoTexture. According to the method, online real-time updating is supported, the loading delay is remarkably reduced, and the visual frame rate is improved.

The present application belongs to the field of data storage, and relates to a space arrangement method for distributed object storage. The method comprises: acquiring, as source objects, aggregation large objects meeting a hole ratio requirement, and inserting, into a hash list, source objects, fragment spaces of which meet a hole minimum threshold; selecting, from the hash list, the source objects having the highest fragment rate to undergo space arrangement, creating a target aggregation large object on the basis of requirements and using the target aggregation large object as a target object; generating a target object mapping relationship table; migrating data of small objects on the source objects to the target object on the basis of the target object mapping relationship table; after migration is successful, updating layout information corresponding to metadata of the small objects themselves; and executing a cleaning operation, so as to end the task. In the method of the present application, by means of migrating undeleted small objects from original large objects onto a new empty large object, the fragmentation and waste of a storage space are effectively reduced, thereby better improving the utilization rate of the storage space.

This invention provides a method and apparatus for real-time online visualization of multi-resolution grid data, belonging to the field of data processing and visualization technology. First, the grid data is merged into hierarchical columns along the Z-axis to form a multi-resolution stacked grid model, which is then stored in HDF5 files according to resolution levels. Parallel I / O is achieved using MinIO distributed object storage. Second, a Z-Order index and directory server strategy are designed to improve data scheduling and transmission efficiency. On the browser side, a virtual quadtree structure is used to organize the data, and WebWorker and WebSocket are used to achieve multi-threaded real-time data reception, avoiding main thread blocking. Finally, the LOD level is dynamically selected based on the viewpoint distance, and efficient volume rendering is achieved using GPU texture arrays and LODInfoTexture. This method supports online real-time updates, significantly reduces loading latency, and improves the visualization frame rate.

The invention discloses a building space landing point selection method and device and a computer readable storage medium, and the method comprises the steps: obtaining the object attribute of a to-be-distributed object and the task attribute of a building distribution task in the execution process of the building distribution task; generating observation options for the current building area according to the object attributes, and obtaining observation data of the current building area according to the observation options; determining to-be-selected landing points of the building distribution task according to observation data, and performing priority ranking on the to-be-selected landing points according to the task attributes; executing the landing operation of the building distribution task according to the priority from high to low; therefore, for dense building scenes such as commercial street areas and residential districts, the landing point selection strategy of the building space is optimized, the pickup difficulty is reduced, and the flight safety is guaranteed.

The application discloses a resource adjustment method, an electronic device, a storage medium and a program product, relates to the technical field of distributed storage, and can dynamically adjust the weight according to the use condition, burst state and priority of real-time IO resources of a client, better meets differentiated IO demands of multiple clients, can be in time and effective response to stable low-delay demands or periodic burst demands, and has strong dynamic adaptability; the application can flexibly and reasonably allocate bandwidth according to real-time demands of each client by dynamically adjusting a resource allocation strategy, enables the system to be more efficient, and provides services for more clients; in a distributed object storage environment, under the condition of equivalent hardware resources, the optimized IO scheduling algorithm enables the system to be more efficient when processing client requests, reduces system response delay, improves data read-write speed, and thus improves the performance of the entire distributed storage system.

The invention discloses an aircraft protection method and device and a computer readable storage medium, and the method comprises the steps: judging whether the current height exceeds a first height threshold value or not when an aircraft enters an emergency state; if so, opening a main parachute of the aircraft; if not, the free landing speed of the current height is estimated, and whether the free landing speed exceeds a second speed threshold value or not is judged; if not, a main air bag of the aircraft is opened, and if yes, a delayed opening instruction of an auxiliary parachute and / or an auxiliary air bag of the delivery object is set firstly, and after the auxiliary parachute and / or the auxiliary air bag are / is separated from the aircraft, the main air bag of the aircraft is opened; therefore, the air bag protection scheme of the unmanned aerial vehicle can be optimized to a great extent aiming at building dense scenes such as commercial streets and residential districts, the distribution requirements of the building dense scenes such as the commercial streets and the residential districts are met, and the flight safety and object safety in emergency situations are guaranteed.

The application discloses a distributed object storage system data monitoring method and device and a medium thereof, relates to the technical field of distributed object storage, and aims to provide an implementation mode for data monitoring, and provides a distributed object storage system data monitoring method for solving the problem that the current data monitoring mode has a great influence on performance. According to the distributed object storage system data monitoring method, the request information is first stored in a cache, part of data in the request information is counted according to a preset monitoring requirement, data monitoring information is obtained, and the data monitoring information is saved in a storage pool, so that the data monitoring information can be called when needed. Therefore, the amount of data written into the storage system or the amount of data read from the storage system when a user queries the data monitoring information is less than the amount of data stored in the storage system in the current mode, and the difference is more obvious when the request information contains more requests.

The present application belongs to the field of data storage, and relates to a space arrangement method for distributed object storage. The method comprises: acquiring, as source objects, aggregation large objects meeting a hole ratio requirement, and inserting, into a hash list, source objects, fragment spaces of which meet a hole minimum threshold; selecting, from the hash list, the source objects having the highest fragment rate to undergo space arrangement, creating a target aggregation large object on the basis of requirements and using the target aggregation large object as a target object; generating a target object mapping relationship table; migrating data of small objects on the source objects to the target object on the basis of the target object mapping relationship table; after migration is successful, updating layout information corresponding to metadata of the small objects themselves; and executing a cleaning operation, so as to end the task. In the method of the present application, by means of migrating undeleted small objects from original large objects onto a new empty large object, the fragmentation and waste of a storage space are effectively reduced, thereby better improving the utilization rate of the storage space.

The utility model provides a distribution mechanism capable of highly reliably distributing distributed objects according to game results and a game device provided with the distribution mechanism. A dispensing mechanism for dispensing a dispensed item associated with a game, comprising: an accommodating portion accommodating the dispensed item; a first operation part which is provided with the accommodating part and enables the accommodating part to operate; a second operation part configured so as to be able to operate while holding the dispensed object pushed out from the accommodating part; the push-out mechanism is arranged corresponding to the first action part and used for pushing out the distributed object, and the push-out mechanism comprises a first push-out part used for pushing out the distributed object in the containing part to the second action part; and a second push-out part that operates in a direction different from the operation direction of the first push-out part and pushes out the dispensed object from the second operation part to the outside of the second operation part, the first push-out part being arranged at an angle to the second push-out part at a predetermined angle.

The invention discloses a method and a device for operating a distributed object storage file by a user mode file system. The method comprises the following steps of: initializing a process of the user mode file system; reading a preset cache directory in the process of the user-mode file system, and mapping a first index node of a mounting directory of the user-mode file system to a second index node of the preset cache directory; the mounted directory comprises a user access path of the target file in the distributed object storage; performing recursive reading in sequence according to the user access path, and judging whether a preset cache directory contains all levels of directories of the user access path or not; if not, creating a corresponding directory according to the user access path under the preset cache directory, determining a second index node in the corresponding directory, and reading all levels of directories under the preset cache directory by the user state file system process according to a mapping relationship between the first index node and the second index node, and accessing the target file stored by the distributed object according to the directory at each level.

A distributed object storage method, a device and a medium are provided, and the method includes: splitting a target object to be stored into a quantity of key-value pair data; determining target partitions corresponding respectively to the quantity of key-value pair data from a plurality of partitions of a preset distributed object storage system; determining, based on a preset partition view, data storage nodes that currently hold the target partitions, to obtain data storage nodes corresponding respectively to the quantity of key-value pair data; and caching the quantity of key-value pair data into the data storage nodes corresponding respectively to the quantity of key-value pair data.

Snapshot or point-in-time image functionality improves the use of object-based datastores. An example system includes an object-based datastore and a metadata datastore associated with the object-based datastore. Instances of the metadata datastore each identify the distributed data blocks that respectively store the objects included in the object-based datastore. An instance of the metadata datastore is used as a snapshot image of a set of objects of the object-based datastore based on identifying the distributed data blocks that were mapped to the set of objects during a point in time. A different instance of the metadata datastore is dynamically updated to reflect present mappings of distributed data blocks to objects in the object-based datastore. Different instances of the metadata datastore are used to read objects from previous timepoints, restore the object-based datastore to a previous snapshot image, enable intelligent deletion of objects of the object-based data store, and more.

The present invention discloses a Ceph-based distributed object storage retrieval method and device, which is applied to a Ceph system. The method receives a retrieval object request initiated by a client, determines s_max based on the retrieval object request, determines whether the last retrieval object adjacent to the current retrieval object is a file or a directory, determines max based on s_max if the object is a directory, reads the current retrieval object a preset number of times based on max, adjusts max to a preset number, and continues reading based on the preset number until all directories on the current layer are read; and adjusts max based on the number of files in the current retrieval object, reads the current retrieval object based on max until all directories on the current layer are read, and the number of files is positively correlated with max. The above process distinguishes the type of the current retrieval object, and adopts different max values ​​for flexible adjustment when the object is a file or a directory. This can improve retrieval efficiency when there are many retrieval objects.

The present invention discloses a method and device for retrieving directories in a Ceph distributed object storage, including: obtaining the access times of each directory structure, and respectively dividing the directory structures into a hot linked list, a warm linked list, and a cold linked list according to the access times; when receiving a retrieval request for a target directory structure, obtaining the retrieval type of the retrieval request, where the retrieval type includes one or several of a write request, a read request, a delete request, a copy request, and a move request; and sequentially retrieving the target directory structure in the hot linked list, the warm linked list, and the cold linked list according to the retrieval type. During the above retrieval process, each directory structure is pre-divided into a hot linked list, a warm linked list, and a cold linked list according to the access times, and the target directory structure is sequentially retrieved in the hot linked list, the warm linked list, and the cold linked list, eliminating the need to retrieve directories by enumeration, thus improving the retrieval efficiency.

The invention discloses a building engineering management and control system based on a BIM technology, relates to the technical field of engineering data management, and solves the technical problems that differentiated management strategies are not made according to the business value of data, core data and conventional data are stored in a mixed manner, the safety of the core data cannot be guaranteed, and storage resources of the conventional data are wasted. According to the method, data is divided into core data and conventional data through a classification rule based on business core, sensitivity and reusability, so that subsequent storage and authority management and control better meet business requirements, an independent physical partition and encrypted security policy is adopted for the core data, the independent partition is physically isolated from the conventional data, and the security of the core data is improved. Encryption and authority control ensure that core data is not leaked and tampered; for conventional data classification processing based on capacity threshold values, elastic capacity expansion is realized by adopting distributed object storage, the conventional data storage cost is reduced, sharing convenience is guaranteed through a lightweight access interface, and dual optimization of safety and cost is realized.

The invention discloses an information storage system of network security equipment, which comprises a real-time analysis layer for receiving original flow metadata, triggering an annular buffer management module when the data volume reaches a preset threshold value, covering low-value data in short time, and retaining a session record which is being analyzed by a threat detection engine; the tactical storage layer is used for migrating cold data to a low-cost storage medium when the data access frequency is reduced, performing tactical data traceability and sending security audit data to a lower layer; the strategic storage layer is used for storing data fragments in a mixed medium formed by distributed object storage and a tape library, and encrypting and solidifying sensitive data; secondly, establishing a non-tampering hash chain anchor for judicial evidence data, and transferring the data to a lower layer when the data is close to the end point of a life cycle; the archiving and destroying layer is used for encrypting and fragmenting the data and storing the data in a geographic distributed medium, and carrying out on-chain evidence storage on data fingerprints; when a destruction condition is triggered, a multi-factor authentication process is performed.