Approximate Query Processing over Static Sets and Sliding Windows

Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and multisets to support approximate versions of the operations rank(i) (i.e., computing sum_{j = i}) queries. We study multiple types of approximations (allowing an error in the query or the result) and present lower bounds and succinct data structures for several variants of the problem. We also extend our model to sliding windows, in which we process a stream of elements and compute suffix sums. This is a generalization of the window summation problem that allows the user to specify the window size at query time. Here, we provide an algorithm that supports updates and queries in constant time while requiring just (1+o(1)) factor more space than the fixed-window summation algorithms.

[1]  Roy Friedman,et al.  Give me some slack: Efficient network measurements , 2019, Theor. Comput. Sci..

[2]  Srikanta Tirthapura,et al.  Distributed Streams Algorithms for Sliding Windows , 2004, Theory of Computing Systems.

[3]  Roy Friedman,et al.  Heavy hitters in streams and sliding windows , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[4]  Roy Friedman,et al.  Optimal elephant flow detection , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[5]  Mikkel Thorup,et al.  Time-space trade-offs for predecessor search , 2006, STOC '06.

[6]  Roy Friedman,et al.  Efficient Summing over Sliding Windows , 2016, ArXiv.

[7]  Peter Bro Miltersen.  Cell probe complexity-a survey , 1999 .

[8]  Gonzalo Navarro,et al.  Fast, Small, Simple Rank/Select on Bitmaps , 2012, SEA.

[9]  Frédéric Giroire,et al.  Estimating the Number of Active Flows in a Data Stream over a Sliding Window , 2007, ANALCO.

[10]  Kunihiko Sadakane,et al.  Practical Entropy-Compressed Rank/Select Dictionary , 2006, ALENEX.

[11]  Rajeev Raman,et al.  Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.

[12]  Guy Joseph Jacobson,et al.  Succinct static data structures , 1988 .

[13]  Piotr Indyk,et al.  Maintaining Stream Statistics over Sliding Windows , 2002, SIAM J. Comput..

[14]  David R. Clark,et al.  Efficient suffix trees on secondary storage , 1996, SODA '96.

[15]  Rinivasa,et al.  Compressed bit vectors based on variable-to-fixed encodings , 2016 .

[16]  Rajeev Raman,et al.  Optimal Indexes for Sparse Bit Vectors , 2013, Algorithmica.

[17]  Roy Friedman,et al.  Fast Flow Volume Estimation , 2017, ICDCN.

[18]  Rajeev Raman,et al.  Succinct Dynamic Data Structures , 2001, WADS.

[19]  Wing-Kai Hon,et al.  Succinct data structures for Searchable Partial Sums with optimal worst-case performance , 2011, Theor. Comput. Sci..

[20]  S. Srinivasa Rao,et al.  Rank/select operations on large alphabets: a tool for text indexing , 2006, SODA '06.

[21]  S. Srinivasa Rao,et al.  Space Efficient Suffix Trees , 1998, J. Algorithms.

[22]  J. Ian Munro,et al.  Succinct Color Searching in One Dimension , 2017, ISAAC.