×

Enumeration of rooted partial subtrees

  • US 8,316,059 B1
  • Filed: 12/27/2005
  • Issued: 11/20/2012
  • Est. Priority Date: 12/30/2004
  • Status: Active Grant
First Claim
Patent Images

1. A method comprising:

  • executing instructions by a processor to;

    exhaustively enumerate possible component rooted partial subtrees of a tree to model logical branches of a query, said component rooted partial subtrees defining respective connectable paths between a root node of the tree and nodes in respective component rooted partial subtrees along one or more edges in the tree; and

    determine one or more electrical digital signals representing natural numerals associated with particular ones of said enumerated component rooted partial subtrees, said natural numerals being based, at least in part, on an association between trees and natural numerals;

    further comprising executing said instructions by said processor to exhaustively enumerate said possible component rooted partial subtrees of said tree by;

    identifying one more subtrees coupled to a root node of said tree; and

    exhaustively enumerating possible component rooted partial subtrees of the identified subtrees;

    wherein said tree is represented as one or more electrical digital signals representing a composite natural numeral based, at least in part, on said association, and wherein the method further comprises executing said instructions by said processor to identify said one or more subtrees by factoring said composite natural numeral into one or more electrical digital signals representing natural numerals representative of subtrees;

    wherein said tree comprises an edge or node labeled tree, and wherein the labels comprise discrete values.

View all claims
  • 4 Assignments
Timeline View
Assignment View
    ×
    ×