Abstract: An electronic calendar includes such features as recurring reminders, dividing unpredictable work loads into equal pieces, template free parsing, a reminders scheduling algorithm to reduce spikes, dynamic delivery and recovery algorithms, methods for splitting the work load between controllers and workers and for monitoring progress, all within the context of a calendar architecture for a large enterprise.

Abstract: A transaction of processing a database distributed to a plurality of servers in a chain of local transactions individually processed by and in each server. In each server, when the processing of a local transaction in the server is completed, the local transaction is committed or rolled back, and the right to execute a process of an application is released. Until all chained transactions are completed, the exclusive control of data accessed in the local transactions and the data before update of updated data is managed in a log, thereby guaranteeing the consistency and integrity of the data.

Abstract: An enterprise-wide data-warehouse comprising a database management system (DBMS) including a relational datastore storing data in tables. An aggregation module, operatively coupled to the relational datastore aggregates the data stored in the tables of the relational datastore and storing the resultant aggregated data in a non-relational datastore. A reference generating mechanism generates a first reference to data stored in the relational datastore, and a second reference to aggregated data generated by the aggregation module and stored in the non-relational datastore. A query processing mechanism processes query statements, wherein, upon identifying that a given query statement is on the second reference, the query processing mechanism communicates with the aggregation module to retrieve portions of aggregated data identified by the reference that are relevant to the given query statement.

Abstract: An apparatus and method for identifying and/or analyzing potential patent infringement, including a processing device for processing the information regarding the patent, wherein the processing device identifies at least one independent claim of the patent, wherein the processing device formulates a search or a search query containing information corresponding to the at least one independent claim, wherein the processing device searches information regarding at least one of a product, products, a service, and services, wherein the processing device obtains and processes information regarding at least one of a product, products, a service, and services, relevant to the at least one independent claim in conjunction with information contained in the at least one independent claim, and further wherein the processing device generates claim chart information containing information regarding the at least one of a product, products, a service, and services.

Abstract: The invention relates to a method and apparatus for recording and maintaining stored information system object relationship information. Information contained within a stored information system (including system catalogs, referential constraints, triggers, table hierarchies, column references, indexes, stored program packages, system catalogs, stored procedures, stored queries, log/trace files of dynamically executed code, etc.) are searched to identify dependency relationships between objects. This object relationship information is stored and maintained in an information base. Information within the information based may be organized based upon subsets of objects that support a common application, service, or capability.

Abstract: A method and system for performing real-time database update transactions with disconnected database clients includes a disconnected client server (DCS) and disconnected client extensions (DCE). The DCS formats the database cell, its key, any associated database cells, and a timestamp and sends them to a disconnected database client by email. The timestamp indicates the last time the database cell or associated database cells was changed. The disconnected database client sends a reply email with the update of the database cell and the timestamp. Upon receipt of the reply email, the DCS compares the received timestamp to a current timestamp for the database cell. If they match, then the database cell is updated according to the received update. If they do not match, then the update is based on outdated information and is rejected. In this manner, reliable real-time update transactions are provided between a disconnected database client and the database.

Abstract: Computerized methods and systems are presented for facilitating identification, management and/or protection of proprietary information. Data can be received that is descriptive of proprietary information, entities involved in creating, conveying, receiving or accessing the proprietary information as well as any information that will be created, conveyed, received or accessed. The system receives data and generates suggested actions and artifacts to aid in the identification, management and/or protection of proprietary information that may result from the circumstances described by the data received. Embodiments can also include receiving data descriptive of a process and determining potential proprietary information that may be involved. Relevant suggested actions and artifacts can also be generated.

Abstract: A system and method for unorchestrated determination of data sequences using “sticky byte” factoring to determine breakpoints in digital sequences such that common sequences can be identified. Sticky byte factoring provides an efficient method of dividing a data set into pieces that generally yields near optimal commonality. This is effectuated by employing a rolling hashsum and, in an exemplary embodiment disclosed herein, a threshold function to deterministically set divisions in a sequence of data. Both the rolling hash and the threshold function are designed to require minimal computation. This low overhead makes it possible to rapidly partition a data sequence for presentation to a factoring engine or other applications that prefer subsequent synchronization across the data set.

Abstract: An apparatus for and method of utilizing an internet terminal coupled to the world wide web to access an existing proprietary data base management system having a dialog-based request format. The user request is received by a web server from the world wide web and converted into one or more sequenced data base management commands stored as corresponding to the service request. If a particular service request requires access to secured data and/or services, the request may be granted in relationship to a particular user security profile. This security profile is determined through a special field indicative of the internet user transferred in conjunction with the service request.

Abstract: A database system includes components for executing stored procedures that include at least one of a conditional expression, assignment expression, and dynamic database query language (e.g., SQL) statement. For each such expression, a predetermined type of code is generated and inserted into the object code corresponding to the stored procedure. When executing the stored procedure object code, the predetermined type of code is evaluated directly without having to generate a separate database query language statement.

