Abstract: The invention discloses a system and method for access and response to Internet emails, from a wireless device. The system extracts the emails from multiple Internet email accounts and forwards them, on the basis of pre-defined filter settings of the user, to the user's wireless device. The filter settings comprise filter criteria for identifying whether a new mail is to be forwarded to the wireless device or not, and content selection criteria for identifying parts of the new email to be sent to the wireless device. The system also enables the user to reply to the emails in a transparent manner whereby the replied message from the wireless device appears to have originated from the email address. The system also enables the user to dynamically change the filter settings using multi-modal inputs from his/her wireless device.

Abstract: A load balancing technology segregates various inventory types (e.g., potatoes vs. milk, vs. pretzels, vs. tissue paper, etc.) based upon how frequently they are ordered in a distribution center. Inventory types that are ordered at the slowest rate are not “replicated” over multiple pods in the distribution center. Rather, they are constrained to reside at a single pod within the distribution center. Items that are ordered somewhat more frequently than those in the slowest group are replicated in multiple pods across the distribution center. In other words, these items are separately stocked at locations on more than one pod in the distribution center. This means that a container passing through the distribution center can obtain each of the items in the second group of item types at multiple pods in the distribution center. Thus, these items do not create a bottleneck in the order fulfillment process. Inventory types in a third group, the fastest movers, are segregated from items in the first two groups.

Abstract: A system and method and computer program for seamlessly accessing multiple data sources and voice repositories using voice commands in a single phone call session. The system comprises of voice grammars that span various contexts for all data sources and voice repositories, a telephony platform, an automatic speech recognition engine, extractors for extracting information from the data sources and voice repositories and an interpreter for controlling the extractors and telephony platform. It is the co-operation between the voice grammars and the telephony platform, controlled by a VoiceXML interpreter that enables this seamless access to information from the multiple data sources and voice repositories.

Abstract: A system and method and computer program for seamlessly accessing multiple data sources and voice repositories using voice commands in a single phone call session. The system comprises of voice grammars that span various contexts for all data sources and voice repositories, a telephony platform, an automatic speech recognition engine, extractors for extracting information from the data sources and voice repositories and an interpreter for controlling the extractors and telephony platform. It is the co-operation between the voice grammars and the telephony platform, controlled by a VoiceXML interpreter that enables this seamless access to information from the multiple data sources and voice repositories.

Abstract: A system and method and computer program for seamlessly accessing multiple data sources and voice repositories using voice commands in a single phone call session. The system comprises of voice grammars that span various contexts for all data sources and voice repositories, a telephony platform, an automatic speech recognition engine, extractors for extracting information from the data sources and voice repositories and an interpreter for controlling the extractors and telephony platform. It is the co-operation between the voice grammars and the telephony platform, controlled by a VoiceXML interpreter that enables this seamless access to information from the multiple data sources and voice repositories.

Abstract: The invention discloses a system and method for access and response to Internet emails, from a wireless device. The system extracts the emails from multiple Internet email accounts and forwards them, on the basis of pre-defined filter settings of the user, to the user's wireless device. The filter settings comprise filter criteria for identifying whether a new mail is to be forwarded to the wireless device or not, and content selection criteria for identifying parts of the new email to be sent to the wireless device. The system also enables the user to reply to the emails in a transparent manner whereby the replied message from the wireless device appears to have originated from the email address. The system also enables the user to dynamically change the filter settings using multi-modal inputs from his/her wireless device.

Abstract: A system and method and computer program for seamlessly accessing multiple data sources and voice repositories using voice commands in a single phone call session. The system comprises of voice grammars that span various contexts for all data sources and voice repositories, a telephony platform, an automatic speech recognition engine, extractors for extracting information from the data sources and voice repositories and an interpreter for controlling the extractors and telephony platform. It is the co-operation between the voice grammars and the telephony platform, controlled by a VoiceXML interpreter that enables this seamless access to information from the multiple data sources and voice repositories.

Abstract: The present invention discloses a method and apparatus for the enumeration of projections (i.e., "SELECT DISTINCT" operations) in SQL queries containing outer and full outer joins in the presence of inner joins without encountering any regression in performance. The present invention removes projections from a given user query by moving the projections to the top of an expression tree representation of the query, wherein the projection removal is performed using algebraic identities rather than rule-based transformations. The present invention also discloses several methods of enumerating different plans or schedules for projection operations and binary operations in the given user query. The present invention can significantly reduce the execution time of a query by selecting the optimal schedule for binary operations and projections between the binary operations.

