Abstract: Aspects of the invention provide methods for rewriting and computing database queries that include outer join conditions, and for determining columns that satisfy a criteria. According to one aspect, a component relation key is assigned to each unique column in a first table and an aggregate relation key is generated for each record in a second table, wherein the aggregate relation key is based on one or more of the component relation keys corresponding to columns with non-null values from the second table. Distinct aggregate relation keys are determined, and an original query with an outer join is rewritten into at least a number of sub-queries equal to the number of distinct aggregate keys, wherein each sub-query includes a join condition based on each column represented by the respective distinct aggregate keys. Significantly, the combination of sub-queries is logically equivalent to the original query, but does not include outer join conditions. Therefore, a more efficient query is provided.

Abstract: An automatic playback overshoot correction system predicts the position in the program material where the user expects to be when the user stops the fast forward or reverse progression of the program material. The invention determines the position where the program material was stopped. The media controller transitions to the new mode that the user selected, starting at the stopped position with an overshoot correction factor added or subtracted from it. The invention adapts to the user by remembering how much the user corrects after he stops the fast forward or reverse mode. Correction factors are calculated using the user's corrections and adjusting the correction factors if the user continues to make corrections.

Abstract: Techniques for concurrent access to a resource object, such as a database, include generating a lock data structure for a particular resource object. The lock data structure includes data values for a resource object identification, a lock type, and a version number. The version number is related to a number of changes to the resource object since the lock data structure was generated. A request is received from a requesting process. The request is for a requested lock type for access to the particular resource object. It is determined whether to grant the request based on the requested lock type and the lock type in the lock data structure. By carrying a lock version number in a lock data structure managed by a lock manager, improved optimistic locking is provided in a database. In particular, the approach enables introduction of optimistic locking to a legacy database without requiring burdensome changes to a database table schema.

Abstract: A multimedia visual progress indication system that provides a trick play bar that is overlaid onto the program material or displayed on a dedicated display. A cache bar inside of the trick play bar indicates the length of a recording session or the length of stored program material and expands to the right when material is being recorded. Every half hour (or selected increment), the cache bar slides to the left. Time marks are displayed inside the trick play bar giving the user a visual reference point from which to judge the current time and visual time reference points. The time marks are in any increment of time needed. The total length of the stored program material or next time or counter increment in the recording cycle is displayed on the right hand end of the trick play bar. A position indicator moves within the trick play bar and tells the user visually where his current position is within the program material.

Abstract: An approach for drawing a straight-line graph with minimal cognitive disruption to the user is disclosed. In one embodiment, information defining a first graph comprising a first vertex set and a first edge set is received. A second vertex set and a second edge set are received. The second edge set is added to the first edge set. A second graph is created based on the first vertex set and the first edge set. For each vertex in the second vertex set, one or more neighboring vertices are determined, a first barycenter is determined based on positions of the neighboring vertices in the second graph, a second barycenter is determined based on positions of the neighboring vertices in the first graph, and a vector directed from the first barycenter to the vertex in the second graph is determined. Coordinates of the vertex in the first graph are modified to a final position equal to a sum of the vector and the second barycenter.

Abstract: A mechanism for managing data communications is provided. A circularly arranged set of buckets is disposed between input buffers and output buffers in a networked computer system. Connections among the system and clients are stored in the buckets. Each bucket in the set is successively examined, and each connection in the bucket is polled. During polling, the amount of information that has accumulated in a buffer associated with the connection since the last poll is determined. Based on the amount, a period value associated with the connection is adjusted. The connection is then stored in a different bucket that is generally identified by the sum of the current bucket number and the period value. Polling continues with the next connection and the next bucket. In this way, the elapsed time between successive polls of a connection automatically adjusts to the actual operating bandwidth or data communication speed of the connection.

Abstract: An abstraction mechanism is disclosed, which is capable of recognizing and abstracting precharged latches and flip-flops, and which is capable of generating a cycle ready representation of the precharged latches and flip-flops. In one embodiment, the abstraction mechanism abstracts precharged latches and flip-flops by using cofactors. In doing so, the abstraction mechanism accesses a logic level representation of a structure. Based upon the logic level representation, the abstraction mechanism derives one or more cofactors. These cofactors are then tested to determine whether they indicate precharge behavior, and whether they indicate latch or flip-flop behavior. If the cofactors indicate both precharge behavior and latch or flip-flop behavior, then the abstraction mechanism abstracts the structure as a precharged latch, or a precharged flip-flop, whichever is appropriate.

