396 results about "Tree (data structure)" patented technology

The invention belongs to the technical field of front-end development, and particularly relates to a React framework-based tree component optimization method fusing virtualization rendering and increment rendering. Comprising the steps of S1, data preprocessing; S2, dynamic virtualization rendering: dynamically calculating a node index range in a visible area according to a real-time scrolling position of a user viewport, only rendering nodes in the range, and realizing seamless lazy loading of data through scrolling event monitoring; s3, intelligent incremental updating: identifying changed nodes through a state change comparison algorithm, and executing local re-rendering only for the changed nodes based on a component life cycle control mechanism of a React framework; and S4, lazy loading cooperative control. The method aims at solving the problems in the aspects of performance, memory management, user experience and the like when a tree component in a React ecological system processes large-scale data, and is widely applied to various Web application program development scenes needing to display and operate a large-scale tree data structure.

Methods, systems, and apparatus, including medium-encoded computer program products for loading and rendering include: obtaining a 3D spatial access tree data structure encoding location information for objects in a 3D model of an environment, wherein the 3D model is stored on a remote computer system; ranking a set of the objects in the 3D model to form an object hierarchy based at least on distances between each object of the set of objects and a specified viewpoint for a user within the environment, as determined using the three-dimensional spatial access tree data structure; selecting a proper subset of the set of objects to be rendered based on the object hierarchy and a current model load limit; downloading the proper subset to the local memory; and rendering the proper subset from the local memory to the display device based on the specified viewpoint within the environment for the user.

The embodiment of the invention discloses an instruction translation method and device, electronic equipment and a storage medium, and the method comprises the steps: receiving an instruction translation request, when the instruction translation request carries a target address of an original instruction, obtaining the target address in the instruction translation request, obtaining a first symbol table file, retrieving a target node in the tree data structure of the first symbol table file according to the target address, and reading symbol offset from the target node; retrieving a function number of the target address and a first line number of the original instruction from first symbol information of the first symbol table file according to the symbol offset; the first symbol dictionary is obtained according to the target address, the first function character of the original instruction is retrieved in the first symbol dictionary according to the function number, and the translation result of the original instruction is obtained based on the first function character and the first line number, so that the time complexity during instruction translation can be reduced, and the instruction translation efficiency is improved.

Systems and techniques are provided for self-healing at the edge. A plurality of faults can be detected for an edge device based on monitoring log information of the edge device, with remediation information indicative of remediation actions performed for individual faults or combinations of faults included in the plurality of faults. A hierarchical fault tree data structure can be generated mapping between the plurality of faults and the remediation information, each fault comprising root or child node of the fault tree, and each remediation action comprising a leaf node of the fault tree. An indication of one or more faults can be provided to a self-healing machine-learning or artificial intelligence engine configured to generate a corresponding fault remediation action based on traversing the hierarchical fault tree according to the indicated one or more faults. The fault remediation action can be output for self-healing of the indicated one or more faults.

The invention relates to an optimization method and device for large-scale graph data visual rendering and a storage medium, and the method comprises the steps: obtaining to-be-rendered graph data, constructing an R-tree spatial index according to the to-be-rendered graph data, and constructing a self-adaptive fragmentation model based on an R-tree data structure; monitoring interaction data of a user in real time, performing viewport prediction according to the interaction data, and determining a to-be-loaded sub-graph according to a prediction result and the adaptive fragmentation model; the method comprises the following steps: acquiring system data of client equipment, analyzing the performance of the client equipment according to the system data, and determining a rendering strategy according to a performance analysis result; and performing off-screen rendering on the to-be-loaded sub-graph according to the rendering strategy, and displaying an off-screen rendering result on the client device after detecting that the user completes the corresponding operation. According to the method, the rendering granularity is dynamically adjusted through the adaptive fragmentation model, and the rendering quality and performance consumption are balanced; the user interaction intention is pre-judged through a viewport prediction algorithm, and window smooth switching is achieved in combination with off-screen rendering.

In various examples, an interactive agent platform that hosts development and / or deployment of an interactive agent may include an interpreter programmed to iterate though one or more flows until reaching an event matcher, a top level flow may specify instruction(s) to activate any number of flows comprising any number of event matchers, the interpreter may use any suitable data structure to keep track of active flows and corresponding event matchers (e.g., using a tree or other representation of nested flow relationships), and the interpreter may employ an event-driven state machine that listens for various events and triggers corresponding actions specified in matching flows (with event matchers that match an incoming interaction modeling API event). As such, the interpreter may execute a primary processing loop that processes incoming interaction modeling API events and generates outgoing interaction modeling API events that implement the interactive agent.

