97 results about "Node splitting" patented technology

A data structure, added to a modified form of the B^link-tree data structure, tracks delete states for nodes. The index delete state (D_X) indicates whether it is safe to directly access an index node without re-traversing the B-tree. The D_X state is maintained globally, outside of the tree structure. The data delete state (D_D) indicates whether it is safe to post an index term for a new leaf node. A D_D state is maintained in each level 1 node for its leaf nodes. Delete states indicate whether a specific node has not been deleted, or whether it may have been deleted. Delete states are used to remove the necessity for atomic node splits and chains of latches for deletes, while not requiring retraversal. This property of not requiring a retraversal is exploited to simplify the tree modification operations.

The invention discloses a method of sending a data package and incidentally sending a reverse interest package in content center network. The method includes the following steps : step 1, sending the interest package to the network to by a user A show that the user A is interested in the content; step 2, an intermediate node dealing with a request when the intermediate node in the network receives the interest package; step 3, combining a response data package and the interest package which needs to be requested by the user A to form a mixed data package by a user B when the user B wants to send a data request to the user A; step 4, the intermediate node splitting the mixed data package into a data package and a reverse interest package when the intermediate node in the network receives the mixed data package and respectively dealing with the data package and the reverse interest package; step 5, splitting the mixed data package by the user A when the user A receives the mixed data package, receiving the data package and delivering the data package to primary requested program, and meanwhile responding to the interest package by the user A and producing a corresponding data package. The method of sending the data package and incidentally sending the reverse interest package in content center network reduces transmission times of the package and improves information quantity and efficiency in once transmission.

Methods of updating b-tree data structures (e.g., b*tree data structure) using search key insertion and deletion operations proceed from respective known states (e.g., respective canonical forms). These insertion operations include inserting a first search key into the b-tree by reconfiguring (e.g., pre-processing) a plurality of sibling nodes of the b-tree into a predetermined overloaded form having a shape that is independent of a value of the first search key to be inserted therein. An operation is then performed to split the sibling nodes by redistributing the first and other search keys among an expanded plurality of the sibling nodes. These insertion operations use a process that trades off possibly performing additional memory accesses (e.g., to shift search keys (and/or handles or pointers) to the predetermined overloaded form) for the certainty that the same key movements are ultimately performed during operations to split sibling nodes.

A system and method for spectral node splitting in cable TV network based on hybrid fiber-coax architecture is disclosed. Two-way optical signals carrying video and/or multimedia content are received at a signal distribution node. Portions of the received signals are processed according to the functionality the direction thereof. Certain frequency ranges are passed intact while specific different downstream and specific different upstream frequency bands are converted in a manner as to be allowed to be multiplexed into an extended broadband signal. The frequency bands within the extended broadband signal are distributed selectively among separate branches of the network. The frequency bands dedicated to the upstream traffic are received selectively from the separate network branches to be back converted and transmitted upstream to the network controller.

A region of a node is searched to find a content-defined split point. A split point of a node is determined based at least in part on hashes of entries in the node and the node is split based on the determined split point. The search region is searched for the first encountered split point and the node is split based on that split point. That split point is based on a predetermined bitmask of the hashes of the entries in the node satisfying a predetermined condition.

The invention discloses a router calculation method and a router calculation device. The router calculation method comprises the following steps of: dividing each network element node in an optical transmission network (OTN) into a plurality of network element sub nodes; configuring sub node links for the plurality of network element sub nodes, and establishing topological expansion information of the network element sub nodes according to the sub node links; and utilizing a constraint shortest path first (CSPF) algorithm to carry out router calculation on the network element sub nodes according to the topological expansion information. With the adoption of the router calculation method and device provided by the invention, resources of DXC (Data Exchange Control), OEP (Original Entry Point) and the like can be saved; the effective use ratio of an OXC (Optical Cross Connection) resource is improved; and the service consumption is reduced.

The invention discloses an electromechanical system logical relationship generation method and device and a building information model. The method includes: a conversion step, namely converting a physical relationship between pipeline components and electromechanical devices in a to-be-processed building information model into a corresponding topological relationship; a separation step, namely separating electromechanical device representing device nodes and pipeline component representing pipeline nodes in the topological relationship to obtain more than one subgraph acquired based on pipeline node splitting, wherein each subgraph represents pipeline groups in connection with one electromechanical device; a logic establishment step, namely establishing a logic connection relationship of different electromechanical devices according to an association relationship of different electromechanical devices connected to a same pipeline group. By adoption of the scheme, the logic connection relationship can be generated according to physical connection information, and accordingly fault positioning efficiency of the building information model in an operation and maintenance operation is improved.

The invention provides an establishing method of a product STL model spatial index structure, which is characterized in that a product STL model data file is read first, an axial bounding box of each triangular facet is established, corresponding data node of the triangular facet is established according to the center of the axial bounding box and the radius of a circumsphere and stored in a data node sequence, each data node in the sequence is inserted in the index structure through steps such as insertion position selection, node splitting, node axial bounding box adjustment and the like, and the data node with larger volume of the axial bounding box is reinserted in the index structure to further optimize the index structure and achieve the establishment of the product STL model spatial index structure. The establishing method can establish spatial index structures of various triangular grids with complex profiles, and has the characteristics of strong stability and high query efficiency.