Abstract: A web server configured to respond to client requests over a network such as the World Wide Web includes a web listener having a Hypertext Transfer Protocol (HTTP) daemon, a plurality of extension programs configured to perform respective operations, and a web request broker configured to identify one of the programs for responding to a client request, and determine the availability of an instance of the identified program. The web request broker maintains control of multiple instances of each server extension program to provide enhanced server operation without overwhelming server resources. The web request broker maintains a minimum number of instances of the identified program in memory, each executed in its own address space. The web request broker determines whether an available instance of the identified program is available from an existing number of instances, and selectively initiates a new instance of the program if no other instance is available.

Abstract: Techniques are provided for handling distributed transactions in shared-nothing database systems where one or more of the nodes have access to a shared persistent storage. Rather than coordinate the distributed transaction using a two-phase commit protocol, the coordinator of the distributed transaction uses a one-phase commit protocol with those participants that have access to the transaction status information maintained by the coordinator. The transaction status information may reside, for example, in the redo log of the coordinator. In the case that the coordinator fails, those participants can determine the state of the distributed transaction based on information stored on the shared disk. In addition, the coordinator is able to determine whether it is possible to commit the distributed transaction based on information that is stored on the shared disk by the participants, without those participants entering a formal “prepared” state.

Abstract: A method and apparatus for communicating a COPS protocol policy to a non-COPS-enabled network device (i.e., a device or one or more interfaces included in the device) is provided. A COPS proxy is networked with a policy server and a non-COPS-enabled network device such that the COPS proxy can communicate with the policy server and the non-COPS-enabled network device. The policy server is configured to communicate COPS protocol policies to the COPS proxy, which, in turn, is configured to translate the COPS protocol policy into a policy that is in accordance with a policy protocol that the non-COPS-enabled network device can receive and correctly interpret (a “non-COPS protocol”). The translation of the policy utilizes a mapping database that delineates predetermined relationships between COPS protocol policies and the non-COPS protocol policies.

Abstract: A method and apparatus for debugging a software program is provided that is non-intrusive and allows multiple persons to debug concurrently in view private sessions. In one example, a method includes preserving a memory state of a portion of a software program, such as a database system. A second software program is compiled and dynamically linked, and which when executed, would normally cause modification to targeted data in the preserved portion of the software program. The second software program is executed by making a copy of the targeted data in the preserved portion of the software program. The copy is modified to generate a modified copy of the targeted data without modifying the data that is in the preserved portion of the software program. In subsequent accesses, the user that issued that executed the second software program accesses the modified copy whenever the user would have otherwise accessed the corresponding preserved portion.

Abstract: A framework is provided for management of models. Management of data models or other types of models includes model change comparison and change implementation. For example, in the context of data warehouse models, model components and their process interactions are captured in a form such that different versions of a model can be automatically compared and any changes between versions determined. The framework provides the capability of capturing a model definition down to the level of an individual object and the semantics and relationships of each object. A model is represented and stored as a set of (1) unique object identifiers, (2) object metadata signatures that represent the semantics of objects, and (3) object relationships. Such model information can be stored in a relational database, against which a query, such as an SQL (Structured Query Language) query, can be executed to determine whether two models differ.

Abstract: Techniques are provided for changing data for an XML construct in an SQL/XML compliant database management system (DBMS). The DBMS allows instances of XML type to represent XML constructs, such as XML documents, XML elements, XML attributes, and fragments of XML documents. An SQL statement is received that includes an XML operator that operates on a particular component in an instance of XML type. During execution of the SQL statement, the XML operator is evaluated by modifying content for the component without modifying the entire instance. For example, an XML delete operator deletes the particular component from the instance. Other XML operators include an insert operator, an insert-before operator, an append-child operator, and an update operator. During execution, these operators may be rewritten to operate on existing SQL constructs, or evaluated by updating only some of the existing SQL constructs, or both.

