Patent ID: 6263332
Filing Date: 2001-07-17
Classification: G06F,Y10S

Abstract:
A method of processing a query for a textual document in a tagged-based language comprising:providing an abstract machine for searching a tree representation of the document, wherein the abstract machine has an instruction set having an ability to produce at least a portion of results;obtaining a code for a particular node, wherein the code has been assigned by:determining a subtree depth for the particular node within the tree representation:determining a parent-child relationship for the particular node and for each node, if any, within the tree representation that lies between the particular node and a root node; anddetermining a code for the particular node, wherein:if the subtree depth of the particular node is less than two, the code for the particular node is a code for its closest parent node having a subtree depth of at least two; andif the subtree depth of the particular node is at least two, the code for the particular node is selected such that when bitwise binary ANDed with a code of a parent node yields the code of the parent node, wherein the codes for the particular node and the parent node are different from each other;using the code as part of a query;compiling the query in a language into instructions for the abstract engine;running the instructions on the abstract machine, wherein running is performed on the tree representation; andreceiving the at least a portion of results from the instructions that have been run.