Abstract: A system and user friendly display interface supports creation and modification of a flexible and comprehensive organization structure model able to support provision of clinical care, patient tracking, billing and administration. A method provides a user interface for maintaining organization related information in support of organization operation. The method involves receiving search criteria for use in identifying organization characteristic information. The search criteria is employed in searching a profile comprising information identifying an encompassing organization structure including information identifying multiple constituent organizations and associated organization type and user determinable organization role. Search result information is processed in providing organization characteristic information suitable for presentation to a user via a displayed image in response to user command.

Abstract: DBM files represent a quick and relatively standard method of retrieving data. The DBM files essentially contain a two-column table representing a key/value pair. The simplified relational database extension (SRDE) design described herein extends the value column to be further divided into indexed columns that can be manipulated using a modified SQL interface. SRDE offers a simple setup and maintenance scheme, provides a rich set of regular expression matching that can be applied to all searches.

Abstract: A database search system that retrieves multimedia information in a flexible, user friendly system. The search system uses a multimedia database consisting of text, picture, audio and animated data. That database is searched through multiple graphical and textual entry paths. Those entry paths include an idea search, a title finder search, a topic tree search, a picture explorer search, a history timeline search, a world atlas search, a researcher's assistant search, and a feature articles search.

Abstract: An object of remote copy can be specified in units of a file or a directory more detailed than in units of a volume. If a host computer issues a write request of a file to NASa, NASa references a source NAS of remote copy and a source directory of remote copy at each entry on a copy file table and determines whether the file to be written is an object of remote copy; if it is determined to be an object of remote copy, the file to be written is remotely copied to a target directory of remote copy of a target NAS thereof.

Abstract: The index optimization (XOP) program is a method to recommend new or improved performance indexes for use by an IBM mainframe DB2 database server for a given set of SQL statements. The recommendations are calculated based on a single call of the DB2 optimizer for each SQL statement with the existing index set, parsing of the SQL statements, the filter factors of the SQL statement predicates, and the getpage workload of an SQL statement. The getpage workload of an SQL statement is the read/change activity on each table and each index currently used for all invocations of an SQL statement. The XOP program computes new and improved performance indexes based on the getpage workload of all relevant SQL statements and does not use the DB2 optimizer to determine the usefulness of potential indexes.

Abstract: A database merging apparatus includes a database pair generator that creates a database pair from a first database, a probe set generator that creates a database probe set from a second database and a comparator in communication with the database pair generator and the probe set generator. The comparator determines if the database probe set correlates to the database pair. An identifier is in communication with the comparator to identify a correlation between the database pair and the database probe set so that correlating data from the first database and the second database can be accessed if there is a correlation.

Abstract: A system and method for evaluating a structured message store for message redundancy is described. A header and a message body are extracted from each of a plurality of messages maintained in a structured message store. A substantially unique hash code is calculated over at least part of the header and over the message body of each message. The messages are grouped by the hash codes. One such message is identified as a unique message within each group. In a further embodiment, the messages are grouped by conversation thread. The message body for each message within each conversation thread group is compared. At least one such message within each conversation thread group is identified as a unique message.

Abstract: A system for synchronizing data of wireless devices includes an application server (103), a communication tower (105), and a plurality of mobile terminals (101). Each mobile terminal includes a data type distinguishing module (305), a data filter generating module (303), and a data transferring module (307). The server includes a domain managing module (405) for executing a data filter received from any mobile terminal, and for generating a sync response. A related method includes the steps of: (a) identifying a type of data to be synchronal; (b) generating a sync request in accordance with the type of data to be synchronal, and sending the sync request to the server; (c) generating a sync response based on data stored in the server, and sending the sync response to the mobile terminal; and (d) updating data stored in the mobile terminal in accordance with the sync response.

Abstract: In one exemplary implementation, a client receives a record from a server. The record has a server identification key that uniquely identifies the record from any other records. If the record is viewable by a user in one or more folders, there are corresponding one or more associated references that indicate which one of the one or more folders the record is viewable For each of the one or more associated references, one or more new records identical to the received record are created. One or more client identification keys are assigned to the one or more new client records; wherein each of the one or more client identification keys uniquely identifies the one or more new client records. Each of the one or more new client records are synchronized to the record received from the server by mapping the one or more client identification keys to the server identification key.

Abstract: Disclosed is a method for determining database queries to be sent by an analytical server to a Relational Database Monitoring System (RDBMS) by using hierarchical level metadata to describe the various structures within the database.

