Abstract: Techniques for transferring a serialized image of data for an XML construct includes selecting a first format from multiple different XML serialization formats that represent, in a database system, data for XML constructs as a series of data units, such as a series of bytes representing characters, or a series of bits, bytes or octets representing binary values. A message is generated that includes a payload and a payload type field. The payload includes particular serialized data that represents particular data for a particular XML construct in the first format. The type field includes data that indicates the first format. The message is sent from a sending component of the database system to a different receiving component of the database system. These techniques allow the format selection to be based on characteristics of the sending or receiving components to make better use of the resources available to the two components.

Abstract: Techniques for providing sets of network addresses for dynamically configuring hosts on a network include sending to a first server a first request for a first count of network addresses in a first set of network addresses. A first message indicating the first set of network addresses is received. A second message is received from a second server that requests a second count of network addresses for a second set of network addresses. The second set of network addresses is determined based at least in part on the first set of network addresses and the second count. In response to the second message, a first response indicating the second set is sent to the second server. The techniques allow an administrator to enter available subnets at any DHCP server. The DHCP servers using these techniques then automatically apportion subnets among each other based on the relative usage of the subnets.

Abstract: A linear node includes a begin option-node that has a direct link to an end option node. The begin option node has a single entry, and also includes a list of links with each entry in the list being a link to one of a plurality of parallel branches. Each of the plurality of branches represents one possible value of a command element of the configuration command. Each branch is connected back to the begin option node through a next option node. During parsing of a command, each command element is represented by a different linear node. Also, during parsing of the command, a linear command regeneration template is generated that includes a begin option node template, a next option node template, and an end option node template. The linear command regeneration template is used to recreate the original command using data in a system configuration database.

Abstract: Techniques for managing changes in a computer system include storing, in a storage space, undo information for removing changes that are being made by entities. The undo information for each entity is stored in a segment of multiple segments within the storage space. Usage of the storage space by the entities is monitored. The number of segments in the plurality of segments or the sizes of the plurality of segments or both are adjusted automatically based on the usage. These techniques allow a resource to be recycled and allocated for new uses by other entities in a computer system dynamically based on usage. These techniques do not burden a human administrator with partitioning the resource and then penalize the administrator and users by generating errors when the partitions do not match usage.

Abstract: A programmatic interface to allow external functions to be registered and called in parallel from within a database management system is described for coordinating a computation at multiple nodes. In one embodiment, each node executes a process configured for starting a program to perform the computation in response to a command received from a database system. In response to receiving a query at the database system, multiple commands are transmitted to the processes for concurrently performing the computation at each said corresponding process. Results are received from each of the processes and execution of the statement is completed based on the results received.

Abstract: A method and apparatus for accessing information using indexes on versioned tables is described that exploits the power of partitioned indexing to index versioned data. In partitioned indexing, an index is divided in sub-indexes, referred to as index partitions. An index may be, for example, partitioned according to a particular version identified by a version id, that is, each index partition indexes the rows in a versioned table that belong to the version identified by a particular version id. Partitioned indexes can be more efficient to use to access versioned data. The utility of partitioned indexes extends beyond indexing versioned data.

Abstract: A method for providing self-provisioning of VoIP telephony to a subscriber of a VoIP telephony service is disclosed. An un-provisioned residential gateway that is associated with the subscriber is instructed to collect a subscriber numeric identity that uniquely identifies the subscriber and a Personal Identification Number (PIN) information that are associated with the subscriber. An example of a subscriber numeric identity that uniquely identifies the subscriber is the subscriber's E.164 address. The E.164 address and Personal Identification Number (PIN) information is verified. A source IP address that is associated with one or more Media Gateway Control Protocol (MGCP) messages that are sent by the residential gateway is used as a residential gateway IP address for the residential gateway. The residential gateway IP address is then used to provision the residential gateway that is associated with the subscriber.

Abstract: A method of routing data from a client through one or more load-balancing routers to a selected load-balanced server among a plurality of servers in a network involves: receiving, at a load balancing node in a path from the client to the plurality of servers, a first packet of a request from a client; creating and storing a mapping of flow identifying information, associated with the first packet, to a client stickiness identifier; pushing the client stickiness label into a sending path list that is stored in association with the first packet; storing the client stickiness label in a mapping of client stickiness labels to server identifiers at a last load balancing node associated with the plurality of servers, wherein the mapping associates the client stickiness label with a server identifier that uniquely identifies a selected server that has been selected from among the plurality of servers to receive the client request; and forwarding all subsequent packets associated with the client request to the same s

Abstract: A mechanism for reformatting a simple source code statement into a compound source code statement is provided. Tokens are identified in unformatted source code, which contains simple statements. A syntax tree is created from the identified tokens. The syntax tree is used to identify one or more simple statements. In processing a particular simple statement, potential statements are identified in the particular simple statement. A tree of blocks, which identifies block levels, is created from the potential statements. An intermediate textual representation is created where each of the potential statements is on a different line. Indentation levels, which correspond to the block levels in the tree of blocks, are associated with each of the potential statements. Formatted source code is created by inserting begin and end block indicators into the intermediate textual representation.

