Abstract: Techniques for optimizing outer joins in database operations are provided. In an embodiment, a query having an outer join with a GROUP BY clause is rewritten and expanded to expand a first level partition of that GROUP BY clause to produce a modified query. In another situation, rows associated with processing a query are each row split and then hashed based at least in part on attributes of the outer join predicate. A left outer join is performed and a global aggregation processed to produce a spooled table to process the query.

Abstract: Techniques for external application-directed data partitioning in data exported from a parallel database management system (DBMS) are provided. An external application sends a query, a total number of requested access module processors (AMPs), and an application-defined data partitioning expression to the DBMS. The DBMS executes the query with the results vertical partitioned on the identified number of AMPs. Individual external mappers access their assigned AMPs asking for specific partitions that they are assigned to process the query results.

Abstract: Techniques that facilitate management of skewed data during a parallel multiple join operation are provided. Portions of tables involved in the join operation can be distributed among a plurality of processing modules, and each of the processing modules can be provided with a list of skewed values of a join column of a larger table involved in the join operation. Each of the processing modules can scan the rows of first and second tables distributed to the processing modules and compare values of the join columns of both tables with the list of skewed values. One or more of the processing modules can then redistribute the skewed values.

Abstract: An umbilical hose end coupling that comprises a sleeve and an insert for the sleeve, the insert having a hose end for insertion into the hose and the sleeve having a hose end for covering the exterior of the hose and the insert, and the insert and sleeve each having a coupling end for engaging each other, and the sleeve having a first specified region that is subject to swaging and a second specified region that is not subject to swaging.

Abstract: An email system may include an email server(s) configured to store email messages in a plurality of mailboxes, where the email messages are organized into different conversations and the conversations are organized into different categories. A plurality of mobile wireless communications devices may each be configured to store email messages from respective mailboxes also organized into the different conversations and the different categories. Each of the mobile wireless communications devices may also associate respective conversation IDs with the different conversations, and associate respective category IDs with the different categories.

Abstract: A dynamic dispersion detecting method and apparatus are disclosed. The apparatus includes a tunable dispersion compensation module (101), a demodulator (102), a receiver (103), a partial band radio frequency power detecting unit (104), and an electrical signal ratio calculating unit (105). The method includes: demodulating a phase of a received optical signal; converting the demodulated optical signal into an electrical signal; sampling radio frequency power of the electrical signal to obtain an radio frequency signal; obtaining an electrical signal ratio of the radio frequency signal; and comparing a value of a currently detected electrical signal ratio with the values of the previously detected electrical signal ratios, tuning a dispersion compensation value according to a comparison result to find a peak electrical signal ratio, and obtaining a residual dispersion value of a system according to the peak electrical signal ratio.

Abstract: Techniques presented herein provide approaches for out-of-band host management via a management controller. In one embodiment, the management controller provides an application programming interface (API) specifying one or more functions for managing one or more applications executing on a host computer. Using the API, the one or more applications may be managed more conveniently and/or efficiently at least in some cases.

Abstract: A clock data recovery module and a method of operation thereof are described. In an embodiment, a data stream is received. Transitions in the data stream are detected to provide phase signaling for indicating phase relationships to the transitions detected. A lock detector receives the phase signaling. The lock detector accumulates phase information from the phase signaling and temporarily stores an accumulated total of the phase information representative of a code change, and the lock detector determines whether the code change is within a set range over a time period and resets the accumulated total at a conclusion of the time period.

Abstract: A portable electronic device includes a housing; a touch tip portion fixed to one end of the housing; a cover fixed to the other end of the housing; a laser unit disposed in the housing adjacent to the touch tip portion; a rechargeable battery disposed in the housing electrically connected to the laser unit; and a first charging connecting portion and a second charging connecting portion positioned on an outer surface of the housing apart. The first charging connecting portion includes a first connecting end electrically connected to a negative electrode of an external power and a second connecting end electrically connected to the positive electrode of the rechargeable battery. The second charging connecting portion includes a first connecting end electrically connected to a positive electrode of an external power and a second connecting end electrically connected to the negative electrode of the rechargeable battery.

Abstract: A system, method, and computer-readable medium for optimized processing of queries that feature maximum or minimum equality conditions are provided. The disclosed mechanisms provide for a single-scan of the table on which the group-by query is applied. When the table is scanned, each processing module dynamically keeps track of the row(s) having a value of the attribute on which the equality condition is applied that equals or exceeds the maximum attribute value (assuming a maximum equality condition is applied) previously encountered by the processing module. Subsequently, a global aggregation process is then performed to compute the query's result without rescanning the table. Queries featuring a minimum equality condition are similarly processed in accordance with the disclosed embodiments.

Abstract: A system, method, and computer-readable medium for optimized processing of queries that feature maximum or minimum equality conditions are provided. A table on which the query is applied is scanned a single time. Rows of the table distributed to respective processing modules are scanned by the processing modules. Each processing module maintains identification of any rows distributed to the respective processing module that have attribute values that equal the maximum or minimum attribute value locally identified by the processing module. Subsequently, a global aggregation mechanism is invoked to compute the query result without requiring an additional rescan of the table. Further, the disclosed mechanisms may be extended to compute top N queries featuring maximum or minimum equality conditions.

