Tree search, totalizing, sort method, information processing...

Details Tree search, totalizing, sort method, information processing... Tree search, totalizing, sort method, information processing...

G - Physics

06

F

G06F 17/30 (2006.01)

Patent

CA 2593118

In a tree-type data structure capable of effectively tracing the relationship between data of the tree-type data structure, it is possible to search, totalize, and sort a tree effectively and rapidly. In a method for searching topology of the tree type data structure, as a search key arrangement expressing the tree as a search key, it is necessary to generate in a memory, an arrangement having a node identifier of a parent node associated with each of non-route nodes corresponding to node identifiers assigned to non-route nodes, i.e., nodes other than route nodes for expressing the parent-child relationship. An offset is given to the node identifier in the search key arrangement. The node identifier to which the offset is given is compared to a corresponding node identifier contained in a part of the C-P arrangement based on the offset so as to generate an apex node list indicating the search result and containing a node identifier of the part of the C-P arrangement where all have coincided, in a storage device.

Dans une structure de données sous forme arborescente capable de tracer efficacement la relation entre des données sous forme arborescente, il est possible de chercher, totaliser et classer un arbre de façon efficace et rapide. Dans un procédé permettant de chercher la topologie d~une structure de données sous forme arborescente, une disposition de clé de recherche exprimant l~arbre comme clé de recherche, il est nécessaire de générer dans une mémoire une disposition qui associe un identificateur nodulaire d~un nAEud parent à chacun des nAEuds non-route correspondant aux identificateurs nodulaires affectés aux nAEuds non-route, c~est-à-dire des nAEuds autres que les nAEuds de route permettant d~exprimer la relation parent-enfant. Un décalage est donné à l~identificateur nodulaire dans le dispositif de clé de recherche. L~identificateur nodulaire auquel le décalage est donné est comparé à un identificateur nodulaire correspondant contenu dans une partie de la disposition C-P sur la base du décalage de manière à générer dans un dispositif de stockage une liste de nAEuds apicaux indiquant le résultat de recherche et contenant un identificateur nodulaire de la partie de la disposition C-P où tout a coïncidé.

Affiliated with

Also associated with

Rating

Tree search, totalizing, sort method, information processing... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Tree search, totalizing, sort method, information processing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree search, totalizing, sort method, information processing... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1916774