Abstract: A device and method for synchronizing information between computer systems is provided. Certain subsets of information may be synchronized, while excluding other information from the synchronization process. The determination of the information subset to synchronize requires no explicit designation by the user. Instead, the subset of information to be synchronized is ascertained through actions of the user that implicitly indicate the user's interest in the information, allowing for an intuitive assumption of the user's synchronization desires, and requiring no user activity outside of the user's normal operational activity.

Abstract: The present invention relates to a structured document classification device for classifying structured documents by types, comprising: a structural feature extracting section for extracting a structural feature or an incidental feature from each structured document; a structural feature rule base for storing a rule dedicated to the extracted structural feature or incidental feature; and a verifier for verifying each feature, which is extracted by the structural feature extracting section, according to the rule stored in the structured rule base, calculating relevance to each type.

Abstract: In an apparatus for retrieving documents, each document and a query character string are divided into a plurality of index keys. A retrieval condition analyzing part analyses a retrieval condition including the index keys divided from the query character string and generates a retrieval condition tree synthesized by at least one operator that retrieves an intermediate retrieval result including the document information from said index table. A retrieval condition evaluating part evaluates each intermediate retrieval result obtained by the retrieval condition tree and determining a final retrieval result.

Abstract: A system and method for automatic journaling of objects in a computer file system. A journal directory operation is caused when a new or existing object to be linked into a directory if the directory has an attribute indicating automatic journaling status. An operating system synchronization lock is acquired before the object is journaled to preserve the object from changes by the operating system, and held in place until after journaling has started.

Abstract: Disclosed are association rule identification and visualization methods, systems, and apparatus. An association rule in data mining is an implication of the form X→Y where X is a set of antecedent items and Y is the consequent item. A unique visualization technique that provides multiple antecedent, consequent, confidence, and support information is disclosed to facilitate better presentation of large quantities of complex association rules.

Abstract: Middleware operating under control of a media data audiovisual apparatus having functions of storing media data for replaying includes a media data management section for providing the media data management functions including replaying, readout, recording, deletion and synthesis of media data and also recording of an access history to the media data, a meta-data management section providing the meta-data management functions including readout, recording and dynamic creation of meta-data and also transaction processing attendant upon an access to the meta-data, and a query section having the functions of providing more highly abstractive access interface for an application program through vicarious execution of the processing for an access to the media data management section and the meta-data management section, wherein the middleware is configured to provide the functions as a database of the media data for the application program as a whole.

Abstract: A hybird Notes/DB2 environment provides a requisition catalog on the Web. Client browsers are connected to a GWA infrastructure including a first network dispatcher and a virtual cluster of Domino.Go servers. The network dispatcher sprays out browser requests among configured .nsf servers in virtual server cluster. Communications from this virtual server cluster are, in turn, dispatched by a second network dispatcher servers in a Domino cluster. External objects, primarily for a GUI, are served in a .dfs and include graphic files, Java files, HTML images and net.data macros. The catalog is built from supplier provided flat files. A front end is provided for business logic and validation, as also is a relation database backend. HTML forms are populated using relational database agents. A role table is used for controlling access both to Notes code and DB2 data. Large amounts of data is quickly transferred using an intermediate agent and window.

Abstract: A real-time event processing system (EPS) for processing a sequence of events generated by one or more applications. In an illustrative embodiment, the EPS includes a set of real-time analysis engines (RAEs) operating in parallel, e.g., a set of clusters each including one or more RAEs, and one or more mappers for mapping a given input event to a particular one of the clusters. A main-memory database system is coupled to the RAEs, and the RAEs process events associated with input streams from one or more data sources and deliver output streams to one or more data sinks. The data source and data sinks may be, e.g., network elements, clients, databases, etc. The events are processed in accordance with services implemented in the RAEs, and utilize data stored in a memory portion of the main-memory database system accessible to the RAEs. The data may include, e.g., a subscription table storing subscription information indicating the service or services that should be executed for a given event.

Abstract: Techniques are disclosed for expanding the concept of partitioning in variety of ways. In particular techniques are provided for performing multiple-dimension partitioning. In multiple-dimension partitioning, a database object is divided into partitions based on one criteria, and each of those resulting partitions is divided into sub-partitions based on a second criteria. The process of partitioning partitions based on different criteria may be repeated across any number of dimensions. Entirely different partitioning techniques may be used for each level of partitioning. The database server takes advantage of partitions when processing queries by selectively accessing a subset of partitions on disk or reducing the number of internal join operations.

Abstract: A system and method for propagating data from one file format to another file format analyzes the file format of saved data to determine whether the file can be opened by the requesting application program. If the file is of a format or version different than that of the requesting application program, the data propagation logic analyzes the file to determine the available file formats attached thereto and launches an executable module, either attached to the file or remotely accessible via a resource indicator, to convert the file to a new file of a format and/or version readable by the requesting application program.

