Back to Results
First PageMeta Content
Mathematics / Algorithms / Streaming algorithm / Time complexity / Quantile / Applied mathematics / Computational complexity theory / Computer science


A Mergeable Summaries Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, and Ke Yi We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two
Add to Reading List

Document Date: 2013-06-30 22:33:39


Open Document

File Size: 573,05 KB

Share Result on Facebook

Company

SpaceSaving / /

Event

Reorganization / /

Facility

building O / /

IndustryTerm

mergeable heavy hitters algorithm / selection algorithm / post-processing step / data aggregation algorithms / randomized streaming algorithm / binary search / non-mergeable algorithms / random-sample-based and low-discrepancy-based algorithms / simulated sensor network / deterministic merging algorithms / streaming algorithm / merging algorithms / important tool / heavy hitter algorithms / above merging algorithms / sensor network / deterministic streaming algorithm / /

Person

Pankaj K. Agarwal / Graham Cormode / Jeff M. Phillips / /

Position

bounded-universe model / but not vice-versa / /

ProgrammingLanguage

D / /

Technology

merging algorithm / data aggregation algorithms / selection algorithm / MUD algorithm / merging algorithms / above merging algorithms / previous non-mergeable algorithms / randomized algorithms / random-sample-based and low-discrepancy-based algorithms / mergeable heavy hitters algorithm / randomized streaming algorithm / heavy hitter algorithms / second algorithm / deterministic merging algorithms / GK algorithm / two merging algorithms / streaming algorithm / two algorithms / deterministic streaming algorithm / /

SocialTag