359 results about "Relational database management system" patented technology

Computer software for, computer apparatus for, and a method of automatically generating a user interface for a relational database comprising extracting schema information from the relational database and automatically generating corresponding schema and user interface metadata, storing the metadata in a repository, and automatically developing from the metadata a user interface appropriate to the relational database.

A database integrator is provided to an application program that utilizes the ODBC interface so as to enable the application program to access the data in a legacy DBMS. The application program ("the client program") is located on a workstation, and the legacy DBMS is located on a host computer. The legacy DBMS is used primarily by an application program ("the server program"). The database integrator receives ODBC commands from the client program, and unlike database drivers interacting with non-legacy DBMSs that send SQL statements to the DBMS, the database integrator instead converts these commands into server program-specific commands to manipulate the user interface of the server program, establishes a connection with the server program over a terminal emulation session, and issues the server program-specific commands to the server program by using the terminal emulator. These server program-specific commands manipulate the server program's user interface to display the appropriate data so that the database integrator can then access it. In this manner, the database integrator accesses the data in the legacy DBMS indirectly by issuing user interface commands to the server program, because the database integrator cannot typically access the legacy DBMS directly. This indirect access enables the client program to gain access to the data in a database that it would not otherwise be able to access.

Techniques for transferring objects between database systems. As implemented in a relational database management system, the techniques employ a data transfer mechanism that operates under control of a master table in the RDBMS that is performing the transfer operation. The master table specifies the kind of transfer operation to be performed, a set of objects to be transferred, operations to be performed on the objects as they are being transferred, and filters for selecting a subset of the objects. During execution of the transfer, the transfer mechanism maintains and updates state in the master table such that queries may be made on the master table to determine the current status of the operation and such that the transfer mechanism may restart the operation after it has been stopped either at the request of a client that is performing the operation or because of an error in the transfer. The master table's persistence and the status information it contains permit the client that is performing the operation to detach from the operation without stopping the operation and later again attach to the operation to determine the operation's status or to perform operations such as creating new files for the operation or changing the degree of parallelism with which the transfer operation is being performed. Another feature of the transfer mechanism is using an object's metadata to determine the most efficient way of transferring the object.

A software system automatically and dynamically generates a fully functional user interface (UI) based upon, and connected directly to, an underlying data model (as instantiated within a relational database management system (RDBMS)). The UI derives from an automated interrogation of the RDBMS, and comprises all mode displays (e.g., browse, search, edit, add) for all tables, and a full complement of mechanisms—integrated directly into the mode displays—for representing, navigating, and managing relationships across tables, regardless of the complexity of the underlying RDBMS schema. It utilizes a hierarchical “context stack” for suspending the working state of a particular table while “drilling down” to work with related-table information and return relevant changes to the base table. The embodiment further provides methods to enhance and extend the internal representation of table structures, constraints, relationships, and—special requirements (“business rules”) for improved revelation of the schema structure through external interrogation.

A method and apparatus are provided for updating XML views of relational data. The present invention translates an update to an XML view of a relational database into update operations to be performed on the underlying relational database itself. The disclosed XML view update manager can perform updates in the context of an underlying relational database that serves the XML-based application, as well as traditional relational database management system (RDBMS) applications. Given a pre-existing underlying relational database schema and an XML view defined on it, the present invention provides a framework for generating update plans to perform an update without introducing side-effects to other parts of the view.

A method, apparatus (1), and article of manufacture for performing data mining applications (110) in a relational database management system (114). An analytic logic data model (LDM) provides logical entity and attribute definitions for advanced analytic processing (112) performed by the relational database management system directly against the relational database.

System and method for sub-second data replication. The present invention provides the ability to replicate database transactions made on one computer to one or more local or remote computers instantly, utilizing the database management system's transaction log for the replication. The present invention intercepts transactions being sent to a database's transaction log and interprets and copies the transactions to one or more replica servers, as well as to the original existing database transaction log. This enables real-time reporting without taxing the transaction system, real-time backup and immediate disaster recovery, by offloading said activities from the transaction server to a replica server that synchronized with the transaction server in real-time. The system comprises a central server and a set of source and destination agents that can reside all in a local system, or can be remotely connected such as through a TCP/IP networks The central server controls a series of loadable modules to perform specific functions in the system, and an agent that runs on every machine in the system that has a relational database management system running. The agent is either a source agent, gathering data from a source database server, or a destination (or target) agent, applying the data to the destination database, or both a source and destination agent.

System, method, computer program product embodiments and combinations and sub-combinations thereof for managing data storage as an in-memory database in a database management system (DBMS) are provided. In an embodiment, a specialized database type is provided as a parameter of a native DBMS command. A database hosted entirely in-memory of the DBMS is formed when the specialized database type is specified.

A workflow system that automates work processes. The workflow system uses an open architecture to support multiple platforms and includes Application Programming Interfaces (APIs) enabling applications to communicate with a workflow engine. The workflow system supports Relational DataBase Management System (RDBMS) databases and allows routing of any kind of work (forms, images, executables). In addition, its flexible architecture is designed to facilitate changes to a workflow dynamically and to support integration with an existing infrastructure.

The workflow system links software components to enable participants to work on shared data and ensures that business processes follows predetermined rules. Each task in the process is regulated such that the appropriate people have access to the appropriate data and are instructed to perform the task at the appropriate time.

