| http://dbpedia.org/ontology/abstract
|
In computer science, the count-distinct pr … In computer science, the count-distinct problem(also known in applied mathematics as the cardinality estimation problem) is the problem of finding the number of distinct elements in a data stream with repeated elements.This is a well-known problem with numerous applications. The elements might represent IP addresses of packets passing through a router, unique visitors to a web site, elements in a large database, motifs in a DNA sequence, or elements of RFID/sensor networks.ence, or elements of RFID/sensor networks.
|
| http://dbpedia.org/ontology/wikiPageID
|
44119508
|
| http://dbpedia.org/ontology/wikiPageLength
|
10645
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1103108217
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Random_variable +
, http://dbpedia.org/resource/RFID +
, http://dbpedia.org/resource/Minimum-variance_unbiased_estimator +
, http://dbpedia.org/resource/Router_%28computing%29 +
, http://dbpedia.org/resource/Hash_function +
, http://dbpedia.org/resource/Streaming_algorithms +
, http://dbpedia.org/resource/Streaming_algorithm +
, http://dbpedia.org/resource/Daniel_Kane_%28mathematician%29 +
, http://dbpedia.org/resource/Unique_visitor +
, http://dbpedia.org/resource/IP_addresses +
, http://dbpedia.org/resource/Count%E2%80%93min_sketch +
, http://dbpedia.org/resource/HyperLogLog +
, http://dbpedia.org/resource/Internet_Protocol +
, http://dbpedia.org/resource/Maximum_likelihood +
, http://dbpedia.org/resource/Category:Statistical_algorithms +
, http://dbpedia.org/resource/DNA +
, http://dbpedia.org/resource/Sensor_networks +
, http://dbpedia.org/resource/Philippe_Flajolet +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Mvar +
, http://dbpedia.org/resource/Template:Main +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Statistical_algorithms +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Problem +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Count-distinct_problem?oldid=1103108217&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Count-distinct_problem +
|
| owl:sameAs |
http://dbpedia.org/resource/Count-distinct_problem +
, http://yago-knowledge.org/resource/Count-distinct_problem +
, http://www.wikidata.org/entity/Q18387786 +
, https://global.dbpedia.org/id/mRdH +
, http://rdf.freebase.com/ns/m.0123nb1c +
|
| rdf:type |
http://dbpedia.org/ontology/Disease +
|
| rdfs:comment |
In computer science, the count-distinct pr … In computer science, the count-distinct problem(also known in applied mathematics as the cardinality estimation problem) is the problem of finding the number of distinct elements in a data stream with repeated elements.This is a well-known problem with numerous applications. The elements might represent IP addresses of packets passing through a router, unique visitors to a web site, elements in a large database, motifs in a DNA sequence, or elements of RFID/sensor networks.ence, or elements of RFID/sensor networks.
|
| rdfs:label |
Count-distinct problem
|
