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

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 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.

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 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 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.

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.

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.

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 present disclosure relates to a mesh reconstruction method, a device and a storage medium. The mesh reconstruction method includes constructing a data structure according to three-dimensional scanning data and a preset mesh side length. Node information of a target tree node among a plurality of tree nodes included in the data structure is determined. A level of a mesh to be extracted of the target tree node is determined according to the target data. Once a scalar field of the target tree node is calculated according to the node information of a neighboring tree node corresponding to the target tree node and the node information of the target tree node, a reconstructed mesh model is obtained according to the scalar field.

The invention discloses a data processing system and method for big data modeling, and belongs to the technical field of data processing.The method specifically comprises the steps that feature tree operation records, geometric grids and constraint solving logs are collected in a computer aided design environment and combined into an initial data packet, and a design number and a time stamp are bound; respectively converting the three types of data into a topological sequential sequence, a graph data structure and a constraint conflict trajectory sequence, and unifying the topological sequential sequence, the graph data structure and the constraint conflict trajectory sequence into a sample unit format; generating a geometric semantic slice sequence and bidirectional index mapping on the graph data structure according to a topological time sequence, generating a multi-view rendering result for the slice, synthesizing a tensor, and keeping an index relationship from pixels to topological entities; performing time sequence alignment based on the multi-view rendering tensor, the topology time sequence and the constraint conflict trajectory sequence, generating a geometric sample index table, and performing fragmentation storage; and finally, exporting a uniform-format data packet containing a graph data structure, a time sequence and image features from the index table for direct reading of a big data modeling processor.

Systems and methods for using a scalable collection within a balanced tree data structure are provided herein. In particular, techniques for generating scalable collections and using scalable collections for fetching data corresponding to an application using balanced chunked data tree structures are provided herein. In an example, the method may include determining a document defined by a balanced tree data structure having a root chunk, reference chunks, and chunks each having nodes each corresponding to a document attribute. The nodes may include a scalable collection containing a list node and child nodes associated with the list node, and a placeholder node that provides a reference to another chunk based on a position of the placeholder node within a respective chunk. The method may also include navigating to content within the document based on the balanced tree data structure.

The invention discloses an R-tree spatial index design method oriented to a DRAM-NVM hybrid storage architecture, relates to the technical field of computer data storage, and provides a write optimization spatial index HR-Tree under the DRAM-NVM hybrid architecture. The core design thought is that internal nodes are deployed on a DRAM, leaf nodes are placed on an NVM, and a targeted data read-write operation process is designed; in the aspect of an index structure and an operation mechanism, a minimum expansion strategy is adopted around a scene of less reading and more writing, a leaf node data structure and an in-situ updating algorithm on the NVM are designed in a targeted manner, and the write request processing efficiency can be improved on the premise of ensuring data consistency. And the multi-character data expansion and efficient fault recovery are provided, so that the actual requirements of the user are better met by allowing more flexible personalized configuration and shortening the service pause time. The method is suitable for the application fields of computer technology, database technology, data storage and the like.

A computer-executed method for the simultaneous processing of operations on a tree-based data structure, which features: Receiving an input at a storage system that manages a storage unit in which the tree-based data structure is stored, wherein the input denotes a set of heterogeneous operations to be applied to the tree-based data structure; as part of a search phase, locating one or more nodes of the tree-based data structure to which one or more operations of the set of heterogeneous operations are to be applied; and as part of an update phase, simultaneous and mass execution of one or more operations from the set of heterogeneous operations; where access to the nodes of the tree-based data structure during the search phase takes place via shared authorization; and where access to nodes to which one or more operations of the set of heterogeneous operations are applied during the update phase is granted by means of an exclusive authorization, the search phase exhibits: Evaluating nodes at each level of the tree-based data structure in descending order; and wherein the evaluation for each level includes the simultaneous determination of whether any of the nodes in the level being evaluated are one or more of the following: a node to be used for forwarding the search in the tree; and a node to which one or more operations of the set of heterogeneous operations are to be applied.

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.