A developer can use a workflow system provided client to get an application up and running relatively quickly. The workflow system provides adapters which enables quick deployment and element flexibility. Adapters have a fixed interface which allows the Document Management System ((DMS)), Directory Services (DS) and DataBase system (DB) to be changed independent of the application in contrast to other workflow systems which tie the application directly to the (DMS), DS, and DB. The adapters allow developers to attach clients of varying types and magnitude and allows developers to mix and match application elements to better serve their application. Thus, the workflow system is not tied to any proprietary (DMS), DS, or DB.

Various embodiments include one or more of systems, methods, software, and data structures that allow dual access to concurrent data in a database management system including uncommitted updated data. Some embodiments include a dual snapshot of data in a multi-version concurrency control style database, but the embodiments described herein are equally applicable to virtually any other type of database and database management system.

Multidimensional clustered tables are provided for efficient processing and management in a relational database management system. A multidimensional clustered table is one whose data is simultaneously clustered along one or more independent dimensions, or clustering keys, and physically organized into blocks or pages on disk. When such a table is created, one can specify one or more keys as dimensions along which to cluster the table's data. Each of the dimensions can consist of one or more columns. Further provided are efficient query processing and maintenance techniques for use in conjunction with multidimensional clustered tables.

A multi-user, elastic, on-demand, distributed relational database management system. The database is fragmented into distributed objects called atoms. Any change to a copy of an atom at one location is replicated to all other locations containing a copy of that atom. Transactional managers operate to satisfy the properties of atomicity, consistency, isolation and durability.

An organization's data records are often noisy: because of transcription errors, incomplete information, and lack of standard formats for textual data. A fundamental task during data cleansing and integration is matching strings—perhaps across multiple relations—that refer to the same entity (e.g., organization name or address). Furthermore, it is desirable to perform this matching within an RDBMS, which is where the data is likely to reside. In this paper, We adapt the widely used and established cosine similarity metric from the information retrieval field to the relational database context in order to identify potential string matches across relations. We then use this similarity metric to characterize this key aspect of data cleansing and integration as a join between relations on textual attributes, where the similarity of matches exceeds a specified threshold. Computing an exact answer to the text join can be expensive. For query processing efficiency, we propose an approximate, sampling-based approach to the join problem that can be easily and efficiently executed in a standard, unmodified RDBMS. Therefore the present invention includes a system for string matching across multiple relations in a relational database management system comprising generating a set of strings from a set of characters, decomposing each string into a subset of tokens, establishing at least two relations within the strings, establishing a similarity threshold for the relations, sampling the at least two relations, correlating the relations for the similarity threshold and returning all of the tokens which meet the criteria of the similarity threshold.

The invention discloses a spatiotemporal database management method, as well as a management system and a program product thereof. The spatiotemporal database management system comprises a data collection part, a spatiotemporal data association part and a spatiotemporal data management part, wherein, the data collection part is used to collect or receive the spatial information and the timing information about a geographical entity from external systems, and the produced and existed object timing information of the data are arranged; the spatiotemporal data association part is used to associate various data obtained from the data collection part with the object timing information, and store the association into a corresponding spatiotemporal data file, so as to express the evolution history of the geographical entity and predict the change of the geographical entity; the spatiotemporal data management part is used to respectively store the spatiotemporal data file produced by the spatiotemporal data association part according to the temporal information recorded by the timing information of the geographical entity and the evolution trend recorded by the spatial information of the geographical entity, so as to compose a spatiotemporal database.

An optimization technique that reorders outerjoins and antijoins with inner joins in a bottom-up optimizer of a relational database management system (RDBMS). Each join predicate is associated with a normal eligibility list (NEL) that includes tables that are referenced in the join predicate and an extended eligibility list (EEL) that includes additional tables that are referenced in conflicting join predicates. An EEL includes all the tables needed by a predicate to preserve the semantics of the original query. During join enumeration, the optimizer determines whether a join predicate's EEL is a subset of all the tables in two subplans to be merged, i.e., whose EEL is covered. If so, the two subplans are combined using the join predicate. Otherwise, the two subplans cannot be joined. Two approaches are used to reordering: without compensation and with compensation. The "without compensation" approach only allows join reorderings that are valid under associative rules. Thus, the optimizer will not combine subplans using a join predicate whose EEL is not covered. The "with compensation" approach allows two subplans to be combined using the join predicate, when a join predicate's EEL is not covered, as long as the join predicate's NEL is covered. Compensation is performed through nullification and best match. Multiple compensations may be merged and performed at any time.

A method, apparatus, and article of manufacture for creating macro language files for executing SQL queries in a relational database management system via the World Wide Web of the Internet. In accordance with the present invention, Web users can request information from RDBMS software via HTML input forms, which request is then used to create an SQL statement for execution by the RDBMS software. The results output by the RDBMS software are themselves transformed into HTML format for presentation to the Web user.

An arrangement for archiving data in a relational database is disclosed. The arrangement includes a first table having a first data field. A value in the first data field is updated by a Relational Database Management System (RDBMS) associated with the relational database when there is a change in the value in the first data field. The arrangement further includes a second table having a second data field represented by a lookup function. The lookup function references the first data field. The lookup function acquiring the value in the first data field for use as a value of the second data field only when a value of the second data field is required by an application program that operates on the relational database.

Aspects for achieving efficient data access to data elements in a relational database management system are provided. In a computer-implemented method aspect, the efficient data access occurs by establishing a hash table for data elements of a database in a predetermined continuous space of allocated storage, and optimizing utilization of the hash table during database query operations through linear hashing, wherein extension of the hash table occurs automatically to increase a number of pages in the hash table without discernible interruptions of data access to the data elements.