Abstract: Systems and methods are presented for auto-starting and auto-stopping databases in a cloud server environment. In some embodiments, a method includes accessing, by an initial server in a network-based system, a request to connect to a target database located in a target server of the network-based system. The method can include determining, by an administrative database residing in the initial server, a location of the target database residing in the target server, switching an execution context from no database in the target server to a copy of the administrative database in the target server, performing an auto-start procedure to auto-start the target database in the target server, switching the execution context from the administrative database in the target server to the target database in the target server, and transmitting a completion acknowledgement indicating the target server is connected to the target database.

Abstract: A method and system for transforming a serial schedule of transactions into a parallel schedule of transaction is disclosed. In one example, a computer system stores a list of data transactions in a transaction log. The computer system then reads a respective data transaction from the transaction log. The computer system determines whether the respective data transaction is dependent on any other currently pending data transaction. In accordance with a determination that the respective data transaction is not dependent on any other currently pending data transaction, the computer system applies the data changes to a reconstructed data set. In accordance with a determination that the respective data transaction is dependent on a currently pending second data transaction, the computer system delays commitment of the respective data transaction until the second data transaction has been applied to the reconstructed data set.

Abstract: Systems and methods are presented for load balancing databases in a cloud server environment. In some embodiments, a method can include accessing, by a server in a network-based system, one or more system configuration parameters of the network-based system, with the one or more system configuration parameters defining one or more performance capabilities of the network-based system. The method may also include accessing performance characteristics of a query of a queried database; generating a quadtree decomposition, with the quadtree decomposition modeling a cost estimate of the database query as a function of a range of the performance capabilities of the one or more system configuration parameters; and generating a proposed packing of databases based on the modeled cost estimate of the query including the queried database and defining a configuration of a plurality of databases to be stored in the server.

Abstract: Systems and methods are presented for load balancing databases in a cloud server environment. In some embodiments, a method can include accessing, by a server in a network-based system, one or more system configuration parameters of the network-based system, with the one or more system configuration parameters defining one or more performance capabilities of the network-based system. The method may also include accessing performance characteristics of a query of a queried database; generating a quadtree decomposition, with the quadtree decomposition modeling a cost estimate of the database query as a function of a range of the performance capabilities of the one or more system configuration parameters; and generating a proposed packing of databases based on the modeled cost estimate of the query including the queried database and defining a configuration of a plurality of databases to be stored in the server.

Abstract: A method and system for transforming a serial schedule of transactions into a parallel schedule of transaction is disclosed. In one example, a computer system stores a list of data transactions in a transaction log. The computer system then reads a respective data transaction from the transaction log. The computer system determines whether the respective data transaction is dependent on any other currently pending data transaction. In accordance with a determination that the respective data transaction is not dependent on any other currently pending data transaction, the computer system applies the data changes to a reconstructed data set. In accordance with a determination that the respective data transaction is dependent on a currently pending second data transaction, the computer system delays commitment of the respective data transaction until the second data transaction has been applied to the reconstructed data set.

Abstract: Systems and methods are presented for auto-starting and auto-stopping databases in a cloud server environment. In some embodiments, a method can include accessing, by an initial server in a network-based system, a request to connect to a target database located in a target server of the network-based system. The method can also include determining, by an administrative database (admin database) residing in the initial server, a location of the target database residing in the target server, switching an execution context from no database in the target server to a copy of the admin database in the target server, performing an auto-start procedure to auto-start the target database in the target server, switching the execution context from the admin database in the target server to the target database in the target server, and transmitting a completion acknowledgement indicating the target server is connected to the target DB.

Abstract: Approaches for indexing and retrieving spatial data with a quadtree index in database management systems are described. In an embodiment, data objects are stored without decomposition within a linearized quadtree stored within a B-tree index. In another embodiment, a method determines an optimal execution plan for a spatial query by parsing it to determine a query type and geometry object associated with the query. The method tessellates the query object by recursively decomposing the quadtree blocks that cover it. Cost-based decomposition decisions are made by consulting a cost model furnished by the database management system to minimize the cost of the resulting index range plan on the B-tree storage. Thus, data-directed query decomposition enacted by the method results in the optimal cost index range plan for the current data distribution and system context. In another embodiment, a system identifies and displays an optimal index range plan in a user interface.

Abstract: Approaches for indexing and retrieving spatial data with a quadtree index in database management systems are described. In an embodiment, data objects are stored without decomposition within a linearized quadtree stored within a B-tree index. In another embodiment, a method determines an optimal execution plan for a spatial query by parsing it to determine a query type and geometry object associated with the query. The method tessellates the query object by recursively decomposing the quadtree blocks that cover it. Cost-based decomposition decisions are made by consulting a cost model furnished by the database management system to minimize the cost of the resulting index range plan on the B-tree storage. Thus, data-directed query decomposition enacted by the method results in the optimal cost index range plan for the current data distribution and system context. In another embodiment, a system identifies and displays an optimal index range plan in a user interface.

Abstract: A hybrid approach for evaluating expressions in database management systems is described herein. For each expression in an execution location (XL), an execution strategy is selected. The strategies considered are lazy, lazy with memoization, eager, and eager with memoization. The execution strategies are assigned in a way that minimizes the estimated cost of evaluation.

Abstract: A hybrid approach for evaluating expressions in database management systems is described herein. For each expression in an execution location (XL), an execution strategy is selected. The strategies considered are lazy, lazy with memoization, eager, and eager with memoization. The execution strategies are assigned in a way that minimizes the estimated cost of evaluation.

Abstract: A visual development environment is described which provides drag-and-drop code editing methodology, using Reference Card and Parameter Wizard methodologies. A Reference Card provides quick information on the most important classes and member functions, within one's code. During a session, the user may use the Reference Card to select an action that the user wants to perform. The user can search through a hierarchy of actions or perform a text search to locate the desired action, then open the Parameter Wizard to create the code (e.g., C++ code) required to perform that action. The Reference Card also provides help on all the items listed. The Parameter Wizard, which operates in conjunction with the Reference Card, guides the user through the construction of function calls. This is particularly useful for complicated functions or for functions with which the user is unfamiliar. The Parameter Wizard helps the user construct a function call by showing what argument values are required.