Abstract: A presentation application and database development and management controller, collectively, produce an individual or group-specific, customized interface to a shared database. The presentation application can be template or script driven, and interacts with each client to provide a customized display. In an embodiment, the presentation application communicates with a network server to distribute data to clients over a computer network, such as the global Internet. The database development and management controller interacts with the database and manages the customization and distribution of data to the presentation application. A collection of service objects are built to represent the information stored in the database. A plurality of presentation objects are also provided as abstract representations used to organize and customize the display of the information. As such, one or more service objects are mapped to each presentation object.

Abstract: Systems, methods and computer program products for distributed content storage and management are provided. The distributed content storage and management system includes an indexed archive system; information source agents, information source clients; and a network to couple the information source clients to the indexed archive system. In an alternate embodiment, a legacy back-up system is also used. The index archive system includes an information entryway for gathering file information, a triage engine, an indexing engine, a metadata engine, and a content engine. These engines generate content indexes, metadata and metadata indexes from received files and store them along with the file content into a set of repositories, including an indexing repository, a metadata repository and a content repository. Methods are provided for the efficient retrieval and indexing of files, and for the storage of files, file content, content indexes, metadata and metadata indexes.

Abstract: Given an input sequence of data, a rigid pattern is a repeating sequence, possibly interspersed with don't-care characters. The data can be a sequence of characters or sets of characters or even real values. In practice, the patterns or motifs of interest are the ones that also allow a variable number of gaps (or don't-care characters): these are patterns with spacers termed extensible patterns. In a bioinformatics context, similar patterns have also been called flexible patterns or motifs. A system according to the invention discovers all the maximal extensible motifs in the input. The flexibility is succinctly defined by a single integer parameter D?1 which is interpreted as the allowable space to be between 1 and D characters between two successive solid characters in a reported motif.

Abstract: A method and system for member initialization to and deactivation from an asynchronous data replication group in a database system is disclosed. The method and system allows new members to be added to the replication group or existing members to be removed from the replication group, without requiring the halting of the asynchronous replication of data. The performance advantages of asynchronous replication are still realized during member initialization or deactivation.

Abstract: A method and system for asynchronously replicating data changes in a database system captures update information for a data update in a source table from a database log, where the data value from the data update is not in the database log. A query is built to obtain the data value from the source table using the update information, including a key column value that identifies the row of the source table in which the data resides. When the key column is also updated in the same or different transaction, the data update information is stored, and the updated key column value is replaced with a later captured key column update value. The query is built and executed, and the data update is replicated at a target table. In this manner, data objects whose values are not recorded in a database log can be asynchronously replicated in a database system.

Abstract: An information management system to simplify the calculation of risk values and information asset risk management, based on both information on asset values and access to information. The information management system is composed of a storage device to store information containing asset values, a file access information report section for monitoring access to information stored in that storage device, a file attribute information management section to manage information on file attributes stored in that storage device, a risk value processor to calculate risk values of the applicable information based on attribute information managed by said file attribute information management section and based on monitoring results from the file access information report section, and a corrective action initiator to take measures to correct leaks of applicable information based on results calculated by the risk value processor.

Abstract: Validation of large numbers of alternative execution plans for a database query, either an exhaustive enumeration of the complete space of alternatives, or else an unbiased random sample, is performed by efficiently constructing execution trees from a data structure having groups alternative operators that are ranked in a directory. Each global rank of a plan identifies that plan uniquely among all the alternative plans. The operators are unranked from the directory according to a specification that characterizes the desired plans.

Abstract: A method and system is provided for exchanging information over a computer network. A network server computer system receives a query request from at least one client computer system over a computer network. The query request is formatted into an extensible markup language query document according to an extensible markup language document application program interface. The extensible markup language query document is transmitted to at least one business intelligence server computer system. The at least one business intelligence server computer system retrieves the information requested in the extensible markup language query document from at least one data storage device.

Abstract: Method and server system for providing communication between a first user and at least one further user comprising the steps of sending a page comprising information to a first client computer for presentation to the first user, receiving a selection from the page from the first client computer, and sending information associated with the selection to at least one further client computer for presentation to a further user. In a further embodiment the method comprises the further steps of: sending a further page comprising further information associated with the selection to the at least one further client computer for presentation to the user, receiving a further selection from the further page, and sending information associated with the further selection to the first client computer for presentation to the first user.

Abstract: A method (and structure) of querying one or more Web-based data sources, includes receiving a query statement including at least one query, parsing the input query to identify a target data source for each query, and dispatching each query to a respective one of the data sources for a target data source search. The query statement further includes an aggregate operator defining at least one logical operation to be performed on a result returned from the target data source searches.

