Abstract: Techniques are provided herein for processing a query using in-memory cursor duration temporary tables. The techniques involve storing a part of the temporary table in memory of nodes in a database cluster. A part of the temporary table may be stored in disk segments of nodes in the database cluster. Writer threads running on a particular node writes data for the temporary table to the memory of the particular node. Excess data may be written to the disk segment of the particular node. Reader threads running on the particular node reads data for the temporary table from the memory of the particular node and the disk segment of the particular node.

Abstract: Techniques are described for parallel processing of database queries with an inverse distribution function by a database management system (DBMS). To improve the execution time of a query with an inverse distribution function, the data set referenced in the inverse distribution function is range distributed among parallel processes that are spawned and managed by a query execution coordinator process (QC), in an embodiment. The parallel executing processes sort each range of the data set in parallel, while the QC determines the location(s) of inverse distribution function values based on the count of values in each range of the data set. The QC requests the parallel processes to produce to the next stage of parallel processes the values at the location(s) in the sorted ranges. The next stage of parallel processes computes the inverse distribution function based on the produced values.

Abstract: A method, a system, and a non-transitory storage medium provides to receive Moving Picture Experts Group Dynamic Adaptive Streaming over Hypertext Transfer Protocol (MPEG-DASH) segments that have multiple bit rates of a program; divide each of the MPEG-DASH segments into first multiple slices of program data of the program; generate first header slices for the first multiple slices, wherein each of the first header slices includes sequence information and an identifier of one of the MPEG-DASH segments; and multicast second packets that include the first headers and the first multiple slices.

Abstract: A method, a system, and a non-transitory storage medium provides to receive a program including audio and video data; generate Moving Picture Experts Group (MPEG) Dynamic Adaptive Streaming over Hypertext Transfer Protocol (HTTP) (MPEG-DASH) segments that have multiple bit rates; transmit first packets that include the MPEG-DASH segments; divide each of the MPEG-DASH segments into first multiple slices of program data; generate a first header for each first slice of the first multiple slices, wherein the first header includes sequence information; multicast second packets that include first headers and the first multiple slices of each of the MPEG-DASH segments; assemble the MPEG-DASH segments; divide each of the MPEG-DASH segments into second multiple slices of the program data; encapsulate the second multiple slices into third packets; generate forward error correction packets; and multicast to a user device of a multicast, the third packets and the forward error correction packets.

Abstract: Techniques are described for parallel processing of database queries with an inverse distribution function by a database management system (DBMS). To improve the execution time of a query with an inverse distribution function, the data set referenced in the inverse distribution function is range distributed among parallel processes that are spawned and managed by a query execution coordinator process (QC), in an embodiment. The parallel executing processes sort each range of the data set in parallel, while the QC determines the location(s) of inverse distribution function values based on the count of values in each range of the data set. The QC requests the parallel processes to produce to the next stage of parallel processes the values at the location(s) in the sorted ranges. The next stage of parallel processes computes the inverse distribution function based on the produced values.

Abstract: A system can include one or more content distribution sites to provide content to one or more content satellite offices for delivery toward a set of destination devices for display. A content distribution site, of the one or more content distribution sites, can include one or more streamer devices. The one or more streamer devices can be associated with a single spoofed Internet protocol (IP) address. The spoofed IP address can facilitate failover among the one or more streamer devices. The one or more streamer devices can be configured to provide the content toward the set of destination devices using multicast with forward error correction (FEC). A content satellite office, of the one or more content satellite offices, can be configured to subscribe to a multicast group associated with the one or more streamer devices. The multicast group can be associated with the spoofed IP address to facilitate the failover among the one or more streamer devices.

Abstract: A method, a system, and a non-transitory storage medium provides to receive multicast protocol packets, wherein each of the multicast protocol packets includes one of a slice of program data of a Moving Picture Experts Group (MPEG) Dynamic Adaptive Streaming over Hypertext Transfer Protocol (HTTP) (MPEG-DASH) segment and a header of the slice that indicates sequence information of the slice relative to other slices, or forward error correction data; order, in response to the receipt of the multicast protocol packets, each slice received based on the sequence information; determine whether any slice is missing that is a part of the MPEG-DASH segment; determine, in response to a determination that there are missing slices, whether the missing slices can be recovered; and use, in response to a determination that the missing slices can be recovered, the forward error correction data to recover the missing slices.

Abstract: A method, apparatus, and stored instructions are provided for the removal of redundant GROUP BY and/or DISTINCT. Every table in the FROM clause of the query block must be a qualified table for the GROUP-BY clause or the DISTINCT keyword in the SELECT clause of the query block to be removed. A table Tx that satisfies at least one of the following two conditions is referred to as a qualified table: (1) Tx has a non-null unique column Tx.u that appears on the GROUP BY clause or the SELECT clause that contains a DISTINCT keyword and (2) There is a qualified table Ty and Ty has a filtering join with Tx.

Abstract: Techniques for query optimization for group-by extensions and distinct aggregate functions are provided. A query has an extended group-by clause with an extended group-by operator and a first set of group-by columns. The query has one or more distinct aggregate functions and one or more non-distinct aggregate functions. An initial subquery is constructed that generates a partially aggregated initial temporary (PAIT) table when executed. The initial subquery includes a GROUP BY clause with a second set of group-by columns that includes the first set of group-by columns of the extended group-by clause of the query and one or more columns specified by the one or more distinct aggregate functions. One or more subqueries are computed that compute groupings indicated by the extended group-by operator based on the PAIT table generated by the initial subquery.

