Subspace exploration: Bounds on Projected Frequency Estimation

Given an n × d dimensional dataset A, a projection query specifies a subset C ⊆ [d] of columns which yields a new n × |C| array. We study the space complexity of computing data analysis functions over such subspaces, including heavy hitters and norms, when the subspaces are revealed only after obser...

Full description

Bibliographic Details

Published in:	Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Vol. 2021; p. 273
Main Authors:	Cormode, Graham, Dickens, Charlie, Woodruff, David P
Format:	Journal Article
Language:	English
Published:	20.06.2021
ISSN:	1055-6338
Online Access:	Get more information
Tags:	Add Tag No Tags, Be the first to tag this record!