Abstract
We consider Persistence, a new online problem concerning optimizing weighted observations in a stream of data when the observer has limited buffer capacity. A stream of weighted items arrive one at a time at the entrance of a buffer with two holding locations. A processor (or observer) can process (observe) an item at the buffer location it chooses, deriving this way the weight of the observed item as profit. The main constraint is that the processor can only move synchronously with the item stream. Persistence is the online problem of scheduling the processor movements through the buffer so that its total derived value is maximized under this constraint. We study the performance of the straight-forward heuristic Threshold, i.e., forcing the processor to “follow” an item through the whole buffer only if its value is above a threshold. We analyze both the optimal offline and Threshold algorithms in the cases where the input stream is either a random permutation, or its items are iid valued. We show that in both cases the competitive ratio achieved by the Threshold algorithm is at least 2/3 when the only statistical knowledge of the items is the median of all possible values. We generalize our results by showing that Threshold, equipped with some minimal statistical advice about the input, achieves competitive ratios in the whole spectrum between 2/3 and 1, following the variation of a newly defined density-like measure of the input. This result is a significant improvement over the case of arbitrary input streams, where we show that no online algorithm can achieve a competitive ratio better than 1/2.
K. Georgiou, G. Karakostas, and E. Kranakis—Research supported in part by NSERC Discovery grant.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ajtai, M., Jayram, T.S., Kumar, R., Sivakumar, D.: Approximate counting of inversions in a data stream. In: Reif, J.H. (ed.) Proceedings of 34th Annual ACM Symposium on Theory of Computing, Montréal, Québec, Canada, 19–21 May 2002, pp. 370–379. ACM (2002)
Alon, N., Duffield, N., Lund, C., Thorup, M.: Estimating arbitrary subset sums with few probes. In: ACM (ed.) Proceedings of the Twenty-Fourth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems: PODS 2005, Baltimore, Maryland, 13–15 June 2005, pp. 317–325. ACM Press (2005)
Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137–147 (1999)
Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 434–443. SIAM (2007)
Bateni, M., Hajiaghayi, M., Zadimoghaddam, M.: Submodular secretary problem and extensions. ACM Trans. Algorithms 9(4), Art. 32, 23 (2013)
Bearden, J.N.: A new secretary problem with rank-based selection and cardinal payoffs. J. Math. Psychol. 50(1), 58–59 (2006)
Cormode, G., Muthukrishnan, S., Rozenbaum, I.: Summarizing and mining inverse distributions on data streams via dynamic inverse sampling. In: Böhm, K., Jensen, C.S., Haas, L.M., Kersten, M.L., Larson, P.-Å., Ooi, B.C. (eds.) VLDB, pp. 25–36. ACM (2005)
Devanur, N.R., Jain, K., Sivan, B., Wilkens, C.A.: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In: Shoham, Y., Chen, Y., Roughgarden, T. (eds.) EC, pp. 29–38. ACM (2011)
Ferguson, T.S.: Who solved the secretary problem? Stat. Sci. 4, 282–289 (1989)
Freeman, P.R.: The secretary problem and its extensions: a review. Int. Stat. Rev./Revue Internationale de Statistique 51, 189–206 (1983)
Georgiou, K., Karakostas, G., Kranakis, E., Krizanc, D.: Know when to persist: deriving value from a stream buffer. CoRR, abs/1604.03009 (2016)
Gianini, J., Samuels, S.M.: The infinite secretary problem. Ann. Probab. 4, 418–432 (1976)
Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: Mehrotra, S., Sellis, T.K. (eds.) SIGMOD Conference, pp. 58–66. ACM (2001)
Hoffman, M., Muthukrishnan, S., Raman, R.: Location streams: Models and algorithms. Technical report, DIMACS TR (2004)
Kleinberg, R.D.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA, pp. 630–631. SIAM (2005)
Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Bernstein, P.A., et al. (eds.) VLDB 2002: Proceedings of the Twenty-Eighth International Conference on Very Large Data Bases, Hong Kong SAR, China, 20–23 August 2002, pp. 346–357. Morgan Kaufmann Publishers (2002)
Muthukrishnan, S.: Data Streams: Algorithms and Applications, vol. 1 (2005)
Muthukrishnan, S.: Data stream algorithms (notes from a series of lectures). In: The 2009 Barbados Workshop on Computational Complexity, 1–8 March 2009
Smith, M.: A secretary problem with uncertain employment. J. Appl. Probab. 12, 620–624 (1975)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Georgiou, K., Karakostas, G., Kranakis, E., Krizanc, D. (2016). Know When to Persist: Deriving Value from a Stream Buffer. In: Dondi, R., Fertin, G., Mauri, G. (eds) Algorithmic Aspects in Information and Management. AAIM 2016. Lecture Notes in Computer Science(), vol 9778. Springer, Cham. https://doi.org/10.1007/978-3-319-41168-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-41168-2_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-41167-5
Online ISBN: 978-3-319-41168-2
eBook Packages: Computer ScienceComputer Science (R0)