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

This invention provides a method, device, equipment, and storage medium for intelligent configuration of indoor components. The method includes: calculating initial position parameters of components through matrix transformation in a pre-constructed three-dimensional coordinate system; constructing a tree-shaped data structure based on component combination relationships and performing attribute inheritance propagation to obtain inherited attribute parameters; establishing a parameter-dependent directed acyclic graph based on the initial position parameters and inherited attribute parameters, and performing parameter linkage propagation calculation to obtain linkage update parameters; performing bounding box collision detection and multi-objective optimization calculation on the linkage update parameters to obtain optimal component configuration parameters that satisfy the constraints. This invention achieves intelligent and precise configuration of indoor components through parameterized matrix transformation, tree-structured attribute inheritance, directed acyclic graph parameter linkage, and automated conflict optimization.

This application discloses techniques related to tree data structures capable of storing information indicative of database key codes. A computer system can operate a database. The computer system can store a multi-level tree data structure capable of being used to perform key code lookups for the database. In various cases, the multi-level tree data structure can be stored in system memory as a plurality of sub-tree data structures, each sub-tree data structure comprising a set of linked nodes. A given one of the plurality of sub-tree data structures can be stored in system memory as a respective contiguous block of information. The computer system can access the respective contiguous block of a first particular sub-tree data structure encompassing a particular range of levels in the multi-level tree data structure. The access can be performed without accessing one or more other sub-tree data structures encompassing one or more levels within the particular range of levels.

Systems and methods for providing a Spatially Partitioned Ideally Chunked Entity (“SPICE”) tree data structure are provided herein. In an example, a computerized method for using a SPICE tree includes determining a document defined by a SPICE tree data structure and navigating to content within the document based on the SPICE tree data structure. The SPICE tree data structure includes a root chunk containing radar nodes and a plurality of chunks. Each chunk includes one or more object nodes, each of which corresponds to a document attribute. Each of the radar nodes includes a reference to one of the chunks and the object nodes include a placeholder node that provides a reference to another chunk based on a position of the placeholder node within the respective chunk. The root chunk and the chunks are arranged in a hierarchical arrangement with the root chunk being a parent to the chunks.

This invention relates to the field of data processing technology, specifically to a method for dynamic positioning of page elements based on an adaptive waiting strategy. The method involves extracting latency jitter data and combining it with the historical loading characteristics of the target page to obtain a waiting time limit. Within this limit, the method monitors the internal mounting state, visual visibility state, and layout stability state of the target node. When the internal mounting state of the target node is ready, but the visual visibility state and layout stability state assessments fail, the geometric size feature weights of the target node are stripped, and node data of the internal mounting state is extracted. An undirected graph data structure is constructed to downgrade and anchor the target node. When the target node is downgraded and its local node block is already mounted to the page node tree, the nearest ancestor node container that has completed layout rendering is backtracked as a reference to construct a safe interaction boundary. Before the overall webpage resources are fully loaded, interactive operations are performed on target nodes that have not escaped the safe interaction boundary.

The application provides a three-mode redundant circuit netlist compiling method and device based on state machine conversion, belongs to the technical field of anti-radiation integrated circuit netlist compiling processing, and comprises the following steps: generating a netlist ASCII text stream and a keyword-regular set by inputting core source data suitable for an anti-radiation scene, triggering a lexical analyzer, forming an ordered lexical unit sequence through lexical analysis, constructing a state transition graph and checking the state transition graph, integrating the graph and a fragment, extracting a syntax tree, converting the syntax tree into a flow graph data structure, finally generating an IR intermediate representation mapped with SoC hardware, and outputting the IR intermediate representation. The three-mode redundant circuit netlist compiling method and device based on state machine conversion are used, so that the problems of low recognition efficiency, large cost and easy deletion of redundant logic in the process of processing a three-mode redundant circuit netlist by a traditional hardware compiler are solved.

