Abstract: A method of binding elements of a structured document to an observer structure includes obtaining the logical structure of a document. Nodes representing information contained in the document are mapped to an observer structure which can include both a user interface or a programming object. The user interface may be a graphical user interface including a display form of a grid-like structure to contain the structured document information. The data binding which maps the structured document information to the observer form may be directionally controllable such that any change made to the information at the observer may be reflected in the source structured document.

Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects through the use of delete marker objects. In response to a delete operation specifying a key, but not a version identifier, the storage system may create a delete marker object that is stored as the latest object version of the key. In response to performing a subsequent mutating operation, or at pre-determined time intervals, the storage system may perform a local and/or a global analysis of the delete marker objects stored in the system (and/or metadata associated with those delete marker objects) to determine whether any of them are no longer needed to ensure correct operation of the system. The analysis may apply one or more reap conditions to delete marker objects and/or metadata to identify extraneous delete marker objects, removing those that meet one or more reap conditions from storage.

Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.

Abstract: Embodiments of system and method for performing object-modifying commands in an unstructured storage service are described. Embodiments may include utilizing one or more nodes to implement an unstructured storage service including a service interface configured to service data storage requests and data retrieval requests from remote clients. The unstructured storage service is configured to isolate access to each of multiple storage domains of the service to different clients. Embodiments may also include receiving from a given remote client, a request to store a data object to a given storage domain of the service. The request further specifying a command to modify source data for the object prior to storing the object. Embodiments may also include using the unstructured storage service to perform the command without exporting the source data from the unstructured storage service to the given remote client prior to completion of the command.

Abstract: Systems and methods providing a versioning feature in a storage system may allow the versioning feature to be toggled on and/or off during operation. Access operations targeting data objects stored in the system (e.g., delete and store type operations) may behave differently depending on whether versioning is (or has ever been) enabled for the storage system or a storage bucket thereof, or is not (or has never been) enabled for the storage system or storage bucket. For example, if versioning is off or suspended, a store operation may overwrite existing data. However, if versioning is enabled, a store type operation may create and store a new, unique object. If versioning has never been enabled, a delete operation may delete a stored object. However, if versioning has ever been enabled, a delete operation may create a new, unique delete marker object and may or may not delete any objects or data.

Abstract: A distributed storage system may store data object instances in persistent storage and may cache keymap information for those data object instances. The system may cache a latest symbolic key entry for some user keys of the data object instances. When a request is made for the latest version of stored data object instances having a specified user key, the latest version may be determined dependent on whether a latest symbolic key entry exists for the specified user key, and keymap information for the latest version may be returned. When storing keymap information, a flag may be set to indicate that a corresponding latest symbolic key entry should be updated. The system may delete a latest symbolic key entry for a particular user key from the cache in response to determining that no other requests involving the keymap information for data object instances having the particular user key are pending.

Abstract: Systems and methods that provide versioning in a storage system may automatically determine the latest version of a stored object when a version identifier is not specified for an access operation. For example, retrieve type operations may behave differently when they specify a version identifier than when they do not. The system may determine and fill in the version identifier of the latest stored version of an object having a specified key for a retrieve type operation if a version identifier is not specified. Key map elements representing each object stored in the system may include an indication of the time at which the object was created or modified. The latest version of an object may be ascertained by locating the first element among ordered elements in the key map with the specified user key, or an adjacent element with the specified key that has a more recent creation/modification date.

Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.

Abstract: Methods, apparatuses, and articles for exchanging by a first computing device with a second computing device indicia of one or more interfacing definitions supported by at least one of the first computing device and the second computing device are described herein. In various embodiments, the first computing device may also facilitate communication with the second computing device based at least in part on said exchanging and on one or more priority rules. In some embodiments, the indications of the interfacing definitions may include a unique identifier for each interfacing definition. Other embodiments are also disclosed and described.

Abstract: Methods, apparatuses, and articles for exchanging by a first computing device with a second computing device indicia of one or more interfacing definitions supported by at least one of the first computing device and the second computing device are described herein. In various embodiments, the first computing device may also facilitate communication with the second computing device based at least in part on said exchanging and on one or more priority rules. In some embodiments, the indications of the interfacing definitions may include a unique identifier for each interfacing definition. Other embodiments are also disclosed and described.

Abstract: An XML digital signature standard is applied to an XML document to sign it. The XML digital signature is an XML fragment with a specified schema that includes (a) data to describe how the signature should be calculated (e.g., digest methods, filters, and data sources) and (b) actual signature data (e.g., digests and signature values). The data describing how the signature should be calculated (i.e., the “group (a)” data) is placed inside an XML digital signature template, which is then used (e.g., by an API (application programming interface)) to create the actual digital signature containing the “group (b)” data.

Abstract: An XML digital signature standard is applied to an XML document to sign it. The XML digital signature is an XML fragment with a specified schema that includes (a) data to describe how the signature should be calculated (e.g., digest methods, filters, and data sources) and (b) actual signature data (e.g., digests and signature values). The data describing how the signature should be calculated (i.e., the “group (a)” data) is placed inside an XML digital signature template, which is then used (e.g., by an API (application programming interface)) to create the actual digital signature containing the “group (b)” data.