Abstract: A system, method, and computer-readable medium for optimization of query processing in a parallel processing system are provided. Skewed values and non-skewed values are treated differently to improve upon conventional DISTINCT and aggregation query processing. Skewed attribute values on which a DISTINCT selection or group by aggregation is applied are allocated entries in a hash table. In this manner, a processing module may consult the hash table to determine if a skewed attribute value has been encountered during the query processing in a manner that precludes repetitive redistribution of rows with highly skewed attribute values on which a DISTINCT selection or group by aggregation is applied.

Abstract: A system, method, and computer-readable medium that facilitate management of data skew during a parallel multiple join operation are provided. Portions of tables involved in the join operation are distributed among a plurality of processing modules, and each of the processing modules is provided with a list of skewed values of a join column of a larger table involved in the join operation. Each of the processing modules scans the rows of first and second tables distributed to the processing modules and compares values of the join columns of both tables with the list of skewed values. Rows of a larger table having non-skewed values in the join column are redistributed, and rows of the larger table having skewed values in the join column are maintained locally at the processing modules. Rows of the smaller table that have non-skewed values in the join column are redistributed, and rows of the smaller table that have skewed values in the join column are duplicated among the processing modules.

Abstract: A system, method, and computer-readable medium for optimizing execution of a join operation in a parallel processing system are provided. A plurality of processing nodes that have at least one row of one or more tables involved in a join operation are identified. For each of the processing nodes, respective counts of rows that would be redistributed to each of the processing nodes based on join attributes of the rows are determined. A redistribution matrix is calculated from the counts of rows of each of the processing nodes. An optimized redistribution matrix is generated from the redistribution matrix, wherein the optimized redistribution matrix provides a minimization of rows to be redistributed among the nodes to execute the join operation.

Abstract: A system, method, and computer-readable medium that facilitate management of data skew during a parallel join operation are provided. Portions of tables involved in the join operation are distributed among a plurality of processing modules, and each of the processing modules is provided with a list of skewed values of a join column of a larger table involved in the join operation. Each of the processing modules scans the rows of the tables distributed to the processing modules and compares values of the join columns of both tables with the list of skewed values. Rows of the larger table having non-skewed values in the join column are redistributed, and rows of the larger table having skewed values in the join column are maintained locally at the processing modules. Rows of the smaller table that have non-skewed values in the join column are redistributed, and rows of the smaller table that have skewed values in the join column are duplicated among the processing modules.

Abstract: A system, method, and computer-readable medium for optimizing the performance of outer joins in a parallel processing system are provided. Predicates involving only attributes of a left table of a left outer join are pushed down to the outer relation for left outer joins having join predicates involving left table attributes and/or predicates involving attributes of both the right and left table. In such an instance, the rows of the left table may be partitioned into two sub-relations according to the predicate involving only attributes of the left table. Rows of the left table are allocated to a first sub-relation if the rows satisfy the predicate involving only attributes of the left table and rows of the left table are allocated to a second sub-relation if the rows fail to satisfy the predicate involving only attributes of the left table. Accordingly, only rows of the first sub-relation are required to be left outer joined with the right table.

Abstract: A hierarchical arrangement of nodes is provided to represent Extensible Markup Language (XML) data. In response to a keyword search query containing query keywords, sets of nodes in the hierarchical arrangement are identified for respective query keywords. A smallest of the sets of nodes is identified, and starting with the smallest of the sets of nodes, a stack-based algorithm is applied to identify exclusive lowest common ancestor (ELCA) nodes of the hierarchical arrangement.

Abstract: An email system may include an email server(s) configured to store email messages in a plurality of mailboxes, where the email messages are organized into different conversations and the conversations are organized into different categories. A plurality of mobile wireless communications devices may each be configured to store email messages from respective mailboxes also organized into the different conversations and the different categories. Each of the mobile wireless communications devices may also associate respective conversation IDs with the different conversations, and associate respective category IDs with the different categories.

Abstract: A system, method, and computer-readable medium for dynamic detection and management of data skew in parallel join operations are provided. Receipt of an excessive number of redistributed rows by a processing module is detected thereby identifying the processing module as a hot processing module. Other processing modules then terminate redistribution of rows to the hot processing module and maintain rows of a skewed table of the join operation that would be redistributed to the hot processing module in a local spool. Rows of a smaller table that would be redistributed to the hot processing module are duplicated to each processing module involved in the join operation. Rows of tables that are to be redistributed by a processing module to any processing module excluding the hot processing module are redistributed accordingly and maintained locally by the processing module. The join operation is completed by merging results of local join data sets of each processing module.

Abstract: A system, method, and computer-readable medium for optimized processing of queries that feature maximum or minimum equality conditions are provided. The disclosed mechanisms provide for a single-scan of the table on which the group-by query is applied. When the table is scanned, each processing module dynamically keeps track of the row(s) having a value of the attribute on which the equality condition is applied that equals or exceeds the maximum attribute value (assuming a maximum equality condition is applied) previously encountered by the processing module. Subsequently, a global aggregation process is then performed to compute the query's result without rescanning the table. Queries featuring a minimum equality condition are similarly processed in accordance with the disclosed embodiments.