Abstract: International business requires contractual relations to be established across jurisdictions. Different jurisdictions have different laws, customs, languages and obligations concerning contractual relations. Thus a standard contract can rarely be used across different jurisdictions. Using a contract template and processing this with a mapping database using a conversion engine, enables substantially automated localisation of a contract template to be achieved. This significantly reduces the cost and effort to enter a new market.

Abstract: A method of synchronizing at least a first and a second database each containing dated records such as events, wherein the records of the first and second databases are synchronized across a narrow date range narrower than the date range of the records of at least one of the databases. A prior synchronization can be performed across a prior date range. The date range of the prior synchronization is stored, along with the history file containing information representative of the content of the databases following the prior synchronization. When a current synchronization is performed, it is performed across a date range that combines the prior date range with the current date range.

Abstract: A system and method to perform a system-wide file system image without time smear in a distributed object-based data storage system. A realm manager is elected as an image master using the Distributed Consensus Algorithm to execute image-taking. All pending write capabilities are invalidated prior to taking the system-wide file system image so as to quiesce the realm and prepare the storage system for the system-wide image. Once the system is quiesced, the image master instructs each storage manager in the system to clone each live object group contained therein without explicitly cloning any objects contained in such object group. In one embodiment, a file manager copies an object in the system before a write operation is performed on that object after the image is taken. Neither the cloning operation nor the copying operation update any directory objects in the system. At run time, a client application may use a mapping scheme to access objects contained in the system-wide image.

Abstract: A data storage methodology wherein a hashing algorithm is applied to break a directory object experiencing frequent concurrent accesses from a number of client or manager applications into a predetermined number of hash component objects and a hash master object that manages the component objects. The hash master object and the hash components, together, constitute a hash directory, which replaces the original non-hashed directory object. Each hash component object contains a portion of the entries contained in the original directory object. Each hash component is managed by only one file manager. The entries in the original directory object are distributed among the hash component objects using a predefined hashing algorithm. The creation of hash components and the hash master allows more than one client application or file manager to concurrently write corresponding hash components without the need for access coordination on each access.

Abstract: A data mining decision tree system that uncovers patterns, associations, anomalies, and other statistically significant structures in data by reading and displaying data files, extracting relevant features for each of the objects, and using a method of recognizing patterns among the objects based upon object features through a decision tree that reads the data, sorts the data if necessary, determines the best manner to split the data into subsets according to some criterion, and splits the data.

Abstract: A method for version recording and tracking. First, a file is stored into a data directory. Thereafter, the checksum of the file is calculated. Then, the version information, the filename, the size, and the checksum of the file are stored into the data directory. When a file needs to track its version information, the checksum of the file is calculated. Then, a data directory is searched to obtain the version information according to the checksum, the filename, and the size of the file.

Abstract: A system and method for facilitating the accurate entry of information into a highly structured database by initially extracting information from a plurality of nonuniformly formatted source data streams, e.g., documents/files, and subsequent interactions with users before storing the accepted and/or modified information into the database. Embodiments of the present invention provide an interactive path for each user (e.g., the author of the source document/file) to interactively modify the extracted data, e.g., according to the source document/file. Preferably, this interactive path is provided via the Internet and the extracted information can be modified by editing and/or selectively copying portions of the source documents/files to supplement and/or modify the extracted information.

Abstract: A system, method and computer readable medium for sampling data from a relational database are disclosed, where an information processing system chooses rows from a table in a relational database for sampling, wherein data values are arranged into rows, rows are arranged into pages, and pages are arranged into tables. Pages are chosen for sampling according to a probability P and rows in a selected page are chosen for sampling according to a probability R, so that the overall probability of choosing a row for sampling is Q=PR. The probabilities P and R are based on the desired precision of estimates computed from a sample, as well as processing speed. The probabilities P and R are further based on either catalog statistics of the relational database or a pilot sample of rows from the relational database.

Abstract: For the evaluation of a plurality of texts, three correspondence tables of keywords and evaluation sections, namely a priority, a regular and an auxiliary correspondence table, are established, so as to automatically assign the most fitting evaluation section from a plurality of evaluation sections to texts one by one. The text data in the texts are analyzed, the occurrence count of keywords included in the correspondence table is counted, and, processing the priority, regular and auxiliary correspondence table in that order, if there is a keyword included in the correspondence table whose occurrence count is not zero, then the section corresponding to the keyword with the maximum occurrence count is determined as the evaluation section.

Abstract: A system, method and computer program product are provided for recognizing virus signatures. Initially, a list of virus signatures is provided. Next, the list of virus signatures is combined into a tree of virus signatures. Data is subsequently compared against the tree of virus signatures for virus signature recognition.