The invention discloses a quick retrieval-based area-reserved quadratic error measurement grid simplification method, which comprises the following steps of: introducing a vertex neighborhood area, a vertex Gaussian curvature and a boundary folding cost simplification factor to change the folding cost of an edge, and optimizing a simplification process; a KD-Tree data structure is used for accelerating searching for legal point pairs, the complexity of an algorithm is reduced, the characteristics of a high-curvature area of a grid model are effectively maintained, the geometric structure of a grid is kept, and narrow triangular faces are eliminated; the simplified model has a good visual effect, and relatively high simplification precision is kept under a high simplification rate.

The invention provides a compression storage method and device for large-scale census data and a medium, and relates to the technical field of data processing.The method comprises the steps that data structure analysis is conducted on a census data storage waiting set, and a data hierarchy node tree is constructed and obtained; performing node value feature analysis on the data level node tree to obtain a data node value topology; according to a data node value topology configuration compression strategy, adaptive compression processing is carried out on the census data storage waiting set, and a compressed data storage waiting set is obtained; performing hierarchical mapping construction of the graph database by taking the data hierarchical node tree as a hierarchical connection constraint to obtain a distributed graph database; and taking the data hierarchical node tree as a data storage guide, and performing storage node filling of the distributed graph database by adopting a compressed data storage waiting set. The technical problem that the storage resources cannot be fully utilized due to the fact that the data relation and the data value are difficult to analyze and evaluate in the existing general survey data storage process is solved, and the storage resource utilization rate and the storage efficiency are optimized.

A prompt is generated based on an input and processed webpage or application content. The prompt is provided to a large language model. Based on a response received from the large language model that maps one or more variables associated with the input to one or more elements associated with the processed content associated with the tree data structure received from the large language, a pattern mapping the one or more variables associated with the input to the one or more elements associated with the processed content associated with the tree data structure is derived.

The invention belongs to the technical field of data analysis and process mining, and particularly relates to a method for generating a parameterized interactive graphical process tree for business log data. The method comprises the following steps: firstly, collecting original business log data including database logs, application server logs, user behavior logs and the like, checking the integrity and timestamp accuracy of the original business log data, cleaning and standardizing the data, and extracting key process nodes; secondly, designing a tree data structure based on a DFG graph structure, defining attributes of nodes and connections, mapping data into the DFG structure to accurately represent the relationship between the nodes, and extracting key nodes; and then selecting a proper directed graph layout algorithm, optimizing node distribution, and distinguishing nodes by using visual elements. And finally, designing an interactive feedback system which comprises user interface design, specific service type screening and a real-time updating mechanism, so that the user can conveniently interact with the process tree, deeply analyze the service process and improve the understanding and optimization capability of the service process.

The embodiment of the invention discloses a queriable compression method for a database two-dimensional table. Wherein the database is additionally provided with a data structure to compress and represent the two-dimensional table; the data structure comprises a value array, a field value learning type mapping tree graph and a primary key learning type mapping tree graph; the method comprises the following steps: executing construction operation to construct value arrays of all byte array type fields, field value learning type mapping tree graphs of all byte array type fields and a unique primary key learning type mapping tree graph; and performing addition, deletion, modification and query operations on the major key learning type mapping tree graph according to a received operation instruction, wherein the addition, deletion, modification and query operations comprise major key single-point query, major key range query, two-dimensional table record addition operation, two-dimensional table record deletion operation and two-dimensional table record modification operation. According to the method, the storage space of the primary key and the byte array type field value can be greatly compressed, and the addition, deletion, modification and check operation of the two-dimensional table record can be more efficiently executed.

The invention relates to the technical field of system application, and discloses an online document processing method and system based on structured storage, and the method comprises the steps: splitting content elements of an online document into blocks, and carrying out structured storage as independent objects; querying basic information of the document, loading data according to a document block pageBlockId list, creating a component according to the loaded data, constructing a component tree, and performing document rendering by using a lazy loading technology; the method comprises the following steps: abstracting documents and document blocks as objects, synchronizing the objects to a graphic database, modeling a relationship between the documents and the document blocks as an edge in the graphic database, and converting the relationship between the documents into a graphic data structure; when the document content changes, the storage interface is called to store the changed document block, and the online document is automatically stored, the document content is structurally stored in the block form, dynamic updating of the online document is achieved, the reference relation between the documents is stored and managed, and the relation between the documents is visually and clearly displayed.