This invention relates to the field of natural language processing technology, specifically to an intelligent template generation method based on dual-document comparison. The method includes: receiving a benchmark and comparison document, performing parsing and matching, and outputting a benchmark model tree, difference features, spatial coordinates, and offset matrix; constructing a text dependency graph by performing topological mapping combined with lexical boundaries, and extracting and concatenating a multi-dimensional joint tensor; inputting the tensor into a semantic network to generate and verify labels, and fusion the multi-dimensional output mapping data structure; parsing the structure to extract logical placeholders, replacing the difference nodes of the benchmark tree according to coordinates to generate a constraint tree, and finally serializing and outputting a structured document template. This invention constructs a closed-loop end-to-end system from low-level physical offset extraction, mid-level topological semantic calibration to high-level template serialization output, improving the system stability and data flow consistency during automated processing of complex typed documents.

A tree database includes nodes organized as one or more tree data structures. The nodes contain both function and data properties in the form of script files in an interpreter environment. The database is event-driven. Responsive to an event, a node can spawn a new child node in the tree, which contains a data item associated with the event, enabling the tree database to grow as events and data arrive. Query events, initialization, and purging are also supported. Example applications of a communication appliance, an educational quiz, and a music database are provided.

Techniques are described for fast large file truncation. An example method includes receiving, by a data platform, a request to truncate a file, wherein data of the file is stored in a tree data structure including a plurality of nodes with leaf nodes corresponding to data of the file; determining a first node of the plurality of nodes including a plurality of child nodes; determining, based on a maximum key, a subset of the child nodes corresponding to a portion of the data that is to be retained; based on determining not to traverse the first node, updating a second node that is a parent of the first node to include a pointer to each child node of the subset of child nodes; and moving, from a subset of leaf nodes referenced by the subset of child nodes, a leaf node to rebalance the tree data structure.

The application belongs to the technical field of data query, and specifically discloses a data query method, system, terminal and medium based on a double-field tree structure. By simultaneously setting node identification information, parent node identification information and root node identification information for each node in the tree structure, a data structure with clear tree boundaries is constructed. After receiving a hierarchical query request for a target node, the range of a node set participating in the query is limited based on the root node identification information of the target node, and a hierarchical traversal operation is performed within the limited range according to the parent node identification information, so that efficient query of superior, inferior or peer nodes of the target node is realized. The application can realize efficient, stable and consistent data query in a large-scale, multi-level tree structure scene, and has good practicability and engineering application value.

The application discloses a method for modifying RTL source code files and an electronic device, the method comprising: obtaining all RTL source code files of a design under test and a file name of a top RTL source code of the design under test, associating instantiation names of each module in each RTL source code file with the file name, and saving the association result as a tree type data structure; obtaining all signal names corresponding to each module in each RTL source code file one by one, and position information of each RTL source code file corresponding to the data structure, adding a prefix before the signal name to obtain a complete signal name according to the position information; selecting at least one signal to be observed from all complete signals, detecting each signal to be observed in a list of signals to be observed one by one to obtain a detection result, and modifying the RTL source code file corresponding to the signal to be observed based on the detection result. The application solves the technical problem of low efficiency of adaptive modification of a design under test in the prior art.

