Abstract: A management system may analyze signal strengths of signals received, from a plurality of devices, by a first device located in a first location of an enclosed structure. The management system may determine, based on analyzing the signal strengths, that a first subset of devices are located outside of the enclosed structure and that a second subset of devices are located inside of the structure. The second subset of devices include a second device and a third device that are stationary. The management system may determine that the first signal strength, of the second device, has increased by an attenuation value and that the second signal strength, of the third device, has decreased by the attenuation value. The management system may determine that the first device has been relocated based on the first signal strength increasing by the attenuation value and the second signal strength decreasing by the attenuation value.

Abstract: A method, a network device, and a non-transitory computer-readable storage medium are described in relation to an device detection and network slice assignment service. The device detection and network slice assignment service may include providing a subnetwork slice connection between a fixed wireless access device and a fifth generation (5G) radio access network device to an end device that is not 5G compatible. The fixed wireless access device may detect the end device based on an identifier included in a network assignment request. The fixed wireless access device may assign a network address, which may be associated with the network slice assignment service, to the end device. The fixed wireless access device may route traffic to and from the end device via the subnetwork slice connection.

Abstract: Disclosed herein are techniques for storing, within a database system, metadata that indicates an intended usage (IU). Once created, an IU may be assigned to a column to (a) indicate how the column is intended to be used, and (b) affect how the database server behaves when database operations involve values from the column. The IU assigned to a column supplements, but does not replace, the datatype definition for the column. Each IU may have an IU-bundle. The IU-bundle of an IU indicates how the database server behaves with respect to any column that is assigned the IU. For example, the IU-bundle may indicate constraints that the database server must validate during operations on values from columns assigned to the IU. Techniques are also described for implementing multi-column IUs and flexible IUs.

Abstract: Techniques for subsumption of inline views and subqueries in a query are described. An optimization technique of subsumption is enabled by inline views having identical tables and identical join conditions and having aggregation functions but no group-by clauses. When subsumption takes place, a single query block replaces the inline views (or subqueries) with a single inline view query block. Subsumption reduces multiple access to the same table and multiple evaluations of the same join conditions required to evaluate the query. The single query block includes factored out filter predicates and unified predicates that originate from the subsumed inline views (or subqueries). Based on similarities among the aggregation functions and filter predicates in the subsumed inline views, pre-computation of common aggregates may be performed in a new group-by view in the subsuming view.

Abstract: Techniques for the automatic creation and maintenance of zone maps are provided. In one technique, a set of data sets is identified. For each data set, a data set width is determined based on a maximum value in the data set and a minimum value in the data set. One or more zones within the data set are identified. For each zone, a zone width is determined based on a difference between a maximum value in that zone and a minimum value in that zone. An aggregate zone width is generated that is based on the zone width of each zone. Based on the data set width and the aggregate zone width, it is determined whether to automatically generate a zone map for the data set.

Abstract: Techniques are described for storing and maintaining, in a materialized view, bitmap data that represents a bitmap of each possible distinct value of an expression and rewriting a query for a count of distinct values of the expression using the materialized view. The materialized view contains bitmap data that represents a bitmap of each possible distinct value of a first expression, and aggregate values of additional expressions, and is stored in memory or on disk by a database system. The database system receives a query that requests a number of distinct values, of the first expression, and an aggregate value for an additional expression. In response, the database system, rewrites the query to: compute the number of distinct values by counting the bits in the bitmap data of the materialized view that are set to the first value, and obtains the aggregate value for the additional expression in the materialized view.

Abstract: Techniques for the automatic creation and maintenance of zone maps are provided. In one technique, a set of data sets is identified. For each data set, a data set width is determined based on a maximum value in the data set and a minimum value in the data set. One or more zones within the data set are identified. For each zone, a zone width is determined based on a difference between a maximum value in that zone and a minimum value in that zone. An aggregate zone width is generated that is based on the zone width of each zone. Based on the data set width and the aggregate zone width, it is determined whether to automatically generate a zone map for the data set.

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 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: 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: Techniques are described for storing and maintaining, in a materialized view, bitmap data that represents a bitmap of each possible distinct value of an expression and rewriting a query for a count of distinct values of the expression using the materialized view. The materialized view contains bitmap data that represents a bitmap of each possible distinct value of a first expression, and aggregate values of additional expressions, and is stored in memory or on disk by a database system. The database system receives a query that requests a number of distinct values, of the first expression, and an aggregate value for an additional expression. In response, the database system, rewrites the query to: compute the number of distinct values by counting the bits in the bitmap data of the materialized view that are set to the first value, and obtains the aggregate value for the additional expression in the materialized view.

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: 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 method and system for processing database queries containing aggregate functions. The query may specify fewer groups than there are processes available to process the queries. Further, the queries may target a set of rows and specify a sort-by key and a group-by key. The method and system further includes determining that the queries specify application of the aggregate function to each of a plurality of groups that may correspond to a plurality of distinct values of the group-by key and determining that plurality of processes are available to process the queries. The method and system also includes determining the plurality of ranges of a composite key that may be formed by combining the group-by key and the sort-by key and assigning each range of the plurality ranges to a corresponding process to calculate the aggregate function.

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: A method and system for processing database queries containing aggregate functions. The query may specify fewer groups than there are processes available to process the queries. Further, the queries may target a set of rows and specify a sort-by key and a group-by key. The method and system further includes determining that the queries specify application of the aggregate function to each of a plurality of groups that may correspond to a plurality of distinct values of the group-by key and determining that plurality of processes are available to process the queries. The method and system also includes determining the plurality of ranges of a composite key that may be formed by combining the group-by key and the sort-by key and assigning each range of the plurality ranges to a corresponding process to calculate the aggregate function.

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: 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 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.