Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
TREE SEARCH, TOTALIZING, SORT METHOD, INFORMATION PROCESSING DEVICE, AND TREE SEARCH, TOTALIZING, AND SORT PROGRAM
Document Type and Number:
WIPO Patent Application WO/2006/080268
Kind Code:
A1
Abstract:
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.

Inventors:
FURUSHO SHINJI (JP)
Application Number:
PCT/JP2006/300940
Publication Date:
August 03, 2006
Filing Date:
January 23, 2006
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
TURBO DATA LAB INC (JP)
FURUSHO SHINJI (JP)
International Classes:
G06F17/30
Foreign References:
JPS648448A1989-01-12
JPH02148173A1990-06-07
JPH10240741A1998-09-11
JP2000348038A2000-12-15
Attorney, Agent or Firm:
YOSHIDA, Satoshi (Kamiooka-higashi Konan-ku, Yokohama-sh, Kanagawa 01, JP)
Download PDF: