Abstract: A remote backup storage system that may be tested with current backup data while the remote system continues to received data from a primary source data storage system includes a remotely located front-end volume that is connected to receive data from a source volume. A remotely located secondary volume normally receives data from the front-end volume. The secondary volume is the volume to which data of the source volume is backed up. The front-end volume serves as buffer for data transferred from the source volume to the secondary volume. A third volume that is used to preserve or restore the data in the secondary volume during a test.

Abstract: A data storage and retrieval device and method is disclosed. The device includes at least one magnetic storage medium configured to store target data and at least one re-configurable logic device comprising an FPGA coupled to the at least one magnetic storage medium and configured to read a continuous stream of target data therefrom, having been configured with a template or as otherwise desired to fit the type of search and data being searched. The reconfigurable logic device is configured to receive at least one search inquiry in the form of a data key and to determine a match between the data key and the target data as it is being read from the at least one magnetic storage medium. This device and method can perform a variety of searches on the target data including without limitation exact and approximate match searches, sequence match searches, image match searches and data reduction searches.

Abstract: Many discovery problems, e.g., subgroup or association rule discovery, can naturally be cast as n-best hypotheses problems where the goal is to find the n hypotheses from a given hypothesis space that score best according to a certain utility function. We present a sampling algorithm that solves this problem by issuing a small number of database queries while guaranteeing precise bounds on confidence and quality of solutions. Known sampling approaches have treated single hypothesis selection problems, assuming that the utility be the average (over the examples) of some function—which is not the case for many frequently used utility functions. We show that our algorithm works for all utilities that can be estimated with bounded error. We provide these error bounds and resulting worst-case sample bounds for some of the most frequently used utilities, and prove that there is no sampling algorithm for a popular class of utility functions that cannot be estimated with bounded error.

Abstract: A system and method for accessing a relational database and estimating the selectivity of a query (e.g., an SQL query) in order to better predict the number of qualifying records for simple and complex queries. A dataset is created based upon queries applied against the database by the user community. The dataset is populated with information related to query conditions and their respective combinations. A regression function reflecting correlations between query conditions is generated and used as a data mining model to calculate table-specific estimates for the cardinality of subsequent queries. An appropriate access method is then selected from a set of available access methods based upon the number of estimated query-qualifying records. By periodically updating the regression model with FIFO managed queries, a self-tuning mechanism is achieved resulting in better selectivity/result size estimates for use in selecting access methods used in compiling subsequent SQL queries applied against the database.

Abstract: A dynamic filtering module receives a request to perform an operation on data in the database and a input. The dynamic filtering module provides as an output a modified request to a data access system. The modified request can include one or more restrictions added to the original request pertaining to which data will be accessed as a function of the input.

Abstract: Performing a search for both local electronic content and remote electronic content based on a single query includes receiving a single query that includes at least one search term. The received search term typically is compared with indexed electronic content that is stored on a local device to derive a first result and with electronic content that is stored on a remote device to derive a second result. The comparison generally occurs automatically in response to the single query. The first result and the second result typically are combined into an amalgamated result that then is displayed.

Abstract: Plural versions of an authoring/editing tool for fluid text include both a WYSIWYG editor and a content-driven treetable editor for producing narratives and their behavioral control in a fluid text viewing system environment. The tool includes content-driven treetable visualization and layout mechanisms for authoring and/or editing hypertext narratives, electronic mail threads and other tree-oriented applications. Edit operations are disclosed that permit interactive development and modification of treetables.

Abstract: A computer-implemented method and system for processing a document such as a structured document in which information such as a term, name and belonging department is used as shared information and word consistency or modification can be automatically and easily reflected on all documents.

Abstract: The text format of input data is checked, and is converted into a system-manipulated format. It is further determined if the input data is in an HTML or e-mail format using tags, heading information, and the like. The converted data is divided into blocks in a simple manner such that elements in the blocks can be checked based on repetition of predetermined character patterns. Each block section is tagged with a tag indicating a block. The data divided into blocks is parsed based on tags, character patterns, etc., and is structured. A table in text is also parsed, and is segmented into cells. Finally, tree-structured data having a hierarchical structure is generated based on the sentence-structured data. A sentence-extraction template paired with the tree-structured data is used to extract sentences.

Abstract: Methods and systems consistent with the present invention allow a user to create a storage hierarchy definition in association with a workflow that models a process, to generate a plan from the workflow that reflects an instance of the process, and to generate a container in accordance with the storage hierarchy definition when the plan is generated from the workflow. The container may then be used to store an artifact that is used or produced by the plan in accordance with methods and systems of the present invention.