The invention relates to the field of block chains, and discloses a government affair approval data credibility method and system based on a block chain technology, and the method comprises the steps: S11, receiving an application; s12, dividing the data; s13, performing hierarchical encryption; s14, under the data storage chain, generating a root hash; s15, the first block is linked in a consensus mode; in the examination and approval stage, S21, data are verified, and operation is received; s22, updating the data, and generating a new root hash; s23, a second block is linked in a consensus mode; the system comprises a data interface module, a data processing module, a composite tree construction module and a consensus writing module. By adopting an on-chain and off-chain collaborative architecture and constructing an MRBT composite tree data structure to aggregate and identify off-chain data, the technical effects of efficiently verifying data integrity and effectively preventing data from being tampered are achieved, non-tampering and traceability of government affair approval full-process data are realized, the authenticity and credibility of approval data are ensured, and the method and the device have the advantages of being high in practicability and easy to popularize and use. And the final credibility of the approval result is improved.

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.

The application relates to an assembly tree construction method, an assembly tree access method, an assembly tree construction device, an assembly tree access device, an assembly tree construction equipment, an assembly tree access equipment and a computer storage medium. The method comprises the following steps: assigning ID information to each assembly part; constructing an assembly tree with each assembly part as a node, and recording the ID information of the assembly part corresponding to each node in the assembly tree; and constructing an assembly part linear table based on the ID information of each assembly part, and recording the ID information of each assembly part, and the hierarchical relationship between the nodes corresponding to each assembly part in the assembly tree in the assembly part linear table. According to the embodiment of the application, each assembly part is assigned ID information, and the tree structure is displayed in the form of a linear table. When it is necessary to find or operate the assembly part, the entire structure tree does not need to be traversed, the software calculation amount is small, the response speed is also very fast for a large-amount-of-data structure model, and no lag occurs.

The application discloses a kind of based on four-tree and vehicle GPS track abstract grid road network establishment method, comprising the following steps: (1) according to GPS data logical relationship feature selection four-tree data structure;(2) using spatial connection operation will GPS data and actual road network data store in four-tree data structure;(3) using the GPS data embedding algorithm based on four-tree, according to taxi GPS data division basic grid unit;(4) according to road network topological structure, determine whether the connecting arc between each grid unit exists;(5) according to the shortest path distance between the road network nodes in each grid unit, the connecting arc weight of each grid unit is calculated by average;(6) establish abstract grid road network.The application can provide certain auxiliary reference for empty taxi path planning, reduce its empty rate.

The invention discloses a hybrid processing method based on concurrent service acceptance, and relates to the field of computer task processing, and the method comprises the steps: receiving a hybrid service handling request, carrying out verification according to preset protocol configuration information, and carrying out the grouping forwarding of the hybrid service handling request according to a service type; the protocol configuration information is realized by adopting a tree-shaped data structure; each type of business analyzed from the mixed business handling request information is separated, an original corresponding sub-business verification process is called for verification and unified fee calculation, sub-orders of each business type are generated, and processing priorities of the sub-orders are calculated according to the business types and business relations; and submitting the mixed service sub-orders according to the priority sequence. According to the method, the system processing time is shortened through highly concentrated service verification and fee calculation, the processing efficiency is improved, the mixed service sub-order processing sequence is adjusted according to the priority, and flow control of processing each service by multiple services is accepted at the same time.

Embodiments store data files. One such embodiment divides a data file into chunks. A data structure representing the data file is constructed. The data structure includes a hierarchical tree representing blocks. Then, a respective block identifier (ID) corresponding to the block is generated. Next, non-duplicate block (s) are identified from the blocks based on the generated respective block IDs. Data packet (s) are constructed based on the constructed data structure and the identified non-duplicate block (s). The constructed data packet (s) is then stored in a memory.

A method for splitting a node of a metadata tree, the method includes (i) splitting the node of the metadata tree based on a lock contention parameter that differs from a fullness of the node, to provide split nodes; and (ii) preventing a size based merge of the split nodes for a time period following a period of a defined duration that starts after the splitting.

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.

Techniques are disclosed relating to ray tracing, e.g., in graphics processors. Ray tracing embodiments may utilize a bounding volume hierarchy (BVH) acceleration data structure (ADS) that includes a hierarchy of bounding volumes. A graphics processor may traverse the ADS, testing for intersections with bounding volumes, to determine which primitives to test for a given ray. Some nodes may be transform nodes (e.g., instance nodes) that correspond to a ray transform before further traversal. In disclosed embodiment, one or more levels below the transform node may be reverse transformed and included above the transform node. This may advantageously avoid a ray transform operation for rays that would not have hit in the first one or more levels of the transform sub-tree.

