En aquest projecte s'analitza de forma pràctica Recordinality, un algorisme que estima la cardinalitat d'elements en un flux de dades comptan't el nombre de k-records que ocorren en ell.
In this project Recordinality is analyzed in practical way. Recordinality is an algorithm that can estimate the number of distinct elements in a stream by counting the number of k-records ocurring in it. The algorithm has some interesting propeties, such as providing a random sample of set underlyin
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com