Abstract: A method and apparatus for generating static, dynamic and hybrid sparse indices for use with workfiles used by SQL queries in a relational database management system.

Abstract: A system and method of determining uniqueness properties of an expression. A root of the expression is first determined, where the root is one of a base relation, a unary operation or a binary operation. Once the root is determined, a first procedure of an augmented unique process is called to determine uniqueness properties of a child of that root. The procedure called is chosen based on the determined root. Where the root is a base relation, a first procedure of a uniqueness process is applied to determine the uniqueness properties of the base relation. Where the root is a unary or binary operation, the called procedure is suspended, a second procedure of the augmented unique process is called to determine the uniqueness properties of the child of the operation, and this process is repeated until a base relation is reached. Once a base relation is reached, the first procedure of the uniqueness process is applied to determine the uniqueness properties of the reached base relation.

Abstract: The present invention discloses a method and apparatus for the enumeration of projections (i.e., "SELECT DISTINCT" operations) in SQL queries containing outer and full outer joins in the presence of inner joins without encountering any regression in performance. The present invention removes projections from a given user query by moving the projections to the top of an expression tree representation of the query, wherein the projection removal is performed using algebraic identities rather than rule-based transformations. The present invention also discloses several methods of enumerating different plans or schedules for projection operations and binary operations in the given user query. The present invention can significantly reduce the execution time of a query by selecting the optimal schedule for binary operations and projections between the binary operations.

Abstract: A method and apparatus for query simplification by applying generalized inference propagation and generalized transitive closure in SQL queries having selection, projection, join, outer join, and intersection operations.

Abstract: A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative re-orderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.

Abstract: A system and method for destaging changed data from a shared cache castout in a shared data environment distributes castout ownership for a dataset among a plurality of systems having an update interest in the dataset. One system is designated as having castout ownership of the dataset in a primary state. All other systems having an update interest in the dataset hold castout ownership for the dataset in a backup state. When the primary owner relinquishes ownership, primary ownership is passed to one of the backup systems. A structure castout owner for the entire cache assumes the responsibility of castout of changed data for a dataset for which the primary castout owner has had a failure.

Abstract: A method, apparatus and article for manufacture for generating static, dynamic and hybrid sparse indices for use with workfiles used by SQL queries in a relational database management system. A workfile and a sparse index structure are temporarily created in the computer during execution of the query by the computer. The workfile stores intermediate relations resulting from execution of a portion of the SQL query, wherein the intermediate relations comprise sorted rows for an inner table referenced in the SQL query. The sparse index structure contains one or more entries indicating at least an approximate location for at least some of the rows in the workfile. As one or more rows from an outer table referenced in the SQL query are retrieved, the entries of the sparse index structure are searched for a closest matching entry for each retrieved row. The sorted workfile is then scanned for a row matching each retrieved row using the closest matching entry from the sparse index structure as a starting position.

Abstract: A computer program product for a system and method for destaging changed data from a shared cache castout in a shared data environment distributes castout ownership for a dataset among a plurality of systems having an update interest in the dataset. One system is designated as having castout ownership of the dataset in a primary state. All other systems having an update interest in the dataset hold castout ownership for the dataset in a backup state. When the primary owner relinquishes ownership, primary ownership is passed to one of the backup systems. A structure castout owner for the entire cache assumes the responsibility of castout out changed data for a dataset for which the primary castout owner has had a failure.

Abstract: A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative reorderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.

Abstract: A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative reorderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.

Abstract: A method and apparatus for query simplification by applying generalization inference propagation and transitive closure in SQL queries having intersection operations combined with inner and outer join operations further combined with selection and/or projection operations. First a strong set of predicates is calculated, typically a selection or join predicate which is null-intolerant. Second the strong set of attributes is used to select and replace a full, left, or right outer join operation found as the operand of an intersection operation in the query. A less expensive outer or inner join replaces the selected join and the process is repeated until no further simplification if possible. Inferences are propagated from one operand to the other of an intersection operation. Selection operators are applied through transitive closure to reduce the size of intermediate results.

Abstract: A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative reorderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.