Cisco Technology, Inc.

Parstream Gmbh

Norbert Heusser

Robert Edgar Barton

Stephan Edward Friedl

Daniel Eckstein

Anoop Mohan

Yogesh Kumar Soni

Michael Hummel

Jörg Bienert

In one embodiment, a networking device at an edge of a network enrolls with a controller that supervises operation of the networking device. The networking device sends a publication request to a cloud-based messaging service. The networking device provides, to the cloud-based messaging service, identification information that indicates the controller that supervises operation of the networking device. The networking device receives, from the cloud-based messaging service, authorization to publish messages to the cloud-based messaging service. The cloud-based messaging service uses the identification information to confirm an identity of the networking device with the controller that supervises operation of the networking device. The networking device sends, after receiving authorization to publish messages to the cloud-based messaging service, a message for publication to the cloud-based messaging service. The message comprises data sourced from an endpoint in the network.

Zero trust for edge devices

In one embodiment, a networking device at an edge of a network extracts data from traffic in the network using a plurality of protocol connectors of the networking device. The networking device normalizes the data extracted from the traffic in the network, to form normalized data. The networking device applies a data transformation to the normalized data, to form transformed data. The networking device identifies, based on a policy, one or more cloud providers as being authorized to receive the transformed data. The networking device sends the transformed data to the one or more cloud providers.

Edge to multi-cloud data processing and governance

Method and apparatus for performing a database query using a bitmap index in a data-base having a plurality of bitmap vectors, the method comprising the steps of: upon receipt of a query containing a selection condition, creating a filter bitmap based on the query input; performing a bitmap scan for the filter bitmap in order to determine at least one value of an existing matching data-base entry; determining a bitmap of the determined at least one value; creating a filtered bitmap by combining the filter bitmap with the bitmap of the determined at least one value; determining all entries in the database matching the filtered bitmap; sub-tracting the filtered bitmap from the filter bitmap, thus creating a new filter bitmap; repeating the steps, starting with the step of performing a bitmap scan based on the new filter bitmap, until the step of sub-tracting results in an empty bitmap.

Method and database computer system for performing a database query using a bitmap index

Adaptively compressing an input string () comprising a sequence of symbols in order to create a plurality of segment dictionaries D, with the steps of: generating a lookup map (); generating a key value segment S; searching the lookup map for each symbol received in the input string (); upon detecting a symbol is not stored in the lookup map, adding the symbol by storing the symbol at a next sequential key index in the lookup map lookup map () and assigning a next sequential key value entry to the symbol and adding this key value to the key value segment S(); upon detecting the symbol is stored in the lookup map, adding the corresponding key value assigned to this symbol to the next sequential entry of the key value segment S(); wherein a new key value segment Sof the lookup map is generated if the number of different symbols equals the number of available key values k=2for the opened/current key value segment S(), and where-in the lookup map is converted into a segment dictionary Dif the maximal key value size k=2is reached (), with n being any positive integral number 1 to nmax, nmax denoting the maximal bit size, and m being any positive integral number denoting the consecutive numbering of segment dictionaries D.

Method and apparatus for adaptive data compression

System and method to compress data records by providing data records with a binary structure; dividing the data records into several bit vectors; reducing the size of each bit vector by dividing the bit vector into consecutive partial areas of equal size, each partial area consisting of n bits, classifying the partial areas as trivial partial areas, quasi-trivial partial areas and non-trivial partial areas, combining one non-trivial or several consecutive non-trivial partial areas into one so named R block, and removing the trivial partial areas; as well as combining one quasi-trivial or several consecutive quasi-trivial partial areas into one so named O block.

Growing community of inventors

Bonn, Germany

Norbert Heusser