Abstract: A distributed database processing system for a database composed of data records organized into tables which processes unique index atoms consistently and concurrently. Each attempt to insert a new key value into such a unique index atom in any given node is routed to a unique index atom chairman for processing. The chairman determines whether the request will be granted. If the request is not granted, the requesting unique index atom continues to try to submit the insert. If the request is granted, the requesting unique index atom modifies the content thereof and broadcasts a replicated given unique index atom all other nodes that contain the replicated unique index atom.

Abstract: A distributed data processing system for a database composed of data records organized into tables for responding to a request to split an index in a consistent and concurrent fashion. A request to split an index atom at any given node is processed by a designated “chairman” for that index atom. The chairman splits its index by maintaining a lower portion thereof and by moving the contents of an upper portion to a newly created index atom as the right sibling. Each other node takes appropriate steps to assure orderly transfer of this information from the chairman consistently and concurrently across the distributed database processing system.

Abstract: A distributed database processing system for a database composed of data records organized into tables which processes unique index atoms consistently and concurrently. Each attempt to insert a new key value into such a unique index atom in any given node is routed to a unique index atom chairman for processing. The chairman determines whether the request will be granted. If the request is not granted, the requesting unique index atom continues to try to submit the insert. If the request is granted, the requesting unique index atom modifies the content thereof and broadcasts a replicated given unique index atom all other nodes that contain the replicated unique index atom.

Abstract: A distributed database processing system for a database composed of data records organized into tables which processes unique index atoms consistently and concurrently. Each attempt to insert a new key value into such a unique index atom in any given node is routed to a unique index atom chairman for processing. The chairman determines whether the request will be granted. If the request is not granted, the requesting unique index atom continues to try to submit the insert. If the request is granted, the requesting unique index atom modifies the content thereof and broadcasts a replicated given unique index atom all other nodes that contain the replicated unique index atom.

Abstract: A distributed data processing system for a database composed of data records organized into tables for responding to a request to split an index in a consistent and concurrent fashion. A request to split an index atom at any given node is processed by a designated “chairman” for that index atom. The chairman splits its index by maintaining a lower portion thereof and by moving the contents of an upper portion to a newly created index atom as the right sibling. Each other node takes appropriate steps to assure orderly transfer of this information from the chairman consistently and concurrently across the distributed database processing system.

Abstract: A distributed data processing system for a database composed of data records organized into tables for responding to a request to split an index in a consistent and concurrent fashion. A request to split an index atom at any given node is processed by a designated “chairman” for that index atom. The chairman splits its index by maintaining a lower portion thereof and by moving the contents of an upper portion to a newly created index atom as the right sibling. Each other node takes appropriate steps to assure orderly transfer of this information from the chairman consistently and concurrently across the distributed database processing system.

Abstract: A distributed database processing system for a database composed of data records organized into tables which processes unique index atoms consistently and concurrently. Each attempt to insert a new key value into such a unique index atom in any given node is routed to a unique index atom chairman for processing. The chairman determines whether the request will be granted. If the request is not granted, the requesting unique index atom continues to try to submit the insert. If the request is granted, the requesting unique index atom modifies the content thereof and broadcasts a replicated given unique index atom all other nodes that contain the replicated unique index atom.

Abstract: A distributed database processing system for a database composed of data records organized into tables which processes unique index atoms consistently and concurrently. Each attempt to insert a new key value into such a unique index atom in any given node is routed to a unique index atom chairman for processing. The chairman determines whether the request will be granted. If the request is not granted, the requesting unique index atom continues to try to submit the insert. If the request is granted, the requesting unique index atom modifies the content thereof and broadcasts a replicated given unique index atom all other nodes that contain the replicated unique index atom.

Abstract: A distributed data processing system for a database composed of data records organized into tables for responding to a request to split an index in a consistent and concurrent fashion. A request to split an index atom at any given node is processed by a designated “chairman” for that index atom. The chairman splits its index by maintaining a lower portion thereof and by moving the contents of an upper portion to a newly created index atom as the right sibling. Each other node takes appropriate steps to assure orderly transfer of this information from the chairman consistently and concurrently across the distributed database processing system.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method and apparatus for facilitating the development and management of web sites. A web page generator includes applications for controlling web page operations or semantics and a plurality of templates for controlling the appearance of a web page. A templates manager object establishes Template Set Objects and Template Objects for each application on a dynamic basis. Applications use this dynamic hierarchy to identify specific templates for use, even templates in the same or different applications with the same name.

Abstract: A method and apparatus for facilitating the development and management of web sites. A web page generator includes applications for controlling web page operations or semantics and a plurality of templates for controlling the appearance of a web page. A templates manager object establishes Template Set Objects and Template Objects for each application on a dynamic basis. Applications use this dynamic hierarchy to identify specific templates for use, even templates in the same or different applications with the same name.

Abstract: An event alerter system for notifying one application or process of a change in a database. A database management system includes an event generator that defines events to be reported, such as a change in a particular field of the database. Each time an change occurs, the event generator notifies an event manager of the name of the event. Whenever an event dependent process indicates an interest in a change in a field in a particular record or records in a database, it transfers a command to the event manager identifying each such record and change. When the event dependent process issues such a command, it enters a wait state to process the occurrence of an event in either a synchronous or asynchronous mode. The event manager converts such a command into entries in an event table that identifies, for that and other event dependent processes, the list of events in which a process has an interest.