Abstract: Techniques for implementing a last known good (LKG) client-side cache for DNS resiliency are disclosed. A first DNS request is submitted to a DNS server. A first DNS resolution that resolves an IP address for a domain name is received. A service stores the first DNS resolution in an LKG cache residing on the local host. A second DNS request is sent, where the second DNS request again requests to resolve the same domain name. In response to determining that a second DNS resolution for the second DNS request has not been received, the service obtains the IP address for the domain name from the LKG cache.

Abstract: Techniques for implementing a last known good (LKG) client-side cache for DNS resiliency are disclosed. A first DNS request is submitted to a DNS server. A first DNS resolution that resolves an IP address for a domain name is received. A service stores the first DNS resolution in an LKG cache residing on the local host. A second DNS request is sent, where the second DNS request again requests to resolve the same domain name. In response to determining that a second DNS resolution for the second DNS request has not been received, the service obtains the IP address for the domain name from the LKG cache.

Abstract: Managing cluster resources for a cluster. The method includes identifying a plurality of quiescence policies. Each of the quiescence policies define one or more conditions for cluster entities which when met, identify that cluster resources should be reclaimed from cluster entities by quiescing cluster entities. The method further includes, for each quiescence policy, identifying an amount of reclaimed capacity defining the amount of cluster resources that will be reclaimed by implementing the quiescence policy. The method further includes, for each quiescence policy, identifying an amount of reserve capacity defining the amount of cluster resources that should be reserved for resuming quiesced cluster entities. The method further includes; selecting a quiescence policy based on comparing the reclaimed capacities and reserve capacities for the quiescence policies. The method further includes, booking cluster resources for cluster entities on the cluster according to the selected quiescence policy.

Abstract: Managing cluster resources for a cluster. The method includes identifying a plurality of quiescence policies. Each of the quiescence policies define one or more conditions for cluster entities which when met, identify that cluster resources should be reclaimed from cluster entities by quiescing cluster entities. The method further includes, for each quiescence policy, identifying an amount of reclaimed capacity defining the amount of cluster resources that will be reclaimed by implementing the quiescence policy. The method further includes, for each quiescence policy, identifying an amount of reserve capacity defining the amount of cluster resources that should be reserved for resuming quiesced cluster entities. The method further includes; selecting a quiescence policy based on comparing the reclaimed capacities and reserve capacities for the quiescence policies.

Abstract: Creating web application using cloud-based friction-free databases without web hosting knowledge. User credentials are received at a web application service for initiating a web application task via client software. The user credentials are analyzed to determine whether to grant the user permission to initiate the requested web application task. The web application task is initiated when the permission is granted. Data associated with the initiated web application task is received at the web application service for analysis of the data to host and render a web application based solely on received data provided without basis of web hosting knowledge.

Abstract: Creating web application using cloud-based friction-free databases without web hosting knowledge. User credentials are received at a web application service for initiating a web application task via client software. The user credentials are analyzed to determine whether to grant the user permission to initiate the requested web application task. The web application task is initiated when the permission is granted. Data associated with the initiated web application task is received at the web application service for analysis of the data to host and render a web application based solely on received data provided without basis of web hosting knowledge.

Abstract: Systems and methods that group atomic scalar values recognized by a database such as columns into sets (e.g., column sets). A grouping component associated with the SQL server creates a logical representation for column groupings, which are accessible by a single I/O and can be co-located (e.g., substantially close or compact) in terms of storage location. Interesting column sets (e.g., non-null) can also be selected for a data representation thereof as a single entity to other applications.

Abstract: Architecture that maps document data (e.g., XML-extended markup language) into columns of one table, thereby avoiding schema normalization problems through special data storage. Moreover, an algorithm is described that can translate a query (e.g., in XPath (XML path language), a query language for navigating through document elements and attributes of an XML document) into a relational algebra query of the document column representation. Based on the characteristics of the new mapping, query rewriting rules are provided that optimize the relational algebra query by minimizing the number of joins. The mapping of XML documents to the table is based on a summary structure and a hierarchical labeling scheme (e.g., ordpath) to enable a high-fidelity representation. Annotations are employed on the summary structure nodes to assist in mapping XML elements and attributes to the table.

Abstract: Systems and methods that group atomic scalar values recognized by a database such as columns into sets (e.g., column sets). A grouping component associated with the SQL server creates a logical representation for column groupings, which are accessible by a single I/O and can be co-located (e.g., substantially close or compact) in terms of storage location. Interesting column sets (e.g., non-null) can also be selected for a data representation thereof as a single entity to other applications.