Abstract: A data management apparatus, according to a request of an application program, lends a pointer for reading out a data from a data field stored a plurality of data. An address of the data field corresponding to the lent pointer is stored a lending pointer table. When the application program accesses a data stored in the data field, the data management apparatus receives the pointer from the application program, reads out an address corresponding to the received pointer from the lending pointer table, and reads out the data corresponding to the read address from the data field. The read data is given to the application program.

Abstract: An automated technique implemented in a computer system for selecting one or more resources on which a principal is authorized to perform at least one action comprises the following steps/operations. First, one or more authorization policies that apply to a given principal are selected. Then, the one or more authorization policies are transformed based on meta-information associated with the one or more resources so as to form a query against a resource store that selects the one or more resources on which the one or more authorization policies allow the given principal to perform the at least one action. The query may then be executed to select the one or more resources from the resource store. In another automated technique, the query may be formed without use of the one or more authorization policies, but where the policies are used to remove unauthorized resources from the superset of resources returned as a result of query execution.

Abstract: A system and method are provided which are necessary for exchanging information among a sales agent a1, user a2 and manufacturer A, for preparing a parts check list on an on-line basis, and for storing information to be provided. If, for example, the sales agent a1 or user a2 wants to acquire information from the manufacturer A, manufacturer A will directly confer a password to sales agent a1 with whom manufacturer A directly deals with, while sales agent a1 will directly confer a password to user a2 with whom sales agent a1 directly deals with, on behalf of manufacturer A. This arrangement makes it possible to easily and securely provide, to a specified information seeker, information required by that information seeker.

Abstract: Methods and systems for estimating impact between metadata descriptors are provided. A software program compares a first metadata descriptor with a second metadata descriptor and determines an impact rating between the metadata descriptors. The impact rating may be used to map metadata descriptors or as an indication of how a change in one database will effect other interrelated databases.

Abstract: A database engine and optimizer framework includes a decoder to identify and process SQL queries or statements that reference a UDF before they are executed. Once such a statement is detected, the decoder determines if the UDF is capable of being merged into an SQL statement and, if so, performs such a merge. In some embodiments, the decoder may not use a pre-cached version of the UDF but, instead, may include a component that locates and retrieves the latest version of the UDF for use when performing the merge. Also, for UDFs that cannot easily be merged into an SQL statement, the decoder may not merge the UDF into an SQL statement but may allow the optimizer and execution engine to retrieve and execute the UDF in the usual manner.

Abstract: A method of sequencing and scheduling web resources, via a software application that collects URLs and feeds them to a Web browser, so that the amount of clicks and decisions are reduced when browsing the Internet. The method begins after a computer user with Net-access encounters a URL that leads to a collection of other URLs that the software application has arranged to be presented in a continuous, show manner. This collection of resources then plays automatically, going from one resource to the next without the user being required to make a decision or click. The decision-making process is not inhibited, it is made optional. A method of inserting full-screen advertising, public service announcements, news, etc. has been developed. The server software application module described herein allows a publisher to stream URLs to a user who does not have the client-side software.

Abstract: A shape-based geometric database uses R-trees to compactly and efficiently represent design objects. Such R-trees may be populated in an efficient and balanced manner to improve the efficient use of such R-trees in various stages of circuit design, for example. For example, tiles are assigned to bins depending at least partially on orientation of the tiles and on proximity of the tiles to reference tracks having similar orientations. Bin R-trees may be defined, along with direction and layer R-trees using a level sequential process from lower levels to higher levels until a root node is defined in each case.

Abstract: A system and method for synchronizing a local replicated database with remote replicated databases. Generally, the system includes a local replicated database and a synchronization manager associated with the local replicated database. The synchronization manager may send changes made on the local replicated database to one or more remote replicated databases for reconstruction by the one or more remote replicated databases, and may receive changes made on a remote replicated database. In addition, the synchronization manager may reconstruct changes received from a remote replicated database on the local replicated database. Preferably, the synchronization manager may send, receive, and reconstruct changes independently from one another, i.e., may perform one or more of these activities autonomously and/or asynchronously.

Abstract: A records filter filters database records based on general and/or specific filter criteria. The records filter is effectively utilized in the context of a mail merge process in a document editor, such as a word processor application. The records filter can be provided to a user in the form of a graphical user interface that allows the user to intuitively set and modify filters to process the database records from a database source file. The graphical user interface permits a user to implement general and specific filters to process the records of a database. Specific filters can be designed to exclude specific records from the list of database records. Specific record exclusion can be performed by enabling a user to select or de-select a checkbox associated with each database record. General database record filtration is performed by processing general filter criteria input from the user.

Abstract: One or more computer systems, a carrier medium, and a method are provided for creating a catalog for backup data using NDMP file history messages. The messages are received at a first computer system (NDMP client) from a second computer system (NDMP host). Each message comprises information describing a filesystem node (a file or directory). The messages comprise hierarchy information and attribute information for the nodes. For each message comprising hierarchy information, an entry may be created for the respective node in a catalog, and the hierarchy information for the respective node may be stored in the catalog. For each message comprising attribute information, the attribute information for the respective node may be stored in the catalog. The messages may be processed in a single pass without caching them all. A carrier medium may include program instructions which, when executed, cause the above operations on one or more computer systems.