Abstract: A method and apparatus for generating a description of a configuration of a network that includes a plurality of devices is disclosed. Input is received that specifies the resource devices for the network. The input values are processed with a set of data according to one or more rules to determine the plurality of devices for the network, which includes one or more control devices and may include a set of storage equipment. The plurality of devices is determined without using a set of predetermined descriptions for the devices to be included in the network. An additional value that changes one or more of the input values is received, and in response to the receipt of the additional value, the plurality of devices for the network is modified. The modification is made without requiring additional input. Based on the modified plurality of devices, the description of the network is generated.

Abstract: A method and apparatus for operating a database system is provided. One or more partitions are identified from a data structure in the database system. An identifier is assigned to at least one of the partitions. An external partition is identified that is not one of the partitions that form the data structure. An identifier is determined for the external partition. The first partition is removed from the data structure by exchanging the identifier of the external partition with the identifier of the first partition in the set of partitions.

Abstract: A mechanism is disclosed for enabling efficient testing of a set of computer code. Untested code portions within a body of code are determined, and testing priorities are assigned to untested code portions according to how frequently the untested code portions are likely to be invoked during normal operation. More frequently invoked untested code portions are ranked higher than less frequently invoked untested code portions. The prioritized data may be used by a testing team to determine which additional tests should be created for effective and efficient testing of the body of code.

Abstract: Techniques for making a replica of a particular group of database objects of a database on a particular node that does not initially have the particular group of database objects include transferring description data from a first node to the particular node during a first time period. The description data describes the particular group of database objects at a first time. The first time period begins at the first time and ends at a second time. During the first time period, a request from a user of the database to perform an operation involving particular data in the particular group of database objects is processed.

Abstract: A method is disclosed for creating a network topograph that includes all select objects that are in a network. A set of one or more non-select objects in the network is determined. A network topograph is created. Each select object in the network is included in the network topograph. Elements of the set are collectively represented as a single non-select object.

Abstract: Methods are provided for efficiently evaluating database queries including multiple rollup operators. With the computation of grouping identifiers to distinguish grouping levels of each rollup operator, evaluation of database queries that include concatenation of rollup operators includes nesting of the rollup operators and includes the grouping identifiers as sorting keys for subsequent processing. Furthermore, to optimize the query evaluation process, the order in which the rollup operators are computed can be determined based on cardinalities that estimate the number of records generated by each rollup operator, and parallel evaluation can be utilized by partitioning data records between rollup operator processing stages based on the grouping keys associated with the rollup operators that are not being processed at the next stage.

Abstract: A database system that incorporates numerous features that reduce the total cost of maintaining the database system is provided. That database system includes a database appliance that executes a database server on a platform that includes a special purpose operating system specifically tailored to the services required by the database server. The database appliance configures itself by detecting the environment in which it resides and setting operational parameters based on the detected environment. The configuration metadata of all components of the system are stored in a centralized repository which itself may reside external to the system. Both the database server configuration and the operating system configuration are managed by a remotely located integrated management console, which interacts with and configures the system at the database system level, the operating system level and, optionally, at the hardware subsystem level. Backup management may also be performed remotely.

Abstract: A manner of resolving printer driver incompatibility problems is described. If configuration data indicates that an incompatibility between an application program and a printer driver is to be corrected, then print data is received from a printer driver, wherein the print data reflects the incompatibility between the application program used to create the print data and the printer driver. Next, updated print data is generated that corrects the incompatibility between an application program and the printer driver. Thereafter, the updated print data is sent to the printer. The electronic document is printable by the print such that the printed copy does not reflect the incompatibility between an application program and a printer driver.

Abstract: A mechanism is disclosed for recognizing and functionally abstracting a column of memory cells. According to one embodiment, a column of n (where n is an integer greater than 1) memory cells is identified in a description of a circuit. One of the n memory cells is selected as a representative memory cell. Then, the column of n memory cells is represented as a single-memory-cell column comprising the representative memory cell. The column is thereafter functionally abstracted to derive a logic-level representation of the memory cell. After that is done, n?1 additional instances of the logic-level representation are generated. In this manner, the column of n memory cells is functionally abstracted as a column of n logic-level representations of the representative memory cell.

Abstract: Provided herein is a mechanism that allows a given database system to access data blocks from another database system, where data blocks from the given database system and data blocks from the other database system have different sizes. According to an aspect of the present invention, a tablespace in the other database system contained the data blocks. The tablespace is detached from the other database system and integrated into the given database, which is capable of processing data stored in data blocks of a different sizes.

Abstract: Fragile native compilation of virtual machine code is described, in which a native code optimizer inspects external code entities such as Java base classes and emits target code based on an inter-procedural analysis of the code and data structure invariants and other properties of the external code entity. The fragile compiler also records which properties of the external code entities were used to produce the optimized code in a “fragile set”, so that the virtual machine at which the compiled code is deployed and executed can detect if the recorded properties of the external code entities are compatible with the properties of the corresponding entities on the deployment virtual machine. If the code entities are incompatible, the compiled native code is rejected and the virtual machine reverts to interpreting the virtual machine code.