Abstract: A method and system for updating data for a set of objects in a database is provided. A request identifies a set of objects using a property of the objects and an operation to be performed thereon. The object request is translated to a relational request such that a column in a table corresponding to the property can be operated upon by a relational data store mechanism.

Abstract: A copying-type garbage collector operates in multiple concurrent threads. Each thread evacuates potentially reachable objects from the from space to the to space in a depth-first manner: if a thread has evacuated an object containing references to any from-space objects, it evacuates all of that object's descendants before it evacuates any other reachable objects. To keep track of descendants that must be evacuated before non-descendants can be, the thread places objects containing references to non-evacuated objects into a linked list maintained by pointers that it installs in the from-space locations from which the objects on the list were evacuated. Additionally, it divides the to space into local-allocation buffers (“LABs”) to which respective threads exclusively evacuate objects, and each thread maintains a LAB stack representing all the LABs it has filled that still contain references to unevacuated from-space objects.

Abstract: Auxiliary relations are used to maintain a materialized view. The materialized view comprises results of some operation performed between two or more base relations of a parallel database management system comprising a plurality of nodes. The two or more base relations are distributed to the nodes according to some partitioning strategy. Each auxiliary relation is partitioned according to the join attribute in the materialized view definition. During join or other operations involving the relations, the auxiliary relations, not the base relations, are used to construct join results and to maintain the materialized view.

Abstract: Techniques are provided for monitoring a database system. A set of data elements may be read from a database system into a device. The device may be external to the database system. From the device, a set of analysis operations are performed on the data elements in order to identify if any of the date elements satisfy a criteria for being considered potentially anomalous. A notification is signaled if potentially anomalous data is identified.

Abstract: Join expressions, expressed in terms of objects, are translated into a relational database join statement by generating a parse tree based on the join expression. The parse tree is traversed to build the relational database join statement.

Abstract: A method, apparatus, and computer instructions for processing a user input. A user input selecting an image on a page is detected. The image selected by the user input is sent to a server to perform a search in response to detecting the user input. The server performs object recognition analysis on the image to generate a text description of the image. Alternatively, the server may perform an image search for resources with similar images or properties. This text description, which may include one or more words, is used as the basis of the search. A result of the search is received in response to sending the image to the server to form a received result. The received result is displayed. Further, other contextual information associated with the image may be used in addition to or in place of the image in generating the search.

Abstract: A copying garbage collector evacuates to a to space the objects in a from space that are referred to by references, including references in previously evacuated objects, that are located outside the from space. It divides the to space into local-allocation buffers (“LABs”), and it adopts one of these as a destination LAB, i.e., as the LAB into which it places the objects that it evacuates. When a destination LAB becomes full, the thread adopts a new LAB as its destination LAB. When a destination LAB's contents fill it to some predetermined fill threshold, that destination LAB becomes the source LAB, i.e., the LAB that the collector scans for references to the collection-set objects. If a previous source LAB's contents has not yet been completely scanned when the collector thus adopts a new source LAB, the previous source LAB is placed on a LAB stack.

Abstract: A method and apparatus for testing data coherency in a file system implemented on a data processing arrangement. A record of file addresses is maintained for addresses that are not targeted by write operations, and word address ranges for write operations are selected from the record of file addresses not targeted by other write operations. A plurality of asynchronous write operations that specify word address ranges and data to be written are issued. For each completed write operation, an asynchronous read operation that references the address range of the completed write operation is issued. The data returned from the read operation is verified against data issued in the completed write operation. The record of file addresses not targeted by write operations is updated when the verifying step is complete.

Abstract: An aspect of the invention provides a method for managing information associated with a hierarchical key. A plurality of hash tables are created for a plurality of levels of a hierarchy associated with a hierarchical key, wherein each hash table is associated with a corresponding level of the hierarchy. Entries are stored within each of the plurality of hash tables, wherein the entries are associated with key names that have as many levels as the level associated with the respective hash table. Furthermore, a reference to a descendant entry that is in a respective hash table may be stored within each entry.

Abstract: An information service system, information service participation management apparatus, information service providing apparatus, and recording medium which are designed to collectively manage identification information once acquired by a participant by the information service participation management apparatus, to once permit the participant who newly requests participation in the information service by the identification information to participate provisionally with the participant's behavior being recorded for a certain period, to permit/reject official participation depending on the evaluation of the recorded result, to record a history that the participant to whom the identification information has been issued is permitted or rejected participate in which information service, to report the historical information in response to an inquiry from the information service providing apparatus, and further to record a history of the participant to whom the identification information has been issued that in which i