Abstract: Cross-service usage is dynamically enforced for different network-based services. A cross-service control system may accept requests to specify a usage quota for a client for an interface of a network-based service. A rule to enforce the usage quota may be distributed to request handling nodes for the service. Usage measurements may be collected from the request handling nodes for requests received from the client via the interface. An update to the usage quota may be determined from an evaluation of the usage measurements. The rule at the request handling nodes may be updated to enforce the updated usage quota.

Abstract: The disclosed technology is generally directed to code transparency. In one example of the technology, raw input data that includes version information that is associated with code is received. The version information includes pull requests associated with the code. Extracted key phrases are provided by performing a key-phrase extraction on the raw input data. A list of documents and a list of people are determined based at least in part on the extracted key phrases. A relevance ranking is performed on the list of documents and the list of people. Based on the relevance ranking, relevant documents and relevant people are determined, such that the relevant documents and the relevant people are relevant to the code. To a developer environment that is associated with the code, information associated with the relevant documents and/or the relevant people is provided.

Abstract: The current document is directed to methods and systems that efficiently distribute virtual-machine images (“VM images”) among servers within large, distributed-computer-system-implemented IAAS platforms to facilitate temporally and computationally efficient instantiation of virtual machines within the servers. In implementations discussed below, VM images are stored in a distributed fashion throughout one or more distributed computing systems, using several different VM-image-distribution models, in order to balance computational-resource usage, temporal constraints, and other factors and considerations related to VM-image distribution and VM instantiation.

Abstract: The current document is directed to methods and systems that efficiently distribute virtual-machine images (“VM images”) among servers within large, distributed-computer-system-implemented IAAS platforms to facilitate temporally and computationally efficient instantiation of virtual machines within the servers. In implementations discussed below, VM images are stored in a distributed fashion throughout one or more distributed computing systems, using several different VM-image-distribution models, in order to balance computational-resource usage, temporal constraints, and other factors and considerations related to VM-image distribution and VM instantiation.

Abstract: Runtime code hooking techniques are described in which a place holder instruction within a compiled module is used as an entry point to enable code hooking. A hook function to modify a target function is developed. At runtime, the target function to be modified is located. A place holder instruction within the target function is overwritten with instructions to cause execution of the hook function when the target function is called.

Abstract: Runtime code hooking techniques are described in which a place holder instruction within a compiled module is used as an entry point to enable code hooking. A hook function to modify a target function is developed. At runtime, the target function to be modified is located. A place holder instruction within the target function is overwritten with instructions to cause execution of the hook function when the target function is called.

Abstract: A system and method determines correlations within multi-tier communications based on repeated iterations/episodes of executions of a target application. Content-based correlations are determined by encoding the content using a finite alphabet, then searching for similar sequences among the multiple traces. By encoding the content to a finite alphabet, common pattern matching techniques may be used, including, for example, DNA alignment algorithms. To facilitate alignment of the traces, structural and/or semantic breakpoints are defined, and the encoding in each trace is synchronized to these breakpoints. To facilitate efficient processing, a hierarchy of causality among tier-pairs is identified, and messages at lower levels are ranked and temporally filtered, based on activity intervals at higher levels of the hierarchy.

Abstract: Runtime code hooking techniques are described in which a place holder instruction within a compiled module is used as an entry point to enable code hooking. A hook function to modify a target function is developed. At runtime, the target function to be modified is located. A place holder instruction within the target function is overwritten with instructions to cause execution of the hook function when the target function is called.

Abstract: A system and method determines correlations within multi-tier communications based on repeated iterations/episodes of executions of a target application. Content-based correlations are determined by encoding the content using a finite alphabet, then searching for similar sequences among the multiple traces. By encoding the content to a finite alphabet, common pattern matching techniques may be used, including, for example, DNA alignment algorithms. To facilitate alignment of the traces, structural and/or semantic breakpoints are defined, and the encoding in each trace is synchronized to these breakpoints. To facilitate efficient processing, a hierarchy of causality among tier-pairs is identified, and messages at lower levels are ranked and temporally filtered, based on activity intervals at higher levels of the hierarchy.

