|TARARI, INC. Patent applications|
|Patent application number||Title||Published|
|20100231975||SYSTEM AND METHOD OF HARDWARE-ASSISTED ASSEMBLY OF DOCUMENTS - Embodiments include systems and methods of hardware-assisted assembly of documents. For example, one embodiment comprises a memory configured to store documents and at least one processor configured to identify a template for generating a document. The template defines at least one field having a specified position and length within the document. The processor is further configured to store a copy of the template to the memory so as to initialize the document and to store characters based on data associated with the field to a location of the memory associated with the field. The processor further stores, based at least in part on the text and the length of the field, one or more indicators of at least one portion of the field to be removed from the document. The system further includes a circuit configured to read the document from the memory and remove the portion of the field based on the indicators. The system thus assembles an assembled document that is reduced in size relative to the initially generated template document.||09-16-2010|
|20090177960||SYSTEM AND METHOD OF XML QUERY PROCESSING - A method of processing queries, e.g., XPath expressions, related to an XML document includes generating a plurality of tokens based on the contents of the XML document. At least one query expression is compiled to a first plurality of query nodes defining a tree. A plurality of lookup tables may be configured to relate each of the first plurality of query nodes by a symbol. Each token is processed by looking up the query nodes indexed by a symbol matching the token in one of the plurality of lookup tables, marking each of the related query nodes, and indicating a match if each of the first plurality of query nodes of the at least one query expression is marked. A system for performing the method includes a tokenizer, an expression compiler, and an engine module.||07-09-2009|
|20090172001||SYSTEMS AND METHODS FOR PROCESSING REGULAR EXPRESSIONS - A method for reducing the size of a DFA associated with a regular expression separates the functions of locating subexpressions within the DFA and determining if the located subexpressions satisfy a regular expression. For example, the functions of (1) locating subexpressions in a range asserting expression and, (2) determining whether the subexpressions satisfy the range of the range asserting expression are partitioned. In one embodiment, a first component may locate the subexpressions in a data stream using one or more DFAs, while a second component determines if the located subexpressions satisfy the range. In this embodiment, because the DFAs are not configured to determine a relationship between subexpressions, such as a range between subexpressions, the size of the resultant DFA may be significantly reduced.||07-02-2009|
|20080270342||HARDWARE PROCESSING OF REGULAR EXPRESSIONS - A system and method for hardware processing of regular expressions is disclosed. A register bank is loaded with state information associated with one or more states of a state machine. State information such as transitions and spin counts are updated as characters of an input data stream are processed. A crossbar is used to interconnect the states stored in the register bank.||10-30-2008|
Patent applications by TARARI, INC.