This disclosure relates to a demand automaton (A) comprising multiple states (s0, s1, ..., sn). R (10) determines the sequence of actions (SeqA) to be executed by the implementation (I) of the computer program to achieve a predetermined result (Obj), which is determined by the demand automaton (A). R The method, implemented by an electronic device, represents a set of states in a tree-like data structure (T1) and includes at least one iteration of the following steps: selecting (S01) action subsequences (SSeqA) within the tree-like data structure (T1); using a demand automaton (A... R (S02) Determine (S03) the current action (SSeqA) to be executed after the action subsequence (SSeqA); execute (S04) the action subsequence (SSeqA) and the current action (S05) through implementation (I) to obtain the current action result (S06); execute (S07) the complementary action subsequence (CSSeqA) according to the current action result (S06) and according to the action optimization data structure (AODS) through implementation (I) to obtain the reward value (r) associated with the current action (S06); add (S05) the current action (S06) and its reward value (r) to the tree data structure (T1) and determine whether the predetermined result (Obj) has been reached to obtain the action sequence (SeqA).

This document discloses methods, apparatus, systems, and computer-readable media for improving packet filtering efficiency by reducing processing time and / or memory usage. The packet filtering appliance uses one of various types of data structures, such as flat hash maps and / or rule trees, to look up packet filtering rules of a cybersecurity policy that should be applied to packets in transit. The packet filtering appliance searches an index data structure for matches of the search object against the matching criteria of the policy rule's threat indicators, in the form of values ​​that the packet filtering appliance extracts from packets in transit. Each of the index data structures maps the rule identifiers (rule IDs) of the policy rules to keys based on (or containing) the matching criteria of those rules.

This invention provides a method for reading data stored in a tree data structure, such as a B+ tree, using near data processing (NDP) in a cloud-native database. According to an embodiment, the expected LSN is used for NDP page reads on a primary compute node (e.g., a primary SQL node). When the primary compute node (e.g., a primary SQL node) reads a regular page, the maximum expected LSN of that regular page (e.g., the latest page version number) is used. The embodiment utilizes the expected LSN and page locking features, where the correct version of a page can be obtained by combining the expected LSN associated with the page with the page locking, and consistent tree structure readings can be achieved, resulting in good read / write concurrency.

The application belongs to the field of data storage, and particularly relates to a segmented B+ tree index structure based on PM. The HGB+ tree improves the performance of the index structure through a 'hourglass' leaf node structure and four mechanisms. The constructed HGB+ tree index structure is directly stored on the PM, and only the PM is used to complete the creation and use of the index structure. When the tree is created, the memory pool is first created or opened through the management library in the PM. Then, the necessary global metadata structure is created for the HGB+ tree in the PM, and subsequent operations are performed on the HGB+ tree. The internal nodes and leaf nodes of the HGB+ tree are deployed on the PM. The application designs a unique 'hourglass' leaf node structure scheme, and improves the performance of the storage system through the optimization of the basic operation strategy of the index structure and four beneficial mechanisms.

The application discloses a kind of metadata request concurrent control method and system for distributed block storage, first according to the attribute information and service logic information of distributed block storage system metadata, metadata is grouped, and the root node between the sub-level tree structure based on grouping is obtained Service logic information establishes to obtain metadata structure tree, then based on metadata structure tree, tree-shaped lock mechanism is constructed, and fine-grained lock management is realized;For the time point and RPC request type of each user RPC request, transaction ID is created for request, by analyzing the user RPC request corresponding to each transaction ID, the specific node that request needs to process is determined, then from the total control node of tree-shaped lock, all relevant root node paths are traversed downwards, and locking operation is performed step by step, to ensure the availability of metadata service, the fine-grained characteristics of tree-shaped lock allow concurrent execution of requests on different sub-trees, improve the concurrency and throughput of metadata service.

This application relates to the field of key-value database technology, and discloses a method and system for optimizing key-value database read and write operations based on a CSD (Computer-Simplified Data Structure) learning index. The method includes: collecting key-value pairs to be persisted in memory; sorting them by key to form an ordered key sequence; and evaluating the access frequency of key intervals corresponding to the key sequence based on real-time access statistics. For key intervals with access frequency exceeding a preset threshold, training and utilizing the corresponding learning index model to output the predicted offset position of each key-value pair in the key sequence. Based on the predicted offset position, the key-value pairs are written to a storage device to form an ordered string table file, and the physical storage gaps in the predictive active layout are automatically compressed using a computational storage device. The method for constructing the newly generated ordered string table file is dynamically determined based on changes in access frequency, real-time system load, and the merging process of the LSM tree. This application significantly improves the efficiency of hot data reading and maintains a balance between read performance and system resource utilization.

Disclosed embodiments may provide techniques for performing database operations using a hierarchy-enhanced B-tree index. A computer-implemented method can include executing a query to access a data item by traversing a root node of a hierarchy-enhanced B-tree index to a particular leaf node connected to the root node. In some instances, the particular leaf node indicates a first unstructured-data record. The method can also include determining that the particular leaf node includes a sequential data structure. The sequential data structure identifies a hierarchical relationship between the first unstructured-data record and other unstructured-data records indicated by one or more other leaf nodes. The method can also include using the sequential data structure to access the one or more other leaf nodes without additional path traversals of the hierarchy-enhanced B-tree index. The method can also include retrieving the data item by parsing the other unstructured-data records.

A method performed by a graphics processor obtains a starting bounding volume hierarchy (BVH), being a data structure comprising nodes representing different 3D regions of space in a modelled environment, the data structure comprising a tree in which the nodes are arranged hierarchically from a root node down to a plurality of leaf nodes, wherein the region modelled by each leaf node encompasses at least one primitive or part of a primitive. The method further comprises performing one or more iterations, starting with a first iteration which starts with the starting BVH as a current BVH, which search for candidate reinsertions to move input nodes to new parents in the tree to reduce expected computational cost.

This invention discloses a method and system for constructing a data structure for verifying the completeness of encrypted range retrieval results. The method involves calculating quantile arrays for each searchable dimension based on sampled data records; normalizing the value range of the data records to the interval [0,1] using the quantile arrays; calculating the number of levels required for the cube coding system; allocating data records to different cube units using the cube coding system; encrypting records belonging to the same cube unit using a key to generate a cube index; and constructing a verification data structure based on a multi-way tree structure, using each cube in the cube index as a leaf node of the multi-way tree, and building the multi-way tree layer by layer from bottom to top to form a complete verification data structure. This method constructs a verification data structure that can be used for verifying the completeness of encrypted range retrieval results with relatively low computational and storage overhead, solving the problems of excessive computational overhead and difficulty in handling large-scale datasets in existing methods.

The application discloses a software project semi-automatic reconstruction method based on a dependency tree construction and artificial intelligence assistance, receives a software project root directory and automatically determines a construction root file; parses the construction root file to identify an executable file and a source file list thereof, and determines a program entry file; scans a project directory to construct a file tree data structure; parses a header file from the program entry file, recursively constructs a dependency tree based on an analyzed set; performs interactive graphical display on the dependency tree, and performs layout, color coding and dependency direction identification according to node levels and the number of child nodes; calls an artificial intelligence model to generate summary annotations for leaf node files of the dependency tree and recursively aggregates from bottom to top to form a project summary; performs cyclic dependency detection on the dependency relationship and identifies design bad smells, generates reconstruction suggestions based on analysis results, and presents the reconstruction suggestions on a graphical interface; and receives user confirmation and / or adjustment to output final reconstruction suggestion results.

Techniques are described for identifying deleted keys during snapshot comparisons managed by a data platform. A computing system that implements the data platform comprising a memory and processing circuitry may be configured to perform the techniques. The memory may store metadata identifying, at least in part, one or more deleted keys representative of deleted data that has been deleted from a storage system. The processing circuitry may identify a first tree data structure corresponding to a first snapshot of the storage system at a first time, and identify a second tree data structure corresponding to a second snapshot of the storage system at a second later time. The processing circuitry may traverse the first tree data structure and second tree data structures to identify the one or more deleted keys, and perform, based on the deleted keys, a data protection operation.

The application discloses a kind of graph data heterogenous layered storage structure and method based on persistent memory, the application uses layered hash table heterogenous storage structure, stores the equivalent query data structure in topology data and index data in graph data, simultaneously using a layered storage B+Tree storage structure, stores the range query data structure in index data, solves the problem of query speed and limited memory space, simultaneously by converting the random write of persistent memory into sequential write, reduce write delay, by constructing the architecture of layered storage, reduce the write times of data structure in persistent memory, improve query efficiency.

The present disclosure relates to a webpage content representation method, device, equipment and storage medium. The present disclosure parses the hierarchical structure of webpage content in a target webpage through a title tag in a hypertext markup language file corresponding to the target webpage, and parses the relationship between content elements in the webpage content according to a content tag in the hypertext markup language file. Further, a tree-shaped data structure is constructed according to the hierarchical structure and the relationship between the content elements, different nodes in the data structure including different content elements in the webpage content, so that the data structure can not only represent the webpage content, but also embody the hierarchical structure of the webpage content and the relationship between different content elements in the webpage content. The data structure can effectively and sufficiently represent the webpage content, so that a large number of document resources existing in the Internet can be effectively utilized, especially in intelligent dialogues.

This invention discloses a method and apparatus for generating a multi-dimensional tree-shaped table control, relating to the field of data processing. The method includes: obtaining a flattened raw data array, an expandable dimension array, a maximum dimension level, and a configuration object from the backend; initializing the core data structure; traversing the raw data and all nodes, finding the parent node and establishing relationships to construct a dual-channel tree structure; generating and rendering a table view based on the constructed tree structure; and responding to user interaction by dynamically expanding and collapsing table nodes through maintaining inter-row references and collapse states. This invention separates the natural hierarchy and interactive expansion hierarchy of data through a dual-channel tree structure and utilizes path key mapping and a local state update mechanism to solve the problems of hierarchical chaos, low rendering efficiency, and slow interactive response in traditional tree tables during multi-dimensional data analysis. It achieves efficient and flexible multi-dimensional data display and interaction, suitable for enterprise-level data analysis scenarios.

An electronic device, including: a processor; and a memory configured to store instructions which, when executed individually or collectively by the processor, cause the electronic device to: form a configuration space including a starting point, a target point, and map information for generating a moving path of a robot; predict, based on the configuration space, a current position of the robot, and a progress corresponding to the current position with respect to the moving path; obtain a sample corresponding to an arbitrary point in a portion the configuration space, based on the progress; and generate the moving path by expanding a tree until the tree reaches the target point from the current position, by adding the sample to the tree, wherein the tree represents a hierarchical data structure for generating the moving path

The application discloses a point cloud efficient management method integrating NoSQL, a space filling curve and an R* tree and application, and the method comprises the following steps: S1, point cloud partitioning: adaptively partitioning space according to the distribution density of point cloud in three-dimensional space; S2, point cloud layered index structure: constructing a global index tree based on the space filling curve and the partitioning result, constructing a partition local index in combination with an R* tree, and organizing point cloud data according to a node structure; and S3, point cloud storage scheme design: realizing point cloud efficient storage management by using MongoDB according to the point cloud layered index structure. The application is based on the spatial discrete distribution characteristics of point cloud data and a hybrid index scheme, and a special data structure and a storage scheme are designed, so that the problem of mass point cloud data management difficulty is solved, and efficient and scalable point cloud retrieval and storage are provided.

Disclosed embodiments may provide techniques for performing database operations using a hierarchy-enhanced B-tree index. A computer-implemented method can include executing a query to access a data item by traversing a root node of a hierarchy-enhanced B-tree index to a particular leaf node connected to the root node. In some instances, the particular leaf node indicates a first unstructured-data record. The method can also include determining that the particular leaf node includes a sequential data structure. The sequential data structure identifies a hierarchical relationship between the first unstructured-data record and other unstructured-data records indicated by one or more other leaf nodes. The method can also include using the sequential data structure to access the one or more other leaf nodes without additional path traversals of the hierarchy-enhanced B-tree index. The method can also include retrieving the data item by parsing the other unstructured-data records.

The application discloses a kind of material attribute parallel extraction and conversion method and system for multiple CAD platforms, in response to material attribute extraction task, create and record the target CAD model path corresponding to task instance, target CAD platform type and output format information;Corresponding API interface is called from target CAD model path to carry out model file loading and parsing into structure tree, extract the multidimensional original attribute information bound to each component node;According to the preset field standardization template, multidimensional original attribute information is respectively mapped and unit converted, and a standardized data structure model is obtained;Generate structured XML file and perform verification, form the attribute extraction conversion file that meets the requirements of output format information, for external interface call.The application can automatically complete the extraction of material physical property field in CAD platform, structure standardization, format conversion and data verification, and finally output the extraction result as XML document format conforming to the aviation industry standard.