Abstract: Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

Abstract: Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

Abstract: Techniques are described herein for supporting efficient evaluation of pivot operations. In an embodiment, a pivoting query on a data table is received. The query identifies pivot columns, measure columns, and grouping columns. In response to receiving the query, a staging table that comprises new pivot columns, aggregated columns, and new grouping columns may be created. For each particular unique combination of values of the grouping columns and the pivot columns in the data table, stored values in the measure columns in the data table are aggregated for certain rows in the plurality of rows in the data table. Each row of the certain rows comprises the each particular unique combination of values of the grouping columns and the pivot columns in the data table. Results of aggregating are stored in the staging table. Data that has been populated in the staging table is transposed into a result set.

Abstract: An approach is provided for coordinating travel. A plurality of mobile devices is identified as a group, wherein each of the mobile devices is configured to obtain location information. A lead mobile device is designated among the group. Routing information or information about a common destination, specified by the lead mobile device, is transmitted to other mobile devices in the group.

Abstract: A method and apparatus for densification of data is provided. A method and apparatus for including a construct for partitioning data within a DML statement is provided. The construct for partitioning data may not necessarily perform a densification of data, and the densification of data may not necessarily include a construct for partitioning data. In an embodiment, the syntax of an OUTER JOIN is extended to include a PARTITION BY construct that may be used for data densification.

Abstract: Establishing a (secure) synchronized (web) browsing session between a customer at a first terminal (such as a kiosk for example) and a live agent at an agent station. A session manager may be used to establish this session. The first terminal does not need to download an applet from the agent station. Typically, a call will have already been established between the customer and the live agent. The kiosk and/or the agent may control access to content based on locators to the content (e.g., URLs). The access control may be based on GO, No Go lists and/or rules.

Abstract: Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

Abstract: Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

Abstract: Techniques are described for parallelizing qualifying window functions without reliance on partitioning criteria specified in the command that includes the qualifying window functions. Because the techniques do not rely on partitioning criteria specified in the command, the techniques may be used on commands in which no partitioning criteria is specified. In general, the techniques involve partitioning the work of a qualified window function into ranges, and sharing precomputed aggregate values between computational elements to calculate the value for the window functions.

Abstract: Establishing a (secure) synchronized (web) browsing session between a customer at a first terminal (such as a kiosk for example) and a live agent at an agent station. A session manager may be used to establish this session. The first terminal does not need to download an applet from the agent station. Typically, a call will have already been established between the customer and the live agent. The kiosk and/or the agent may control access to content based on locators to the content (e.g., URLs). The access control may be based on GO, No Go lists and/or rules.

Abstract: Establishing a (secure) synchronized (web) browsing session between a customer at a first terminal (such as a kiosk for example) and a live agent at an agent station. A session manager may be used to establish this session. The first terminal does not need to download an applet from the agent station. Typically, a call will have already been established between the customer and the live agent. The kiosk and/or the agent may control access to content based on locators to the content (e.g., URLs). The access control may be based on GO, NO GO lists and/or rules.

Abstract: A method and apparatus for densification of data is provided. A method and apparatus for including a construct for partitioning data within a DML statement is provided. The construct for partitioning data may not necessarily perform a densification of data, and the densification of data may not necessarily include a construct for partitioning data. In an embodiment, the syntax of an OUTER JOIN is extended to include a PARTITION BY construct that may be used for data densification.

Abstract: Establishing a conference between a customer at a customer terminal and a live agent at an agent station, by (a) accepting a call request from the customer terminal, (b) requesting that an available live agent take the call request, (c) when a live agent becomes available to take the call request, passing customer information to the agent station associated with the available live agent, and (d) establishing a conference from the agent station associated with the available live agent to the customer terminal. The conference may be an audio-video conference. The audio-video conference may be compliant with the H.323 standard. The call request may generated in response to an event sensed by an API which was previously downloaded to the customer terminal from a web server. The call request may be generated in response to a trigger event.

Abstract: Establishing a conference between a customer at a customer terminal and a live agent at an agent station, by (a) accepting a call request from the customer terminal, (b) requesting that an available live agent take the call request, (c) when a live agent becomes available to take the call request, passing customer information to the agent station associated with the available live agent, and (d) establishing a conference from the agent station associated with the available live agent to the customer terminal. The conference may be an audio-video conference. The audio-video conference may be compliant with the H.323 standard. The call request may generated in response to an event sensed by an API which was previously downloaded to the customer terminal from a web server. The call request may be generated in response to a trigger event.

Abstract: Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

Abstract: Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.