Abstract: A multiple task wait system and associated method allow a client application to wait for multiple tasks to be successfully or conditionally implemented before running subsequent tasks. Two mechanisms can be used to accomplish this multiple wait process: The first mechanism uses a multi-wait grouping process that is visible to the client, and the second mechanism uses a graphical representation to identify the tasks to be completed. The multi-wait grouping process allows a client to group a related set of tasks together for both control and documentation purposes. The client can add as many tasks as the resources of the computer allow to a group while defining the data flows and control flows between the tasks in the group using various graphical tools. The multi-wait system allows the client to define the constraints and conditions for a set of tasks to be considered complete, and further allows the system to define the constraints and conditions for considering all the tasks within the group to be completed.

Abstract: A block map is associated with a multi-dimensionally clustered (MDC) base table in a database to maintain a “free” or “in use” status for each of the contiguous blocks in the table. Additionally, information may be stored in the block map to indicate whether, after loading data, a given block in the base table requires constraint checking operation or whether, based on changes to the block, a materialized query table dependent upon the table requires a refresh operation. Each time data is loaded into the table, the associated block map is updated. When delayed constraint check or refresh operations are to be performed, the block map is consulted to learn which blocks require the operations. After one of the constraint check or refresh operations is performed, the associated block map is again updated.

Abstract: An adaptive replacement cache policy dynamically maintains two lists of pages, a recency list and a frequency list, in addition to a cache directory. The policy keeps these two lists to roughly the same size, the cache size c. Together, the two lists remember twice the number of pages that would fit in the cache. At any time, the policy selects a variable number of the most recent pages to exclude from the two lists. The policy adaptively decides in response to an evolving workload how many top pages from each list to maintain in the cache at any given time. It achieves such online, on-the-fly adaptation by using a learning rule that allows the policy to track a workload quickly and effectively.

Abstract: A system, method, and computer program product are provided for automatically linking items with multiple attributes to multiple levels of folders within a content management system. The present system extends automatic linking to support multiple levels of folders and multiple attributes. One feature of the present system is to supplement the implementation of the automatic linking plan without user involvement so that the user is not required to know the rules for creating or nesting folders. A system defined attribute is used to indicate that the folder item was created by the present system. In addition, the present system automatically moves an item from one folder to another when the item is changed to a different type if the item was first added to the folder by the present system. When an item's attributes are changed or the item is redefined as a different type, the item is re-indexed.

Abstract: A multi-stable memory or data storage element is used in crosspoint data-storage arrays, as a switch, a memory device, or as a logical device. The general structure of the multi-stable element comprises a layered, composite medium that both transports and stores charge disposed between two electrodes. Dispersed within the composite medium are discrete charge storage particles that trap and store charge. The multi-stable element achieves an exemplary bi-stable characteristic, providing a switchable device that has two or more stable states reliably created by the application of a voltage to the device. The voltages applied to achieve the “on” state, the “off” state, any intermediate state, and to read the state of the multi-stable element are all of the same polarity.

Abstract: A computer program product is provided that uses data examples as a basis for understanding and refining declarative schema mappings. The system of the present invention identifies a set of intuitive operators for manipulating examples including establishing value correspondences, data linking, data trimming, data walking, and data chasing. These operators allow a user to follow and refine an example by walking through a data source. In addition, these operators can identify a large class of schema mappings and distinguish effectively between alternative schema mappings. With these operators, a user is able to quickly and intuitively build and refine complex data transformation queries that map one data source into another while continuously verifying that the mapping is accurate and appropriate.

Abstract: A document image management system and associated method for integrating the operations of various independent software applications and the reuse of data entries within an enterprise, to increase productivity and promote a flexible method for the visualization of complete and coordinated information contained on a plurality of form pages. To this end, the system and method use an electronic checklist that enables the automated population of data fields in the checklist, and the reuse of the collected data in other applications. The system further includes additional tools that use the knowledge information to enable an efficient use of the knowledge within an enterprise, including the ability to develop a context for, and visualization of such knowledge.

Abstract: An error correction algebraic decoder and an associated method correct a combination of a B-byte burst of errors and t-byte random errors in a failed sector, by iteratively adding and removing an erasure (N?B) times until the entire failed sector has been scanned, provided the following inequality is satisfied: (B+2t)?(R?1), where N denotes the number of bytes, B denotes the length of the burst of errors, t denotes the total number of random errors, and R denotes the number of check bytes in the failed sector. This results in a corrected sector at a decoding latency that is a generally linear function of the number of the check bytes R, as follows: Decoding Latency=5R(N?B).

Abstract: A system and associated method write data from an in-memory database to a disk database in an efficient manner and with a relatively short lag time. The integration of data from in-memory to disk is achieved by limiting the operations of the in-memory database to insert only. The system shortens lag time by reducing the number of transactions required to transfer data from in-memory database to disk memory. The system compiles into an RDBMS, knowledge about the structure of the in-memory database, and then uses the end of the transaction callbacks from the RDBMS to keep the in-memory database and the disk memory in synch. The RDBMS includes a daemon that runs periodically to find records in the in-memory database that have not yet been written to the RDBMS, and then writes the found records to the RDBMS as part of a single transaction. If the transaction completes successfully, the in-memory database is updated to reflect which records have been “flushed” to the RDBMS.

Abstract: A system and method execute search and retrieval techniques relative to previously stored documents. The present method conducts a first search based on key words or phrases, receives the selection of a given document relative to a result of the first search, and then conducts a second search based on the selected given document. If in the second search the given document was extracted in a previous retrieval process made by a user, a document having a history of being selected concurrently with the given document is extracted. Any document concurrently selected by the user with respect to the document extracted in the second search is automatically stored and noted as being associated with the search request.

