Abstract: To identify objects shared by entities and to, in turn, identify free space in nonvolatile storage, a computer system uses a probabilistic data structure which tests whether an element is a member of a set. Such probabilistic data structures are created for entities in the storage system that share objects. The probabilistic data structure for an entity represents the objects that are used by that entity. When an entity is deleted, each object used by that entity is compared to the probabilistic data structures of other entities to determine if there is a likelihood that the object is used by one or more of the other entities. If the likelihood determined for an object is above an acceptable threshold, then the object is not deleted. If the likelihood determined for an object is below the set threshold, then the object can be deleted and the corresponding storage locations can be marked as free.

Abstract: A computer system supports measuring execution time of concurrent threads. A thread allocates a timing buffer in thread local storage. During execution, the thread also has access to a system timer which it can sample with microsecond or better precision with a single instruction. For any sequence of instructions within the thread for which execution time is to be measured, the sequence of instructions has an identifier and includes two commands, herein called a start command and an end command. The start command samples the system timer to obtain a start time, and stores the identifier and the start time in the timing buffer in the thread local storage. The end command samples the system timer to obtain an end time, and updates the data for the corresponding identifier in the timing buffer, to indicate an elapsed time for execution of the sequence of instructions. The start command and end command each can be implemented as a single executable instruction.

Abstract: To identify objects shared by entities and to, in turn, identify free space in nonvolatile storage, a computer system uses a probabilistic data structure which tests whether an element is a member of a set. Such probabilistic data structures are created for entities in the storage system that share objects. The probabilistic data structure for an entity represents the objects that are used by that entity. When an entity is deleted, each object used by that entity is compared to the probabilistic data structures of other entities to determine if there is a likelihood that the object is used by one or more of the other entities. If the likelihood determined for an object is above an acceptable threshold, then the object is not deleted. If the likelihood determined for an object is below the set threshold, then the object can be deleted and the corresponding storage locations can be marked as free.

Abstract: A database application is provided which includes functionality for providing split views. The database application includes an object model having a number of objects, methods, and properties. The object model preferably includes a form object which includes a split view representation. A number of properties are associated with the split view which provides for the presentation of data to a user of the database application.

Abstract: A database application is provided which includes functionality for providing split views. The database application includes an object model having a number of objects, methods, and properties. The object model preferably includes a form object which includes a split view representation. A number of properties are associated with the split view which provides for the presentation of data to a user of the database application.

Abstract: A database application is provided which includes functionality for providing split views. The database application includes an object model having a number of objects, methods, and properties. The object model preferably includes a form object which includes a split view representation. A number of properties are associated with the split view which provides for the presentation of data to a user of the database application.

Abstract: An embedded macro establishes logic for object properties that define actions that execute when an event triggers. When an embedded macro is associated with an event, a regular event property value is set to an empty string and a shadow property associated with the regular event property is created. An application that supports embedded macros recognizes the empty regular property value as an indicator that a macro is embedded in the event. A binary representation of the macro is accessed from the shadow property and is executed when the event associated with the embedded macro triggers. An action safe list identifies trusted embedded macro actions. Embedded macro actions not included on the safe list are not executed such that untrusted actions are blocked from execution.

Abstract: A database application is provided which includes functionality for providing split views. The database application includes an object model having a number of objects, methods, and properties. The object model preferably includes a form object which includes a split view representation. A number of properties are associated with the split view which provides for the presentation of data to a user of the database application.