Abstract: Techniques for architected data transfer are described. A controller maintains a network information database representing overarching knowledge of the network, such as the underlying communication infrastructure, resource consumption limits, and segment locations. The controller uses the information stored in the network information database to direct transmitters to transfer data segments to receivers in a manner that ensures relatively predictable resource consumption. In one approach, the controller receives a request to transfer data to a receiver. The controller, based on the information contained in the network information database, computes an optimal set of transmitters to participate in the transfer. The controller sends each transmitter in the optimal set an instruction assigning that transmitter to transfer one or more segments of the data to the receiver. Each transmitter, upon receiving the instructions, sends their respectively assigned data segments to the receiver.

Abstract: Techniques for architected data transfer are described. A controller maintains a network information database representing overarching knowledge of the network, such as the underlying communication infrastructure, resource consumption limits, and segment locations. The controller uses the information stored in the network information database to direct transmitters to transfer data segments to receivers in a manner that ensures relatively predictable resource consumption. In one approach, the controller receives a request to transfer data to a receiver. The controller, based on the information contained in the network information database, computes an optimal set of transmitters to participate in the transfer. The controller sends each transmitter in the optimal set an instruction assigning that transmitter to transfer one or more segments of the data to the receiver. Each transmitter, upon receiving the instructions, sends their respectively assigned data segments to the receiver.

Abstract: Techniques for architected data transfer are described. A controller maintains a network information database representing overarching knowledge of the network, such as the underlying communication infrastructure, resource consumption limits, and segment locations. The controller uses the information stored in the network information database to direct transmitters to transfer data segments to receivers in a manner that ensures relatively predictable resource consumption. In one approach, the controller receives a request to transfer data to a receiver. The controller, based on the information contained in the network information database, computes an optimal set of transmitters to participate in the transfer. The controller sends each transmitter in the optimal set an instruction assigning that transmitter to transfer one or more segments of the data to the receiver. Each transmitter, upon receiving the instructions, sends their respectively assigned data segments to the receiver.

Abstract: Techniques for architected data transfer are described. A controller maintains a network information database representing overarching knowledge of the network, such as the underlying communication infrastructure, resource consumption limits, and segment locations. The controller uses the information stored in the network information database to direct transmitters to transfer data segments to receivers in a manner that ensures relatively predictable resource consumption. In one approach, the controller receives a request to transfer data to a receiver. The controller, based on the information contained in the network information database, computes an optimal set of transmitters to participate in the transfer. The controller sends each transmitter in the optimal set an instruction assigning that transmitter to transfer one or more segments of the data to the receiver. Each transmitter, upon receiving the instructions, sends their respectively assigned data segments to the receiver.

Abstract: A method and system are provided for determining whether a given path is an indexed path of XML documents stored in a database management system. A finite state machine is built using the path subsetting rules specified by a user. The finite state machine is traversed using the given path. If any accepting states are reached during the traversal of the finite state machine, the given path is determined to matching the path subsetting rules.

Abstract: A method and system are provided for determining whether a given path is an indexed path of XML documents stored in a database management system. A finite state machine is built using the path subsetting rules specified by a user. The finite state machine is traversed using the given path. If any accepting states are reached during the traversal of the finite state machine, the given path is determined to matching the path subsetting rules.

Abstract: Disclosed is a method and mechanism for accessing XML data. In one approach, in the case of a schema based document, the structure of the XML document is known apriori and this information can be exploited to store and retrieve the data more efficiently. A Named Access interface or procedure can be defined and associated with elements of the schema. The need for datatype conversions can be eliminated by allowing direct mapping to the intended datatype or the closest matching datatype in the system to which the invention is directed. The storage information can be exploited to provide “direct” access to data based on offset in lieu of a linear traversal. Another aspect is that only the relevant portions need to be even loaded into memory.