Abstract: An information retrieval system is adapted to process a query having an associated plan that includes applying predicates comprising local predicates and a join predicate, to at least two tables. Index ANDing is used to construct a filter for filtering a first of the tables in accordance with the local predicates. The join predicate is applied to the tables for determining row identifiers of rows satisfying the join predicate. The row identifiers are used to probe the filter for determining whether the rows satisfying the join predicate also satisfy the local predicates. The rows that satisfy both the join and local predicates are fetched and the join predicate is completed. Results of the join predicate are then returned.

Abstract: A magnetic data track used in a magnetic shift register memory system may be fabricated by forming a multilayered stack of alternating dielectric and/or silicon layers. Vias of approximately 10 microns tall with a cross-section on the order of 100 nm×100 nm are etched in this multilayered stack of alternating layers. Vias may be etched form smooth or notched walls. Vias are filled by electroplating layers of alternating types of ferromagnetic or ferrimagnetic metals. The alternating ferromagnetic or ferrimagnetic layers are comprised of magnetic materials with different magnetization or magnetic exchange or magnetic anisotropies. These different magnetic characteristics allow the pinning of magnetic domain walls at the boundaries between these layers. Alternatively, vias are filled with a homogeneous ferromagnetic material. Magnetic domain walls are formed by the discontinuity in the ferromagnetic or ferromagnetic material that occurs at the notches or at the protuberances along the via walls.

Abstract: A system, method, and computer program product for collecting sets of related data with minimal redundancy, at a mainframe, and for transferring the collected data to a local workstation for processing. The mainframe remotely executes a utility application to construct an object model describing a desired structure of database elements. The object model is encoded into a single descriptive stream, such as XML, and converted to a metadata class for subsequent transfer to the local workstation. At the local workstation, the metadata class is decoded into a reconstructed object model for further processing.

Abstract: In a database system that supports object name overloading, database query statements are compiled and cached as data structures so that object level privileges are correctly resolved. Database query statements stored in the cached data structures are utilized when appropriate and a new compilation is performed when an incorrect resolution would result. The data structures are stored in a predefined order to ensure that a deterministic search of the cache is efficiently performed.

Abstract: A linking system and associated method are used to link two or more large dissimilar databases. The linking system generally includes a software program installed on a server with access to databases such as customer databases and organization databases. The linking system includes pointers, as needed, to link customers with positions, jobs, groups or other organizational entities. These pointers allow for a reduced maintenance of the underlying data, while the number of pointers used is relatively small. In addition, the set of information for each pointer can be modified without changing the structure or information of the linked databases.

Abstract: A computer program product is provided as a business rating system to rank business that are relevant to a given Internet search topic. Business ratings are stored in a ranking repository that can be optionally searched by the user along with a user-defined search engine query. The business ratings are compiled from off-line surveys provided for example by independent agencies and/or other off-line surveys obtained through web based rating services. The business ratings can optionally be compiled from on-line questionnaires attached to the search engine results. The business ratings assess the quality of the businesses in terms of “interactive” criteria such as customer satisfaction, professionalism, and cost and ease of use of the businesses' products or services. The business rating system is comprised of an indexing engine, a query transformer, a search results transformer, a ranking based result sorter, an off-line ranking system, a metadata repository, and a ranking repository.

Abstract: A system and an associated method selectively process log files for enhancing performance of tablespace recovery by processing only those log files required, and for selecting which log file to process during recovery for both redo and rollback phases of recovery. The system and method skip the processing of log files that do not contain records of interest for the tablespace being recovered and determines whether a log file contains anything that needs to be played, in particular for the recovery of a subsystem in the database, such as a tablespace. Pre processing of the log files is not done, rather including tablespace ID correlated with log file ID information is collected while the log files are created. The cross-correlated information is used during tablespace recovery to selectively determine which of the log files to process. Some log files may be skipped in cases where not all of the database system is being recovered.

Abstract: The use of a centralized version table allows for efficient object switching. Rather than synchronizing all database agents to recognize a newly created file as containing the most recent version of a given object, database agents requiring access to the given object need only consult the centralized version table to learn file identity information. That is, the database agents consult the centralized version table to determine which of the files associated with a given object contain the most recent version of the given object. Mechanisms associated with the use of the centralized version table also provide for efficient recovery from a failure that has occurred during an object switching transaction.

Abstract: A content management system provides versioning capability that can either be controlled by the client application or be transparent thereto. Control of document versions depends on the root and child component attributes that are defined by the hierarchical structure of the document. When a document is updated, the present system performs any or all of the following scenarios as desired by the user: replace the existing attribute values stored in the root component instance for a specified document; replace the existing attribute values stored in a specified child component instance for the specified document; add a new child component instance into the hierarchical structure for the specified document; or delete an existing child component instance from the hierarchical structure for the specified document.

Abstract: A computer program product is provided as a system for use with the Internet to determine the physical location of IP addresses. The system of the invention includes a locator broker and various databases. The locator broker is the intermediary between the locator sources that estimate the physical location of an IP address and the online sites requesting the physical location of the IP address. The locator broker aggregates and validates the results from its location queries of the locator sources then returns to the online site the most likely location for a given IP address. The locator broker also tracks the reliability of each locator source and thus targets its location queries to those services most likely to provide an accurate result. The locator broker digests location data from multiple geolocation services and presents a coherent view of the location data to the online site.