The invention discloses a data encryption method and system based on multi-terminal interaction, and relates to data encryption: when a user registers for the first time, acquiring main password data input by the user, and generating main key seed data through a key derivation function according to the main password data; based on the master key seed data, a hierarchical hash algorithm is adopted to construct a key derivation tree data structure, the key derivation tree data structure takes the master key seed data as a root node, and the key derivation tree data structure is expanded layer by layer according to the device category and the device identifier to form a tree-shaped derivation path; when a new device requests authorization, a derivation path is calculated according to the key derivation tree data structure in combination with the attribute data of the corresponding new device, and exclusive key data corresponding to the new device is derived and generated from the master key seed data along the derivation path; according to the exclusive key data of the sending device, in combination with the path data of the receiving device in the key derivation tree, encrypting the data to be transmitted between the devices to generate an encrypted data stream; the encryption efficiency of the offline equipment is improved.

The invention discloses a depth data recovery method for a damaged BTRFS file system, and the method is characterized in that the method comprises the following steps: S100, employing a data structure of the BTRFS file system to obtain undamaged metadata, including a super block, a block tree, a root tree and a file system tree; s200: scanning the space in the partition except the metadata which is not damaged in the step S100, and extracting damaged metadata according to the structural characteristics of the metadata of the BTRFS file system; and S300, analyzing the metadata, extracting file information and performing duplicate removal. According to the technical scheme disclosed by the invention, the technical problem that in the prior art, data cannot be recovered or the recovery effect is poor due to the fact that the management file of the BTRFS file system is abnormal due to deletion, viruses and manual misoperation for the damaged BTRFS file system is solved.

The invention discloses a ship viscous flow numerical simulation method based on a hybrid Cartesian grid, and relates to the technical field of ship CFD. The method comprises the steps that after a computational domain is constructed, a body-fitted grid is generated at the object plane boundary of a ship model; then, on the basis of the outermost-layer body-fitted grid, a full-thread tree is used for carrying out space division on a computational domain to generate a Cartesian grid, and the full-thread tree is output as Cartesian grid topological information matched with the data structure of the target viscous flow solver; and finally, assembling and coupling the body-fitted grid and the Cartesian grid by using an overlapping grid technology to obtain a mixed partition grid unit, and applying the mixed partition grid unit to a solving process of a target viscous flow solver. Therefore, the accuracy and robustness of viscous flow numerical simulation of the ship with the complex geometry are improved, and the method can be well applied to resistance and flow field numerical simulation scenes in underwater and water surface ship body motion states.

According to the efficient matching method for the GIS multi-scale basic geographic space data, a multi-scale matching scheme based on geographic space database optimization is improved, firstly, a spatial database model based on a relational database and a spatial database engine is used as a method for storing the multi-scale basic geographic space data, and the method is high in storage speed and flexible in application; 2, establishing a new object selection method for multi-scale geographic space data matching, organizing a basic geographic entity in a data structure form of a multi-way tree based on a multi-scale semantic change rule of geographic space data, and establishing a category matching method for semantic change of the same element category of different proportional scales; a category matching relationship under a multi-scale condition is effectively constructed; and thirdly, an optimization scheme for multi-scale basic geographic space data matching is established, the matching effect is good, and the operation efficiency is high. Spatial data fusion can be efficiently realized, the spatial data quality is improved, and the map database updating efficiency is improved.

A three-stage pipeline is used to create a data structure for efficiently producing grounded recommendations that guarantee that the recommended items are part of a set, D. In the first stage, each item in D is converted into a vector representation. In the second stage, a hierarchical clustering method is used to build a tree based on the vector representations. Each item is a leaf node of the tree. Each non-leaf node represents a group of items or a group of groups of items, and so on. In the third stage, an LLM is used to generate text that encapsulates the information of the group (or groups) of items represented by each node. The generated tree is recursively traversed to generate recommendations.

The invention provides a three-dimensional model data visualization processing method and device for railway engineering, and relates to the technical field of data processing, and the method comprises the steps: obtaining three-dimensional model data, and obtaining attribute information corresponding to the three-dimensional model data; obtaining the number of vertexes; dividing the three-dimensional model data based on attribute information of the three-dimensional model data and the number of vertexes to obtain a plurality of target data sets; performing tiling processing on the multiple pieces of three-dimensional model data in each target data set to obtain multiple pieces of three-dimensional sub-data; and rendering all the three-dimensional sub-data based on a preset rendering engine to obtain a target three-dimensional image. According to the method, the uniform size of the tiled file is ensured by recombining the three-dimensional model data structure, so that the network transmission smoothness is improved. Meanwhile, index association is established based on the attribute information and the tiled file, and a visual management structure tree conforming to railway engineering management logic is constructed, so that the overall data processing and visualization efficiency is improved.