The invention provides a rock bust danger level prediction method based on a local weighting C4.5 algorithm and relates to the technical field of rock burst prediction. The method includes the steps of firstly, adopting an MDLP method for conducting discretization on continuous attribute data in sample data, then adopting a local weighting method for selecting a training set and calculating the weight of samples, utilizing the weight of the samples to calculate an information gain ratio of each attribute, and selecting sample attributes as root nodes of a C4.5 decision tree and splitting attributes of other branch nodes according to the information gain ratios; finally, adopting the weight of the samples to substitute the sample number to conduct pessimistic pruning on the created decisiontree, and correspondingly achieving prediction of rock burst dangers and the like in a predicted area. According to the provided rock bust danger level prediction method based on the local weightingC4.5 algorithm, the defect is overcome that the preference selection values have too many attributes when information gain is adopted for selecting node splitting attributes in an ID3 algorithm; an over-fitting problem is avoided, and the prediction accuracy of a model is high.

The invention discloses a fast indexing method and system based on a position top-k keyword in a sliding window. The method comprises creating a data indexing model and performing query; the data indexing model is created as follows: determining a geographical range covered by a quadtree and a node splitting rule; accepting a data stream, and inserting data in a node; splitting the node satisfyinga splitting rule, and inserting the data in the nodes to generate a complete quadtree; storing reverse indexes by leaf nodes; and storing MG polymerization abstracts of sub nodes thereof by non leafnodes; and adjusting the structure of the quadtree; the query comprises: initializing a result set; performing a pruning operation to obtain a candidate result set; and selecting a word with the maximum value in a priority queue, starting to calculate, starting to traverse from the root node until an accurate score of the root node is found on the leaf nodes, putting the accurate score in the queue, and repeating the operation until the previous k words of the priority queue are invariable. By adoption of the fast indexing method and system, the cost can be effectively reduced, the query speedis improved, the search space can be effectively trimmed according to the word frequency and the location proximity, and the geographic text data stream with high arrival rate can be processed.

The invention discloses a modelling method and system based on position top-k keyword query under a sliding window. The method comprises the following steps that 1, a geographical range covered by a quadtree and a node-splitting rule are determined; 2, a data flow is received, and data is inserted into nodes; 3, nodes which conform to the node-slitting rule in step 1 are split, and the intact quadtree is generated constantly by data inserting; 4, the word frequency of each leaf node is counted, and an reverse index of each leaf node is stored; 5, MG aggregated abstract information of each child node of each nonleaf node is stored; 6, the size of the sliding window needs to be maintained in the data inserting processes in step 4 and 5, a data item provided with the oldest timestamp is deleted, the newest data is added, and the index structure of the quadtree is adjusted. By means of the method, the cost is effectively reduced, the query speed is effectively improved, and geographical text data flows with high arrival rates can be processed.

The invention discloses a relay multi-path flow distribution method for minimizing transmission delay. The traditional traffic assignment method directly distributes the end-to-end traffic to the network sub-stream, which causes the performance degradation of transmission delay. The method of the invention splits paths according to a sink node under the condition that paths are not independent, and performs relay multi-path flow distribution. The method firstly collects information, splits the paths, and then carries out network path modeling, quality evaluation and transmission traffic assignment, calculates the queue delay of the paths, solves the traffic assignment with the minimum delay, couples the traffic assignment results, and minimizes the average transmission delay of the data packets arriving at the destination node. From the viewpoint of improving the performance of the live broadcast time delay, the method of the invention considers the situation that a sink node exists inthe multipath transmission, monitors the link information in real time, carries out the relay multipath flow distribution to obtain the minimum transmission time delay, and avoids the transmission performance degradation caused by the competition of the sub-streams for the shared link resources in the traditional flow distribution method.

The invention discloses an efficient mass data indexing method in cloud computing. According to the method, the node splitting history is recorded by use of a log on the basis of a distributed B-tree and the distributed B-tree is efficiently and simultaneously accessed based on the node splitting history, and therefore, the accessing and indexing efficiency of mass distributed data in the cloud computing environment can be effectively improved. The efficient mass data indexing method in the cloud computing is superior to an affair method because distributed locks need to be added to all nodes in the path from the root to a leaf node to be accessed in the affair method, and the efficient mass data indexing method only needs to lock the leaf node to be accessed; the efficient mass data indexing method is superior to a link method because the number of nodes to be traversed in the efficient mass data indexing method is smaller than that of the link method.

The invention discloses a power supply service satisfaction influence factor identification method based on a decision tree algorithm, and the method comprises the steps: importing a needed function library, constructing a decision tree through a USDUW function, and marking the algorithm as a decision point; when a decision tree is constructed, selecting a certain characteristic value as a node ofthe tree according to a given sample data set, and calculating the information entropy in the data in the data set; determining the number of decision points of the decision tree, and marking the probability and the profit and loss value of the decision points on a probability branch; and when the decision tree selects the decision features, selecting the feature with the maximum Gini exponentialgain value as the node splitting condition. The method is clear in organization, rigorous in program, quantitative and qualitative in analysis, the satisfaction degree of the power customer is analyzed by utilizing a fuzzy decision tree analysis method, and the satisfaction degree of the power customer to the power service under which conditions can be clearly known by establishing a rule, so that conditions are provided for improving the service and improving the satisfaction degree of the power customer in the future.

The invention provides a self-adaptive structure adjustment method and system for a machine learning data index structure. The method comprises the following steps: a node selection step: selecting nodes in the machine learning data index structure one by one according to a preset node number sequence; a node analysis step: analyzing the selected nodes, and executing corresponding structure adjustment operation according to the cache data volume in the nodes and the error range size: if the cache data volume in the nodes or the prediction error of the machine learning model in the nodes is toolarge, executing a node splitting step; if the cache data volume and the error range in the node and the adjacent node are both too small, the two nodes execute a node merging step; otherwise, endingthe process. According to the fine-grained machine learning index structure adjustment method provided by the invention, compared with retraining of all data, the number of retrained models can be reduced, and the influence on performance of irrelevant models and cache during structure adjustment is avoided.