Abstract: Techniques are described for parallel processing of database queries with an inverse distribution function by a database management system (DBMS). To improve the execution time of a query with an inverse distribution function, the data set referenced in the inverse distribution function is range distributed among parallel processes that are spawned and managed by a query execution coordinator process (QC), in an embodiment. The parallel executing processes sort each range of the data set in parallel, while the QC determines the location(s) of inverse distribution function values based on the count of values in each range of the data set. The QC requests the parallel processes to produce to the next stage of parallel processes the values at the location(s) in the sorted ranges. The next stage of parallel processes computes the inverse distribution function based on the produced values.

Abstract: One or more network devices provide, to a user device, a content list of content items available for presentation. The one or more network devices receive, from the user device, a personalized channel plan that includes a schedule of selected content items, from the content list, for presentation on a viewing device that is different than the user device. The one or more network devices select, based on the selected content items, advertising for inclusion with the selected content items and assign links for the viewing device to obtain the selected content items. The one or more network devices send the links to the user device, which may in turn be provided to the viewing device.

Abstract: A method, a system, and a non-transitory storage medium provides to receive a program including audio and video data; generate Moving Picture Experts Group (MPEG) Dynamic Adaptive Streaming over Hypertext Transfer Protocol (HTTP) (MPEG-DASH) segments that have multiple bit rates; transmit first packets that include the MPEG-DASH segments; divide each of the MPEG-DASH segments into first multiple slices of program data; generate a first header for each first slice of the first multiple slices, wherein the first header includes sequence information; multicast second packets that include first headers and the first multiple slices of each of the MPEG-DASH segments; assemble the MPEG-DASH segments; divide each of the MPEG-DASH segments into second multiple slices of the program data; encapsulate the second multiple slices into third packets; generate forward error correction packets; and multicast to a user device of a multicast, the third packets and the forward error correction packets.

Abstract: A method, a system, and a non-transitory storage medium provides to receive multicast protocol packets, wherein each of the multicast protocol packets includes one of a slice of program data of a Moving Picture Experts Group (MPEG) Dynamic Adaptive Streaming over Hypertext Transfer Protocol (HTTP) (MPEG-DASH) segment and a header of the slice that indicates sequence information of the slice relative to other slices, or forward error correction data; order, in response to the receipt of the multicast protocol packets, each slice received based on the sequence information; determine whether any slice is missing that is a part of the MPEG-DASH segment; determine, in response to a determination that that there are missing slices, whether the missing slices can be recovered; and use, in response to a determination that the missing slices can be recovered, the forward error correction data to recover the missing slices.

Abstract: The present invention generally relates to a process for preparation of 9-halo-3-(2-haloacetyl)-10,11-dihydro-5H-dibenzo[c,g]chromen-8(9H)-one of Formula I, which is an intermediate in the preparation of Hepatitis C Virus (HCV) inhibitors.

Abstract: Network devices provide, to a content source device, an uplink user interface to describe and upload video content. The network devices receive, via the uplink user interface, descriptive information for the video content and generate, based on the descriptive information received via the uplink user interface, a unique content identifier for the video content. The network devices incorporate, based on the descriptive information, a listing of the video content into a catalog of content available to users of a content distribution network. The network devices receive, from the content source device, the video content and receive, from a user device, a request to view the video content that includes the unique content identifier. The network devices provide, to the user device, a link to enable the user device to access the video content via the content distribution network.

Abstract: Techniques herein optimize sort-merge join method for a band join. In an embodiment, for a query comprising a query block specifying a join between a first table and a second table, a band join condition is detected between the first table and the second table. Once the band join condition in detected, an execution plan is generated and executed. The execution of the execution plan includes: for a first row of at least a subset of first sorted rows, scanning second rows from a set of second sorted rows, joining each of said second rows with said first row, and ceasing to scan when encountering a row from the second sorted rows that falls outside a bound of said band join condition. Techniques also include parallelizing a workload by overlapping the distribution of rows to the same slave process and computing cost and cardinality estimation for enhanced band join.

Abstract: Techniques are described for leveraging column dictionaries of tables for join, group-by and expression evaluation operations. In an embodiment, a table is stored in one or more data units, each data unit's metadata containing dictionaries for stored columns. Rather than storing unencoded column values, the data units may store columns as column vectors of dictionary-encoded values, in an embodiment. When performing a join operation, a matching of values may be performed on the build-side table using the unencoded, unencoded, values stored in the join-key dictionary(s) of the probe-side table, thus, significantly reducing the number of searching and matching operations. In an embodiment, a group-by operation may be executed by performing partial aggregations based on unique group-by key values as stored in the one or more group-by key dictionaries.

Abstract: Attributes and semantics of duplicate insignificance that are inherent or inferred in a database language statement are detected. Also, a join operation that is inherent or inferred in the database language statement is detected and examined for join semantics. The join semantics specifies or refers to a driving table to be subjected to a hash join operation that may populate one or more hash buckets. The optimizer and the execution layers may use cost estimation or heuristics to assign the left and right table roles to the tables involved in the join. The hash join operation removes left table duplicates during population of the hash buckets, resulting in full or partial duplicate elimination that occurs during the hash join operation.

Abstract: Techniques are described herein for processing queries comprising joins specifying a plurality of tables. The techniques involve partitioning the tables by assigning rows to partitions. One or more partition maps may be generated to indicate the partitions. Subsequent tables may be partitioned based on the generated partition maps. The partitions may be used to determine results for the joins.

Abstract: A system may receive a first list of users of a provider network. For each of the first list of users, the system may obtain data pertaining to the user's categories of interest from a social media system; infer video programs based on the data; infer a list of one or more video channels based on the video programs; score the one or more video channels; rank the list of one or more video channels based on the scores; and recommend the ranked list of one or more video channels.