摘要:
An apparatus and method for simultaneously displaying both record names and the associated files responsive to a user's search over a database. A user conducts a routine search query over a database or group of databases of records containing, for example, text documents, or alphabetical concordances thereof. The search engine returns a list of records responsive to the user's query. In contrast to the standard list of record identifiers, the apparatus displays both the identifiers and selected portions of those records or other useful information, as defined by the user, facilitating quick review. The user is able to sort the list of these responsive records in a variety of ways, either before the search, or within the list of results, to expedite review. The apparatus identifies records that have been reviewed previously by marking them as “viewed” links. Finally, when reviewing any responsive record in full, the complete list of records is displayed in a side panel, in a way that still allows resorting by the user. This side panel display may be re-sorted “on the fly.” It also allows the user to see the identifiers of records anywhere in the list, and to easily jump, such as with a single mouse click, to any record in the list.
摘要:
To support IP routing table longest-prefix matching, a (ternary content-addressable) memory is managed by assigning its locations to interleaved pages and gaps. Each page has zero or more locations assigned to it, where all entries in a page have the same prefix length. Each gap has zero or more empty locations assigned to it. The pages are organized by descending prefix length. Associated with each page is a free-list identifying empty locations in that page. An “invariant” rule may dictate that first and last page locations cannot be empty. Whenever an entry is deleted from the first or last location in a page, that location is shifted (i.e., reassigned) to the adjacent gap. The direction chosen to search for an empty location for inserting a new entry is based on a global measure of the relative fullness of memory regions above and below the new entry's page.