Abstract: The invention relates among other things to a method for operating a secondary computer (22), in which a memory unit in an originating computer (12) initially stores a first data volume (112) and a second data volume (114). During transmission of copies of the data volumes (112, 114), change reports (150, 154) are processed in the originating computer (12) and in a secondary computer (22) irrespective of whether the associated data volume has already been transmitted.

Abstract: A method and system for storing and retrieving data in an object-relational database system includes receiving a query which results in a request to load a first object. The method also includes identifying relationship types of other objects having a relationship with the first object. Then, the first object and those of the other objects which have a composition relationship with the first object are eager loaded. Those of the other objects which have an association relationship with the first object are marked as fault on demand. Preventing re-faulting of the same object in the same object graph, and trimming of graphs for serialization are also provided.

Abstract: A system facilitates the secure access, and update of patient record information and the creation and navigation of image menus supporting the location and access of desired patient record data by a user. A method for use by a portable processing device for accessing patient record information involves receiving user entered information identifying at least one patient record to be acquired and a content portion of a patient record to be acquired. A patient record repository is accessed by generating a URL link including an address of the repository and containing fields incorporating the information identifying the content portion and the patient record. The generated URL link is communicated to an application used for accessing the repository and the identified patient record content portion is received in response to the communication.

Abstract: Prefixes terminating with end node entries each containing identical length prefix portions in a single child table are compressed by replacing the end node entries with one or more compressed single length (CSL) prefix entries in the child table that contain a bitmap for the prefix portions for the end node entries. A different type parent table trie node entry is created for the child table. Where the prefix portions are of non-zero length, the parent table contains a bitmap indexing the end node entries. Where the prefix portions are of length zero, the parent table may optionally contain a bitmap for the prefix portions, serving as an end node. The number of prefix portions consolidated within the CSL node entry is based upon the prefix portion length.

Abstract: Validation of large numbers of alternative execution plans for a database query, either an exhaustive enumeration of the complete space of alternatives, or else an unbiased random sample, is performed by efficiently constructing execution trees from a data structure having groups alternative operators that are ranked in a directory. Each global rank of a plan identifies that plan uniquely among all the alternative plans. The operators are unranked from the directory according to a specification that characterizes the desired plans.

Abstract: An agreement management system for organizing information around agreements and chains of agreements. The system includes an agreement database and notes database for storing agreements and information directly related to those agreements. The system further includes a set of forms for use in negotiating an agreement, modifying an existing agreement and managing the performance of an existing agreement. The system supports agreement chains which permit the linking of pairs of agreements such that the customer of one of the linked agreements is a supplier to a customer of another of the linked agreements. Templates that permit the simple reuse of agreement chains are also supported by the system. A number of ancillary databases, such as a contacts database, a correspondence database, a folders database, a reminders database and a notebook database give the system the flexibility to record additional information both related to the agreements and unrelated to the agreements.

Abstract: A system and method for real-time compression and archiving of data files is disclosed. Some data files become so large that archiving onto a single storage medium, such as a CD-ROM or floppy disk, becomes difficult. In order to allow for such archival storage, an initial data file is broken down into smaller data files for compression. Once compressed, successive files are selected for storage onto a first storage medium until the storage medium becomes full. Once the first storage medium is full, the next set of data files is selected and placed onto a second storage medium. This process is repeated until all of the smaller files that originated from the initial file are archived.

Abstract: A database of entries, such as Web pages and sites, is provided. The entries are at least partially mapped to a set of predetermined categories. The entries are also associated with keywords, for instance, by automatic indexing of documents. In response to a query into the database, a user is provided with a series of refinement strategies, in addition to search results. Refinement strategies comprise categories relevant for the search, selected among the set of predetermined categories. Refinement strategies also include keywords dynamically selected among keywords associated with the entries. The user may easily navigate among the results to the query, and formulate new queries.

Abstract: Systems and methods are provided for interfacing between an element management system and a network management system in a network. A method includes associating a plurality of physical elements of a network with at least one element management system; providing a network management system; and providing a generic management information base interfacing between the at least one element management system and the network management system. The generic management information base includes a first data structure and a second data structure, the first data structure including at least one attribute common to each of the plurality of physical elements associated with the element management system, the second data structure including at least one value representing at least one of the plurality of physical elements. The first data structure and the second data structure are associated using a common link field and the first data structure and the second data structure are generic.

Abstract: A method and apparatus are disclosed for making and using a virtual microscope slide data structure having data for an overall image of the specimen or a substantial portion thereof along with data for higher magnification images of selected areas within the overall image and along with data useable for correlating, linking and/or coherently assembling low magnification, overall image segments with the higher image segments. This latter data may comprise a control program for manipulating images to allow zooming different, higher magnification images into view, scrolling adjacent high magnification images into view or marking the location of a displayed higher magnification view on the overall image to assist in navigation by a viewer to locate and quickly display suspicious areas within the specimen. The data structure may be sent over the Internet.