Abstract: A system and method determines correlations within multi-tier communications based on repeated iterations/episodes of executions of a target application. Content-based correlations are determined by encoding the content using a finite alphabet, then searching for similar sequences among the multiple traces. By encoding the content to a finite alphabet, common pattern matching techniques may be used, including, for example, DNA alignment algorithms. To facilitate alignment of the traces, structural and/or semantic breakpoints are defined, and the encoding in each trace is synchronized to these breakpoints. To facilitate efficient processing, a hierarchy of causality among tier-pairs is identified, and messages at lower levels are ranked and temporally filtered, based on activity intervals at higher levels of the hierarchy.

Abstract: A method and system is described herein for populating an object tree with data obtained from a relational data store. One query is issued to retrieve data for each object in a given level of the object tree. The data is stored in a table in an order, which corresponds to an order in which the objects of the object tree will be initialized. The data is read from the table in the order, and the corresponding object in the tree is initialized.

Abstract: A method of generating commands for a database server includes accessing a script having parser-specific commands, a first set of database-specific commands and optional shell commands. A componentized batch parser splits out the different command types and converts the parser-specific commands into a second set of database-specific commands. The first set and second set of database-specific commands may be sent to a target database for execution. The optional shell commands may be executed by a user tool at a local console. The batch parser offers features including separation of parsing functions using batch separators, performing automatic substitution of tokens in the script with defined values or substitution of tokens by requesting token values via a client tool, stripping off comments and blanks spaces from processed commands, referencing and editing files outside the script, and the ability to connect to different servers.

Abstract: A method for uniform metadata retrieval generates an interface for requesting metadata from a relational database. A hierarchical metadata request can be received via the interface. The hierarchical metadata request can be translated into a relational database metadata request. The relational database metadata request is utilized to retrieve metadata from the relational database.

Abstract: Runtime code hooking techniques are described in which a place holder instruction within a compiled module is used as an entry point to enable code hooking. A hook function to modify a target function is developed. At runtime, the target function to be modified is located. A place holder instruction within the target function is overwritten with instructions to cause execution of the hook function when the target function is called.

Abstract: A method for uniform metadata retrieval generates an interface for requesting metadata from a relational database. A hierarchical metadata request can be received via the interface. The hierarchical metadata request can be translated into a relational database metadata request. The relational database metadata request is utilized to retrieve metadata from the relational database.

Abstract: A method and system for flow propagation analysis uses ‘tracers’ that are iteratively propagated through a simulated network between source and destination elements. These tracers are structured to contain traffic flow information from source to destination, and to reflect changes as the flow is affected by each element along the path from source to destination. The resultant flow information at the destination corresponds to the effective throughput from the source to the destination, and the flow information at the output of each intermediate element in the network corresponds to the potentially achievable throughput through that element for the given source-to-destination flow.

Abstract: A method of generating commands for a database server includes accessing a script having parser-specific commands, a first set of database-specific commands and optional shell commands. A componentized batch parser splits out the different command types and converts the parser-specific commands into a second set of database-specific commands. The first set and second set of database-specific commands may be sent to a target database for execution. The optional shell commands may be executed by a user tool at a local console. The batch parser offers features including separation of parsing functions using batch separators, performing automatic substitution of tokens in the script with defined values or substitution of tokens by requesting token values via a client tool, stripping off comments and blanks spaces from processed commands, referencing and editing files outside the script, and the ability to connect to different servers.

Abstract: A method and system is described herein for populating an object tree with data obtained from a relational data store. One query is issued to retrieve data for each object in a given level of the object tree. The data is stored in a table in an order, which corresponds to an order in which the objects of the object tree will be initialized. The data is read from the table in the order, and the corresponding object in the tree is initialized.

Abstract: A first query may be generated at a client computing device. The first query is written in a uniform format that is not unique to a particular object. The first query is submitted to a query translation system, which translates the first query to a request for information that is formatted for processing on a first object associated with a first class of objects in a hierarchy of objects. The request is submitted to the first object for execution at the first object. Results of the request may be returned back to the client.

Abstract: A method and system for flow propagation analysis uses ‘tracers’ that are iteratively propagated through a simulated network between source and destination elements. These tracers are structured to contain traffic flow information from source to destination, and to reflect changes as the flow is affected by each element along the path from source to destination. The resultant flow information at the destination corresponds to the effective throughput from the source to the destination, and the flow information at the output of each intermediate element in the network corresponds to the potentially achievable throughput through that element for the given source-to-destination flow.