Invention Grant
US07937399B2 Method, information processing apparatus, and program of searching for, aggregating and sorting trees 失效
方法,信息处理设备,搜索,聚合和分类树的程序

  • Patent Title: Method, information processing apparatus, and program of searching for, aggregating and sorting trees
  • Patent Title (中): 方法,信息处理设备,搜索,聚合和分类树的程序
  • Application No.: US11814705
    Application Date: 2006-01-23
  • Publication No.: US07937399B2
    Publication Date: 2011-05-03
  • Inventor: Shinji Furusho
  • Applicant: Shinji Furusho
  • Applicant Address: JP Kanagawa
  • Assignee: Turbo Data Laboratories, Inc.
  • Current Assignee: Turbo Data Laboratories, Inc.
  • Current Assignee Address: JP Kanagawa
  • Agency: Griffin & Szipl, P.C.
  • Priority: JP2005-016373 20050125
  • International Application: PCT/JP2006/300940 WO 20060123
  • International Announcement: WO2006/080268 WO 20060803
  • Main IPC: G06F17/30
  • IPC: G06F17/30 G06F7/00 G06F12/00
Method, information processing apparatus, and program of searching for, aggregating and sorting trees
Abstract:
A searching method for tree data structure topology employs an array generated as a search key array representing a tree serving as search key to represent a parent-child relationship between nodes. The array has the node identifier assigned to a parent node associated with a corresponding non-root node. Non-root nodes are nodes other than a root node, and the node identifier assigned to the parent node corresponds to the node identifier assigned to associated non-root nodes. An offset is applied to node identifiers in the search key array, the node identifiers to which offset is applied are compared with corresponding node identifiers contained in a portion in a C-P array, the portion determined according to the offset, and a vertex node list indicating a search result is stored, wherein the search result contains node identifiers included in a portion of the C-P array whose all nodes matched in comparison.
Information query
Patent Agency Ranking
0/0