The invention relates to an equipment inspection management method and device, computer equipment and a storage medium, and belongs to the technical field of equipment detection.The method comprises the steps that identification information of to-be-inspected equipment, a target inspection item list matched with the identification information and a corresponding inspection standard are obtained, the identification information at least comprises the equipment type and the equipment model, and the target inspection item list is matched with the target inspection item list; the target inspection item list at least comprises a first inspection item corresponding to the equipment model; and obtaining an equipment type, an equipment model and a hierarchical division result corresponding to a first inspection item corresponding to the equipment model to generate a target tree data structure, determining a second inspection item in the target tree data structure, generating an inspection task based on the second inspection item and an inspection standard corresponding to a target inspection item list, and sending the inspection task to the target tree data structure. Adding the inspection task into an inspection task table; and executing the inspection task in the inspection task table, and determining the state of the to-be-inspected equipment according to the inspection task execution result. The inspection efficiency is effectively improved.

The invention belongs to the field of automobile intelligent management, and particularly relates to a vehicle tree interface optimization method for motorcade management, which comprises the following steps of: 1, constructing a vehicle tree data structure, and storing all vehicle node objects in a dictionary; 2, various vehicle states, a state display priority rule, a state propagation rule and a local sorting rule are defined, and according to the state propagation rule, when the states of vehicle nodes change, state change information is propagated upwards step by step along the recursive nested data structure; step 3, when the vehicle node changes, generating a local refreshing instruction according to the vehicle node change information, updating statistical information according to a state propagation rule, and notifying a UI layer to refresh through an agent mechanism; and step 4, dynamic unfolding and folding of grouping nodes, rapid searching and screening of vehicles and groups and batch management operation are realized based on a multi-stage TableView auxiliary class. The problems of low vehicle state refreshing efficiency and low display sorting efficiency when the data volume is large are solved.

The disclosure relates to a method (10) for determining, from a requirements automaton (AR) comprising a plurality of states (s0, s1, ... sn), a sequence of actions (SeqA) to be performed by an implementation (I) of a computer program to achieve a predetermined result (Obj) which is embodied by a set of states O u Error AR in the requirements automaton (AR), the method being implemented by an electronic device, the method comprising at least one iteration of the following steps: - selecting (S01), within a tree-like data structure (T1), a subsequence (SSeqA) of actions; - determining (S02), using the requirements automaton (AR), a current action (vin) to be executed after the subsequence of actions (SSeqA); - executing (S03), by the implementation (I), the subsequence of actions (SSeqA) and the current action (vin), delivering a current action result (vout); - executing (S04), by the implementation (I), as a function of the current action result (vout) and as a function of an actions optimization data structure (AODS), a complementary subsequence of actions (CSSeqA) delivering a reward value (r) associated to the current action (vin); - adding (S05) the current action (vin) and its reward value (r) within the tree-like data structure (T1) and determining if said predetermined result (Obj) is reached for obtaining the sequence of actions (SeqA).

The invention discloses a multi-dimensional tree form control generation method and device, and relates to the field of data processing. The method comprises the steps of obtaining a flattened original data array, an expandable dimension array, a maximum dimension hierarchy and a configuration object issued by a background; initializing a core data structure; original data and all nodes are traversed, father nodes are searched, the relation is established, and a two-channel tree structure is constructed; generating and rendering a table view based on the constructed tree structure; and in response to user interaction, dynamically unfolding and folding table nodes by maintaining inter-row reference and folding states. According to the method, the natural hierarchy and the interactive expansion hierarchy of the data are separated through the dual-channel tree structure, and the problems of hierarchical disorder, low rendering efficiency and slow interactive response of a traditional tree table during multi-dimensional data analysis are solved by utilizing a path key mapping and state local updating mechanism; efficient and flexible multi-dimensional data display and interaction are realized, and the method is suitable for enterprise-level data analysis scenes.

The invention discloses a database statement conversion method and device, equipment and a storage medium, and is applied to the field of databases. The method comprises the steps that a to-be-converted database statement of a to-be-converted database is acquired, the to-be-converted database statement is analyzed, and an abstract syntax tree of the to-be-converted database statement is acquired; setting an intermediate state data structure, traversing tree nodes of the abstract syntax tree, and converting the abstract syntax tree into an intermediate state statement under the intermediate state data structure; determining a target database dialect of the target database, and analyzing the clause of each intermediate state statement based on the target database dialect to obtain a clause analysis result; and splicing the parsed results of the clauses to obtain a target database statement of the target database. By providing the universal database statement analysis and conversion method, the problems of low efficiency and high error rate caused by manually writing different conversion scripts based on different database types to perform database conversion are avoided.

The invention provides a data prefetching optimization method and system for a high-frequency multi-core real-time controller. The method comprises the following steps: performing multi-stage query monitoring on a data access behavior of the controller, generating access statistical data, extracting node popularity based on counter information of tree data structure nodes, and constructing node popularity information. And establishing a prefetching table by using the node popularity information and the access statistical data, and generating an initial prefetching strategy through a preset path prefetching algorithm. And dynamically adjusting the initial prefetching strategy according to the current system load of the controller to generate an optimized prefetching strategy. And then, based on the optimized prefetching strategy, creating a jump pointer queue for the target data, constructing a quick access structure, and performing prefetching operation on the target data through the structure to generate a preloaded data set. According to the method, invalid prefetching is effectively reduced, the data loading efficiency and the system operation performance are improved, and the method is suitable for a multi-core controller application scene with a high real-time requirement.

An aspect of the disclosure related to methods and systems configured to detect that an item of streaming primary video content associated with a channel of scheduled streaming content is designated to be streamed to a device. Ancillary content is identified. Alternative versions of respective sections of the ancillary content are identified. Metadata corresponding to the alternative versions of ancillary content, metadata corresponding to the item of primary video content, and / or metadata corresponding to the channel are used in selecting a first section from among the alternative versions of a given section. The ancillary content, including the selected first section from among the alternative versions is streamed to the device immediately before, during, or immediately after the item of streaming video content. The alternative versions may be transcoded to generate multiple encoded iterations of respective alternative versions and the encoded versions are stored in a tree data structure.

The invention relates to the technical field of data analysis, and particularly discloses a cross-platform data acquisition system and method, and the system comprises a single platform crawling module which is used for carrying out data crawling on a single platform to obtain a single platform data crawling result; the data structure combing module is used for generating each cross-platform data structure tree; the data structure division module is used for dividing the complete data of each cross-platform according to the structure based on the data structure tree of each cross-platform to obtain all data sets of each structure level of each cross-platform; the correlation degree analysis module is used for performing correlation degree analysis on the single platform data crawling result and all data sets of all cross-platform structure hierarchies to obtain a correlation degree analysis result; the cross-platform crawling module is used for performing cross-platform data crawling in each piece of cross-platform complete data based on the correlation degree analysis result to obtain a cross-platform data crawling result; the method and the device are used for realizing high-precision cross-platform data acquisition.

A key-value store is provided, implementing multiple-tiered sorted data structures in memory and storage, including concurrent write buffers in memory, and page-level consolidation of updates on storage, where pages are trivially translated in physical-to-virtual address mapping. The key-value store is built on an indexed sorted data structure on storage, occupying much less storage space and incurring much less disk activity in consolidating updates than a conventional log-structured merge tree organized into files. Concurrent write buffers operate concurrently and independently so that data is committed from memory to storage in an efficient manner, while maintaining chronological sequence of delta pages. Trivial mapping allows mappings of a number of physical pages to be omitted, enabling page mapping tables to occupy less storage space, and simplifying processing workload of read operation retrievals from storage.

Apparatuses, systems, and techniques to parse textual data using parallel computing devices. In at least one embodiment, text is parsed by a plurality of parallel processing units using a finite state machine and logical stack to convert the text to a tree data structure. Data is extracted from the tree by the plurality of parallel processors and stored.

The present invention relates to the field of computer technology, and provides a method and device for processing a heap data structure, the method comprising: updating the heap data structure according to the operation information of the tree and the data structure of the node; the operation information of the tree includes the node to be operated and the operation instruction of the node to be operated; the heap data structure at least includes a main subtree which is a standard subtree and a candidate set composed of standard subtrees to be merged into the main subtree; in the heap data structure, the root node has no sibling nodes and parent nodes, and the key value of the left child node and the key value of the right sibling node of the left child node and the key value of the parent node and the key value of the child node in the sequence from left to right of the child nodes of the same parent node all satisfy a first relationship. The present invention can effectively solve the problems of resource overhead and complexity of changing key values ​​in continuous heap moving data, as well as the complexity of deleting elements and changing key values ​​in discrete heap, and the heap data structure can significantly improve the operating efficiency of the system.

Approaches presented herein provide database formats for storing large-scale three-dimensional (3D) models for streaming and constructive solid geometry operations. The storage structure may include a Directed Acyclic Graph (DAG), with each root of the DAG uniquely identifying a 3D model. A tree spanning the DAG starting at a root (202) forms a hierarchical representation of that model, including a series of levels of detail (208A-208N) along with associated shards (214). The model may also include nodes (212) with node attributes (416) that may be stored in a column and row structure to facilitate retrieval of individual attributes (416) to enable selective loading of portions of the models.