Abstract: A method of performing a search of a numerical DOM (document object model), includes the steps of receiving a query. When the query is a fully qualified query, the target string is transformed to form a fully qualified hashing code. An associative lookup is performed in a map index using the fully qualified hashing code. A map offset is returned. The map offset points to a couplet that can be converted into a standard portion of a structured data document. Finally, a data couplet is returned.
Type:
Grant
Filed:
January 23, 2001
Date of Patent:
September 20, 2005
Assignee:
Xpriori, LLC
Inventors:
Christopher Lockton Brandin, Kevin Lawrence Huck, Linda Lee Grimaldi
Abstract: A system (10) for generating a transform includes a first transform lookup table (12) and second transform lookup table (28). A transform exclusive OR array (26) is connected to an output (24) of the first transform lookup table (12) and an output (32) of the second transform lookup table (28). The system (10) allows transforms (polynomial codes, CRCs) to be generated using two or more tables.
Type:
Grant
Filed:
October 12, 2001
Date of Patent:
August 23, 2005
Assignee:
Xpriori, LLC
Inventors:
Harry George Direen, Jr., Christopher Lockton Brandin
Abstract: A method of flattening a structured data document includes the steps of receiving a structured data document. Next, a first data entry is searched for by the system. When the first data entry is found, it is determining if an attribute is defined before the first data entry. When the attribute is defined before the first data entry, a first line containing all open tags before the attribute and the attribute is created. A record indicator is stored on the first line.
© 2024 Justia