Abstract: A mechanism for debugging a transformation document is disclosed, wherein a debugging mechanism interacts with a user interface to enable a user to specify one or more breakpoints. The user may specify a breakpoint at a particular location in the transformation document or a source document. In addition, the user may specify one or more breakpoints using an expression, or based upon XSL messages. In addition to interacting with the user interface, the debugging mechanism also interacts with a transformation processor, which is the mechanism that actually processes the source and transformation documents to derive a result document. Before and after each processing action, the transformation processor sends a pre-action and a post-action message, respectively, to the debugging mechanism. The debugging mechanism uses the information in these messages to determine whether a breakpoint has been reached.

Abstract: A system and method for maintaining large-grained database concurrency with a log monitor incorporating dynamically redefinable business logic are described. Operations expressed in a data manipulation language are executed against a source database. At least one operation constitutes a commit operation that completes each database transaction. A current rule set is defined. Each rule includes business logic specifying a data selection criteria for records stored in the source database. A log entry is periodically generated in a log for each transaction committed to the source database. Each log entry identifies an affected record and includes transactional data. The transaction identified in each log entry is evaluated against the data selection criteria specified in the current rule set. A new record is built in accordance with metadata describing a destination database. The new record contains select transactional data from the log entry of each transaction meeting the selection criteria.

Abstract: A method and apparatus for identifying bulk electronic mail is provided. The contents of a plurality of electronic mail messages are tracked and used to determine whether a particular electronic mail message is bulk electronic mail or not bulk electronic mail. The manner in which an electronic mail message is processed depends on the type of the electronic mail message. In particular, a message signature is generated from the contents of the electronic mail message and transmitted to a central server. The central server generates a count of how many other previously received signatures match the just generated message signature. The count is transmitted to the electronic mail server that transmitted the particular message signature. If the count meets a predetermined threshold, the electronic mail server marks the electronic mail message as bulk electronic mail. Alternatively, the central server transmits the message signature of an identified bulk electronic mail message to an electronic mail server.

Abstract: Conditional functionality is provided for database merge operations. A merge operation, for merging data from a source to a destination, involves performing a default operation for each source record. Default operations associated with a MERGE statement include UPDATE and INSERT operations. Which default operation is performed depends on whether any destination record corresponds to a given source record. In an embodiment, whether a specified condition is satisfied is determined. If the condition is satisfied, then the default operation that is appropriate for a given source record is performed. If the condition is not satisfied, then the given source record is processed without performing the appropriate default operation. In one aspect, the UPDATE clause of the MERGE statement is extended to include a conditional DELETE clause.

Abstract: A method and apparatus associates a domain name of a home gateway with one or more PVCs. After the PVC is established, a tunneling protocol is used to request the domain name of the home gateway, and the domain name is associated with the PVC. When a user logs on via an access communication device, the user will provide a domain name of a home gateway with which the user desires to communicate. A PVC associated with the home gateway is then used to allow the user to communicate with the home gateway. The domain name of the home gateway may be periodically verified to detect any changes.

Abstract: A method and system for allowing clients to retrieve data from data sources that do not necessarily support the same protocols and formats as the clients. The clients issue service requests. A pre-processor responds to the requests by generating XML-structured request objects with unresolved links to the data sources that have information required by the clients. An XML processor resolves the links by issuing requests through one or more gateways. The gateways convert the responses received from the data sources into XML, which the XML processor uses to create XML composite response documents. A post-processor filters the XML response documents, and applies XSL stylesheets to transform the XML composite response documents into client-specific responses that conform to the format required by the clients. The client-specific responses are then sent to the clients.

Abstract: A method and apparatus are provided for managing work granules being executed in parallel. A task is evenly divided between a number of work granules. The number of work granules falls between a threshold minimum and a threshold maximum. The threshold minimum and maximum may be configured to balance a variety of efficiency factors affected by the number of work granules, including workload skew and overhead incurred in managing larger number of work granules. Work granules are distributed to processes on nodes according to which of the nodes, if any, may execute the work granule efficiently. A variety of factors may used to determine where a work granule may be performed efficiently, including whether data accessed during the execution of a work granule may be locally accessed by a node.