Abstract: Systems, methods, and other embodiments associated with content invalidation are described. One example method includes parsing a response to identify an invalidation directive. Then if identified, invalidating cached content from a cache memory that corresponds to the content identified by an invalidation directive.

Abstract: Systems, methods, and other embodiments associated with processing regular expressions are described. One example method includes analyzing a rule for a regular expression and deleting the regular expression.

Abstract: Systems, methods, and other embodiments associated with content invalidation are described. One example method includes parsing a response to identify an invalidation directive. Then if identified, invalidating cached content from a cache memory that corresponds to the content identified by an invalidation directive.

Abstract: Systems, methods, and other embodiments associated with content invalidation are described. One example method includes providing an invalidation directive in a header of a response.

Abstract: Systems, methods, and other embodiments associated with event logging are described. One example method includes collecting request-based event log data associated with processing a request and temporarily storing the event log data in a memory. In the event of an error, the event log data is transferred to a storage device.

Abstract: Systems, methods, and other embodiments associated with processing regular expressions are described. One example method includes analyzing a rule for a regular expression and deleting the regular expression.

Abstract: Systems, methods, and other embodiments associated with content invalidation are described. One example method includes providing an invalidation directive in a header of a response.

Abstract: Systems, methods, and other embodiments associated with event logging are described. One example method includes collecting request-based event log data associated with processing a request and temporarily storing the event log data in a memory. In the event of an error, the event log data is transferred to a storage device.

Abstract: A method and apparatus is disclosed for accurately estimating the cost of a database query, including the total computer resources used and estimated elapsed time for the production of a first row and last row of an operator involved in the query and/or the total resources used and elapsed time for returning the overall response to a database query. The method and apparatus accurately accounts for resources used and elapsed time associated with blocking operators, such as sorts and hash joins, which cannot produce a first row until they have completed their operations.

Abstract: A fault tolerant computer system distributes audit trail files containing audit records, across an arbitrary number of disk volumes. After one audit trail file becomes full, audit records are directed toward a next audit trail file stored on a different disk volume. Storage of newly generated audit rotates through the disk volumes in round-robin fashion. Full audit trail files are eventually archived and their space becomes available again for renaming and storage of newly generated audit records. The number of audit records available for on-line recovery after a failure is not limited to the storage capacity of any single disk volume. Furthermore, there is no contention for disk access between archiving of full audit trail files and storage of newly generated audit records.

Abstract: System-critical files are protected from being inadvertently modified or deleted by placing them in a Reserve name space of storage that requires any process seeking modifying access to the Reserve name space to have a "Right" to do so. The right to modifying access is garnered by a process first making a call to a system library procedure that causes a memory-stored data structure associated with the calling process to be modified, identifying the process as one with a Right to make modifying access to the Reserve name space. Any attempt to modify, delete, or create any file residing in the Reserve name space without the Right will be refused.

Abstract: A fault tolerant computer system distributes audit trail files containing audit records, across an arbitrary number of disk volumes. After one audit trail file becomes full, audit records are directed toward a next audit trail file stored on a different disk volume. Storage of newly generated audit rotates through the disk volumes in roundrobin fashion. Full audit trail files are eventually archived and their space becomes available again for renaming and storage of newly generated audit records. The number of audit records available for on-line recovery after a failure is not limited to the storage capacity of any single disk volume. Furthermore, there is no contention for disk access between archiving of full audit trail files and storage of newly generated audit records.

Abstract: A fault tolerant computer system distributes audit trail files containing audit records, across an arbitrary number of disk volumes. After one audit trail file becomes full, audit records are directed toward a next audit trail file stored on a different disk volume. Storage of newly generated audit rotates through the disk volumes in round-robin fashion. Full audit trail files are eventually archived and their space becomes available again for renaming and storage of newly generated audit records. The number of audit records available for on-line recovery after a failure is not limited to the storage capacity of any single disk volume. Furthermore, there is no contention for disk access between archiving of full audit trail files and storage of newly generated audit records.