Abstract: Techniques are provided for providing a data item to a transaction in a multi-versioning system in which the data item may exist on multiple versions of a data block, and were versioning is performed at the granularity of the data block. According to one aspect of the invention, the technique involves locating, within volatile memory, a first version of a data block that includes a first version of the data item. It is then determined whether the first version of the data item is useable by the transaction without respect to whether the first version of the data block is generally useable by the transaction. If the first version of the data item is usable by the transaction, then the data item is established as a candidate that can be provided to the transaction. Thus, the data item within a block may be considered a candidate to be provided to a transaction even when the version of the data block on which the data item resides would otherwise disqualify the data block from being seen by that transaction.

Abstract: A method of regenerating a network device configuration command based on configuration data stored in the network device is provided. The configuration data is created as a result of parsing and processing of the configuration command. The command comprises at least one command element that can have a plurality of values. At least one linear node is created and stored in a parse tree for representing said at least one command element. The linear node comprises a begin option node having a single entrance; a next option node coupled to the begin option node; and an end option node coupled to the begin option node. The end option node has a single exit. A linear command regeneration template is created and stored in a memory. The linear command regeneration template comprises information identifying how to regenerate a command. The command is then regenerated based on the linear command regeneration template and based on data from a database.

Abstract: Techniques are provided for increasing the degree of parallelism without incurring overhead costs associated with inter-nodal communication for performing parallel operations. One aspect of the invention is to distribute-phase partition-pairs of a parallel partition-wise operation on a pair of objects among the nodes of a database system. The -phase partition-pairs that are distributed to each node are further partitioned to form a new set of-phase partition-pairs. One -phase partition-pair from the set of new-phase partition-pairs is assigned to each slave process that is on a given node. In addition, a target object may be partitioned by applying an appropriate hash function to the tuples of the target object. The parallel operation is performed by broadcasting each tuple from a source table only to the group of slave processes that is working on the static partition to which the tuple is mapped.

Abstract: A method and apparatus that provide for determining a multilayer switching path are disclosed. In one embodiment of the invention, a Layer 3 path and a Layer 2 path between a source device and destination device are first determined in order to identify the relevant switch engines that perform the multilayer switching. Determining whether the switch engines satisfy a set of criteria identifies the relevant switch engines.

Abstract: A method and apparatus for providing a network based operating system for mobile clients is disclosed. Services may be developed that can be used to support different client devices with different capabilities. The services provide output with multiple variations based on different devices, and an intermediary selects the variation best suited for the requesting device. An online software development system is provided to allow services to create, edit, test, and deploy applications at an intermediary using only a browser at the client end. Services may also be provided that can be accessed and referred to by other services, thereby facilitating the combining of different services. Services may also store and access data at an intermediary using variables and a mapping of the stored data to the variables. Data stored at the intermediary may be used to allow an end user to return to a previously accessed service.

Abstract: A mechanism for establishing a plurality of sessions between a client and a first server based on a single input of user authenticating information is disclosed. A request to establish a connection between the client and the first server is received. The request includes identification information for authenticating a requesting user. Based on the identification information, a determination is made as to whether the connection between the client and the first server should be established. If it is determined that the connection between the client and the first server should be established, the identification information is cached in memory and the connection between the client and the first server is allowed to be established. Subsequent connection requests from the same client are authenticated, and further connections can be established, based on the cached identification information, without further input from the client or user.

Abstract: Techniques for servicing requests for database services include maintaining at a database server an available set of one or more database session data structures. Each database session data structure holds information to support one session of one or more requests for database services over a communication connection that persists for one or more communications from one client. A database session data structure in the available set is not associated with any client currently connected to the database server. These techniques allow a database server to more efficiently service more numerous requests for database services, such as generated by communications using a stateless protocol like HTTP.

Abstract: Techniques for managing multiple hierarchies of data from a single native hierarchy include registering a set of routines for each foreign hierarchy. The set of routines performs a set of operations on data in the hierarchy associated with a node. A user request is received, which indicates a particular operation on particular data that does not correspond to a node of the native hierarchy. Based on the user request, a first operation on a first set of one or more nodes of a first hierarchy that is not the native hierarchy is determined. A particular routine that corresponds to the first operation is selected from a first set of routines registered for the first hierarchy, and is invoked. These techniques allow a user to employ a consistent interface with the native hierarchy to reach data in any of the hierarchies.

Abstract: A method and apparatus for controlling use of a network resource. A network administrator accesses and navigates one or more network resources. A navigation capture server captures each request that is generated by the administrator's browser and each response that is received, and stores information about the requests and responses. The navigation capture server analyzes the captured information and generates an access/navigation script that represents the navigation actions taken by the administrator in the session. The script is edited and generalized in a manner such that upon playback of the script, the user may input actual useful information and the system may capture specific response data. When the client accesses and navigates the Web applications, context-specific information, relating to the client's then-current request, is passed from the User View Server to the navigation capture server.

Abstract: A streaming media server is provided for dynamically resolving a request for digital content based upon the identity of the requester. The digital content may be specifically tailored to the demographics of the viewer, and need not be physically stored in sequence. Information about a viewer of digital video is stored within a user profile. The collection of all user profiles is maintained by a profile manager. When a viewer requests a digital data stream from the media server, a content resolver, coupled to the media server, determines how to service the request based upon the appropriate user profile. In certain embodiments, the content resolver may be configured to send targeted advertisements towards the requester of the digital data stream. In other embodiments, the content resolver may be configured to send personalized information pertaining to the requesting user. In other embodiments, the content resolver may personalize the requested content according to the user profile.