The invention discloses a distributed block storage-oriented metadata request concurrency control method and system, and the method comprises the steps: firstly, carrying out the grouping of metadata according to the attribute information and business logic information of the metadata of a distributed block storage system; a metadata structure tree is established based on business logic information between root nodes of the sub-level tree structures obtained through grouping, then a tree-shaped lock mechanism is constructed based on the metadata structure tree, and fine-grained lock management is achieved; the method comprises the following steps: creating a transaction ID for a request for a time point and an RPC request type of each user RPC request, analyzing the user RPC request corresponding to each transaction ID, determining a specific node required to be processed by the request, then starting from a general control node of a tree lock, traversing all related root node paths downwards, and carrying out locking operation step by step. The availability of the metadata service is ensured, the requests on different sub-trees are allowed to be executed concurrently due to the fine-grained characteristic of the tree lock, and the concurrency and throughput of the metadata service are improved.

The embodiment of the invention provides a method, device and equipment for chip design, a medium and a program product, and relates to the field of chip design tools. The method comprises: receiving a first editing request for a plurality of graphic elements in a chip design user interface, wherein geometric data of the plurality of graphic elements are stored in a first tree data structure; determining that the first editing request meets a threshold condition; receiving a second editing request for the plurality of graphic elements; receiving a first query request; on the basis that the first query request is received and the threshold condition is met, utilizing the first editing request and the second editing request to newly establish a tree data structure so as to obtain a second tree data structure; and querying the second tree data structure by using the first query request. In this way, when the threshold condition is met, multiple updates to the tree can be replaced by reconstructing the tree when the query request is received, thereby improving the efficiency of updating and querying the data structure.

Systems and methods are disclosed herein for temporally predictive coding of three-dimensional (3D) dynamic point cloud attributes. A first frame and a second frame of point cloud data are accessed. The point cloud data points include 3D spatial coordinates and one or more graphic attributes. A block tree data structure comprising a plurality of blocks is generated based on a tree partitioning of the second frame of point cloud data. Matching block pairs between the first frame and the second frame are identified from the plurality of blocks based on block-wise searching. Frequency-domain projections are generated for each matching block pair via a graph Fourier transform (GFT) algorithm. A bitstream of motion-compensated residuals is generated based on differences in the frequency-domain projections for each matching block pair.

The invention relates to the technical field of computers, and discloses a multi-way tree data structure construction method and device, a storage medium and a program product. The multi-way tree data structure construction method comprises the following steps: acquiring storage data and a corresponding node hash value; based on the storage data and the node hash value, calculating a leaf proof value by using a pre-acquired node polynomial; taking the index position of the leaf node as an interpolation point, and calculating an internal node commitment value and an internal proof value corresponding to each internal node through a node polynomial based on a polynomial commitment algorithm; taking the index position of the internal node as an interpolation point, and calculating a root node commitment value through a node polynomial based on a polynomial commitment algorithm; and constructing a multi-way tree data structure based on the leaf promise value, the internal node promise value, the internal promise value and the root node promise value which are obtained through calculation. According to the method provided by the embodiment of the invention, the storage space and the network bandwidth can be saved, the verification cost is reduced, and the verification speed is improved.

The invention discloses a logical operation method based on depth-first traversal and stack recursion, and belongs to the technical field of computer logical operation and data processing. The method aims at solving the problems that in the prior art, when a complex nested logic expression is processed, operator priority judgment is complex, short circuit evaluation is difficult to achieve, and code maintainability is poor. The core of the method is that firstly, a nested logic expression to be calculated is abstracted into a tree-shaped or nested array data structure; secondly, a depth-first traversal algorithm is adopted to conduct recursive scanning on the data structure, and in the traversal process, encountered logic operators and basic judgment conditions (calculation factors) or intermediate calculation results of sub-expressions are sequentially pressed into a main stack according to the traversal sequence; when traversal of one sub-expression is completed, an actuator module is automatically triggered; and the executor module pops up a logic operator of the current action range from the main stack.

Described are techniques for reducing overhead controls. A loop tree is constructed from a program, such as a structured control flow program. Structured control flow refers to a programming concept where the flow of control to a block or region is based on single entry and single-exist methodology (SESE). A loop tree refers to a tree-like data structure that graphically represents loop(s) and / or an if-condition(s) in a program, such as a structured control flow program. A loop splitting operation or a loop unrolling operation may then be performed in connection with the node of the loop tree that is identified as having the highest benefit (ratio of execution cycles gained to the increase in code size) representing an if-condition or a loop, respectively, provided that the resultant code fits in the instruction buffer.