Abstract: A method to serve web pages from a server linked to a network of a plurality of clients, the server coupled to a plurality of data pages and to an access log. The method begins with reading an access log to collect data identifying pages that are most frequently accessed by a plurality of clients. The pages are retrieved, at least in part, from a database server coupled to a database storage. The one or more pages are stored in a cache as identified by the access log, where each of the pages are identified in the access log with at least one category of a search criteria received from the clients. An access request is received from one or more clients for a page based upon the search criteria received from the clients. The page from cache is retrieved if the page which has been requested was previously stored in cache. On the other hand, if the page, which has been requested, was not previously stored in cache then the page is retrieved from database storage.

Abstract: Occurrences of data records in a non-relational database are counted by first selecting rows of data records. A counter field is created and appended to the selected rows. The counter field is weighted with a fixed value which may be different for different selected rows. A summation is performed on the weighted counter fields to count and subsequently display occurrences of data records. Various counts may be dynamically displayed in response to selection of sort columns in a view of the selected rows of data records.

Abstract: A database search system searches a database through a network. The database reduces the load maintained in a server, and allows users of a client terminal to direct the search condition and to change the method for displaying a list of the search results. Database information and search information are included in a hypertext part defining a screen for the search. A CGI processing part generates automatically a database search sentence (an SQL sentence) based on the information described in the hypertext part. A screen input control part includes a function editing by a graphical user interface the hypertext source defining a screen in the client terminal.

Abstract: Disclosed is a computer-assisted method for classifying a text document according to emotion and affect. A score is assigned to each affect term in the document. An affect score is computed for the document from the scores for each affect term. The document is then classified in accordance with the affect score. An apparatus for performing the computer-assisted method is also disclosed.

Abstract: A knowledge acquisition and retrieval apparatus and method that emulate the human brain and comprise at least one first memory segment, and a distinct second memory segment, wherein elements of the at least one first memory segment are reciprocally associated to elements of the second memory segment, and vice-versa. The at least one first memory segment comprises categorized data from the physical world, known as representational data, while the second memory segment contains abstract or conceptual data, otherwise known as consciousness data. Physical data comprises auditory data, language data, visual data, motion data, and sensory data, and each element of the at least one first memory segment is identified as auditory data, language data, visual data, motion data, or sensory data. By reciprocally associating the physical (representational) and conceptual (consciousness) data, a hierarchical structure is created that allows information retrieval by traversing the reciprocal associations.

Abstract: Techniques are disclosed for expanding the concept of partitioning in variety of ways. In particular techniques are provided for performing multiple-dimension partitioning. In multiple-dimension partitioning, a database object is divided into partitions based on one criteria, and each of those resulting partitions is divided into sub-partitions based on a second criteria. The process of partitioning partitions based on different criteria may be repeated across any number of dimensions. Entirely different partitioning techniques may be used for each level of partitioning. The database server takes advantage of partitions when processing queries that include joins. In particular, techniques are provided for performing a full parallel partitioned-wise join, and a partial parallel partition-wise join.

Abstract: A method and system for allowing a server to be configured using a standard protocol is disclosed. The server includes a proprietary database having a plurality of classes. Each of the plurality of classes is capable of including at least one object instance. The at least one object instance is described by at least one descriptor. The proprietary database is for managing the server. The method and system include reading the proprietary database and saving a first plurality of locations of the plurality of classes and a second plurality of locations of the at least one object instance in a standard database accessible using the standard protocol. Via the standard protocol, the standard database can be used to manage the server using the proprietary database.

Abstract: Systems and methods for controlling the dissemination of data from a repository based on the substitution of content contained within a generated response. The systems and methods are used by the repository to allow for the transfer of data that is not known or anticipated until the time of an access. For each access whose intent is to provide data to the repository or to retrieve variable data held by the repository, the repository uses the systems and methods to manage novel information structures whose purpose is to facilitate the substitution of the variable portions of content and to apply a privilege value to the portions that are variable. Using the concept of a “notational fragment”, the systems and methods are capable of assembling a variable result that has interaction with a data source.

Abstract: A primary computer system has a database, application programs that modify the local database, and a transaction manager that stores audit records in a local image trail reflecting those application program modifications to the local database. In a remote backup system, a Receiver process receives audit records from the primary system. The audit records include audit update and audit backout records indicating database updates and database backouts generated by transactions executing on the primary system. The Receiver stores the audit update and audit backout records in one or more image trails. For each image trail there is an Updater process that applies to a backup database volume the database updates and backouts indicated by the audit update and audit backout records in the image trail.

Abstract: A list of data of a database arranged in an order of a value of each component of a vector is formed for each component. For each component sequentially selected from base indexes, a pointer indicating data in an ascending order of a difference between data in the list and a test data is updated. Whether an end condition is satisfied or not is judged from a difference of component value between the data indicated by the pointer and the test data. If the end condition is not satisfied, whether a rejection condition is satisfied or not is judged from a distance in a partial space between the data indicated by the pointer and the test data. If the rejection condition is not satisfied, a distance in a whole space between the data indicated by the pointer and the text data is calculated. A predetermined number of data pieces are retrieved in an ascending order of a calculated distance.