Abstract: A method and apparatus that provide for a Layer 2 path determination are disclosed. In one embodiment of the invention, a Layer 3 path between a source device and destination device is first determined in order to identify contiguous pairs of Layer 3 devices. A subpath is then determined for each contiguous pair of Layer 3 devices based on VLAN and spanning tree information associated with the contiguous pair. The Layer 2 path is a concatenation of the subpaths of all the contiguous pairs in the Layer 3 path.

Abstract: A septum for chemical containers comprises a body, a first port through the body having a first interior diameter sufficient to permit a flow of a fluid through the first port, and a second bore through the body having a second interior diameter less than the first interior diameter. The second interior diameter is sufficiently small as to restrict passage of vapors evaporated from within the container. In this configuration, vapors are safely exhausted outside a work facility, and a chemical container that would be classified as Use-Open under applicable fire codes is converted to Use-Closed, enabling the work facility to increase the volume of chemicals that may be contained or used in the facility under the code, without upgrade to Hazardous Occupancy standards, or building new facilities that qualify as Hazardous Occupancy and that can use Use-Open chemical containers.

Abstract: An optimized approach for arriving at a shared secret key in a dynamically changing multicast or broadcast group environment is disclosed. In one aspect of the invention, a method is provided for communicating through a secure channel between members of a dynamically changing multicast group connected over an insecure network. The method provides that a first shared secret key for establishing a first multicast group is computed that includes a set of one or more first members. Based on the first shared secret key, a first multicast group exchange key is also generated. Upon receiving a first user exchange key from a first user requesting entry into the first multicast group, a second secret key, based on the first user exchange key and the first shared secret key is computed. The first multicast group exchange key is sent to the first user and used by the first user to generate the same second shared secret key.

Abstract: A method and apparatus are provided for managing changes to a directory of electronic documents. A custom directory is created and stored based on the contents of a master directory. The master directory comprises a taxonomy of categories. A plurality of electronic documents are classified in one or more of the categories. One or more mappings defines how the documents of categories of the master directory map to categories of the custom directory. Mappings may express merges or splits of categories. One or more judgments may be created and stored in the custom directory in association with documents in the categories of the custom directory. Each judgment expresses whether a document is in or not in a category, or locked out of all categories. Modifications to the master directory are automatically propagated to the custom directory, according to the mapping, but without overriding the judgments in the custom directory.

Abstract: A mechanism and system are provided for making available information that identifies participants of a distributed operation by registering the information with a name service. Once the participant information has been registered with the name service, the name service supplies the information to entities that request it. An example of a distributed operation is a distributed transaction executed by two or more database servers.

Abstract: A method and tool for cleaning a watercraft speedometer are disclosed. The tool comprises a body, an extraction tip extending therefrom, and at least one edge on the extraction tip that can catch matter in the cavity. The extraction tip is attached to the body and is approximately the size and shape to fit into an intake cavity of a speedometer mechanism so as not to damage the intake cavity. The extraction tip edge is used for extracting debris from the intake cavity. Twisting the extraction tip into the intake cavity and pulling the extraction tip out of the intake cavity results in catching and withdrawing debris from the intake cavity.

Abstract: A mechanism for enabling session information to be shared across multiple processes in a multi-process environment is disclosed. There is provided a shared persistent memory-mapped file in a file system, which is mapped to the memory space of each of the processes. This file is used by all of the processes to store session information. Because the memory space of each process is mapped to the shared file, each process is able to access and manipulate all of the sessions in the system. Thus, sessions are no longer maintained on a process-specific basis. Rather, they are maintained on a centralized, shared basis. As a result, different requests pertaining to the same session may be serviced by different server processes without any adverse effects. Each process will be able to access and manipulate all of the state information pertaining to that session. By enabling session information to be shared, this mechanism eliminates the session management errors experienced by the prior art.

Abstract: A method is disclosed for managing a network having a plurality of network elements, where the network elements are configured to be interconnected to one another. A data structure is maintained that includes information about a link state for each network element in the plurality of network elements. The link state for each network element describes a connection between that network element and at least one other network element designated to be connected to that network element. A management policy is configured for the plurality of network elements by using link state information in the data structure to detect if any of the plurality of network elements are unreachable.

Abstract: A method and apparatus for communicating between a called routine written in a first programming language and calling routine written in a second programming language is described. User input specifies an interface of a proxy routine and the interface parameters of the interface. Metadata that is generated establishes a mapping of interface parameters to the routine parameters of the called routine. At least one interface parameter is of a data type not supported in the first programming language. The user input may specify that a first attribute of a particular interface parameter is associated with a first routine parameter of the called routine, and a second attribute of the particular interface parameter is associated with a second routine parameter of the called routine. The metadata maps the first attribute to the first routine parameter, and the second attribute to the second routine parameter.

Abstract: In processing a source entity with a transformation entity, an action set forth in a portion of the transformation entity is executed. A portion of the source entity is the subject of this action. This action causes a particular portion of a result entity to be generated. After this portion of the result entity is generated, a set of history information is associated therewith, which comprises a reference to the portion of the transformation entity that gave rise to the action, and a reference to the portion of the source entity that was the subject of the action. Given this information, it is possible to perform backtracking at a later time, so that when this particular portion of the result entity is selected, those portions of the transformation and source entities that gave rise to the particular portion of the result entity can be indicated to a user.