Identifying frequent items in distributed data sets (Q488300): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61717246, #quickstatements; #temporary_batch_1711055989931 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4542551 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient top-K query calculation in distributed networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding frequent items in data streams / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4945525 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Identifying frequent items in a network using gossip / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4247202 / rank | |||
Normal rank | |||
Revision as of 13:12, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Identifying frequent items in distributed data sets |
scientific article |
Statements
Identifying frequent items in distributed data sets (English)
0 references
26 January 2015
0 references
frequency
0 references
aggregation
0 references
gossip-based algorithms
0 references
frequent items discovery
0 references
most frequent items in large-scale distributed datasets
0 references
