The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Mar. 18, 2008
Filed:
Nov. 16, 2004
Yao-ching Stephen Chen, Saratoga, CA (US);
Irene Ching-hua Liu, San Jose, CA (US);
Demai NI, Davis, CA (US);
Guogen Zhang, San Jose, CA (US);
Qinghua Zou, Los Angeles, CA (US);
Yao-Ching Stephen Chen, Saratoga, CA (US);
Irene Ching-Hua Liu, San Jose, CA (US);
Demai Ni, Davis, CA (US);
Guogen Zhang, San Jose, CA (US);
Qinghua Zou, Los Angeles, CA (US);
International Business Machines Corporation, Armonk, NY (US);
Abstract
A method generates hierarchical path index keys for single and multiple indexes with one scan of a document. Each data node of the document is scanned and matches to query nodes are identified. A data node matches a query node if the three conditions hold: if it is not the root step, there is a match for the query node in the previous step of the query; the data node matches the query node of the current step; and the edges of the data and query nodes match. A sub-tree of a data node can be skipped if the data node is not matched and its level is less than the fixed levels of the query. The matched data node is then placed in the match stacks corresponding to the match query nodes. The method uses transitivity properties among matching units to reduce the number of states that need to be tracked and to improve the evaluation of path expressions significantly.