Abstract: A system and method for facilitating real-time end-user awareness in results to a query to optimize and refine a computerized search utilizing an interactive result layer (IRL) and result operational layer (ROL) are disclosed. The present invention establishes a loopback feedback between encapsulated end-user interactions, which are facilitated through an interactive result layer (IRL), and the results from a query, passed through a result operational layer (ROL). An end-user selects interactions to particular results by way of a prompt within the IRL. The end-user interactions are provided to and processed in the ROL in real-time without the end-user having to re-query the system to reflect said interaction or combination of interactions. A real-time automatic result feeder aides in delivering new results to end-user when results are deleted. Subsequent queries can reflect past end-user interactions.

Abstract: A search engine for selectively perform iterative compare operations between a searchable pattern and S overlapping substrings of an input string of characters includes a memory for storing a bitmap having S next success size (NSS) bits, wherein each NSS bit indicates whether an associated substring including a corresponding unique number of the input characters is to be compared with the searchable pattern in successive compare operations, and includes a compare circuit for selectively performing the successive compare operations in response to the NSS bits.

Abstract: A method, computer program, and database system are disclosed for executing database queries. The database includes a first table (T1) having a primary key (PK) column and a first correlated value column (CV1) and a second table (T2) having a foreign key (FK) column related to the primary key column of the first table and a second correlated value column (CV2). One implementation of the method includes preparing a database query for execution based at least in part on application of a derived constraint rule (DCR) having the form, (PK=FK)?CV2+C1?CV1?CV2+C2, where C1 and C2 are constants and “?” means “implies,” to produce an execution plan. A frequency of errors due to changes in DCRs is taken into account when preparing the execution plan. The plan is then executed.

Abstract: A search tree embodying a plurality of signatures to be compared with an input string of characters and including a number of success transitions characterized by a success size parameter and including a number of failure transitions characterized by a failure size parameter is selectively modified to achieve a desired balance between processing speed and memory area requirements.