Abstract
In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to perform both update and retrieval in O(1) time simultaneously under a memory model in which individual bits may be shared by several words. We also show that two variants (generalizations) of the problem can be solved optimally in Θ(lg N) time under the comparison based model of computation.
Please use the following format when citing this chapter: Brodnik, A., Karlsson, J., Munro, J.I., Nilsson, A., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro, G., Bertossi, L., Kohayakwa, Y., (Boston: Springer), pp. 103–114.
Chapter PDF
References
G. M. Adelson-Velskii and E. M. Landis. An algorithm for the organization of information. In Soviet Math. Doclady 3, pages 1259–1263, 1962.
Alok Aggarwal and Ashok K. Chandra. Virtual memory algoithms (preliminary version). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 173–185. ACM Press, May 2–4 1988.
P. Beame and F. E. Fich. Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences, 65(1):38–72, 2002.
Fredrik Bengtsson and Jingsen Chen. Space-efficient range-sum queries in OLAP. In Yahiko Kambayashi, Mukesh Mohania, and Wolfram Wöß, editors, Data Ware-housing and Knowledge Discovery: 6th International Conference DaWaK, volume 3181 of Lecture Notes in Computer Science, pages 87–96. Springer, September 2004.
Andrej Brodnik. Searching in Constant Time and Minimum Space (MininÆ Res Magni Momenti Sunt). PhD thesis, University of Waterloo, Waterloo, Ontario, Canada, 1995. (Also published as technical report CS-95-41.).
Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, and J. Ian Munro. Worst case constant time priority queue. Journal of System and Software, 78(3):249–256, December 2005.
Andrej Brodnik and John Iaeono. Dynamic predecessor queries. Unpublished manuscript, 2006.
Arash Farzan and J. Ian Munro. Succinct representation of finite abelian groups. In Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, Lecture Notes in Computer Science. Springer, 2006. To appear.
Michael L. Fredman. The complexity of maintaining an array and computing its partial sums. Journal of the ACM, 29(1):250–260, January 1982.
Michael L. Fredman and Michael E. Saks. The cell probe complexity of dynamic data structures. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 345–354. ACM Press, May 14–17 1989.
Matteo Prigo, Charles E. Leiserson, Harald Prokop, and Sridhar Ramachandran. Cache-oblivious algorithms. In IEEE, editor, 40th Annual Symposium on Foundations of Computer Science (FOCS), pages 285–297. IEEE Computer Society, IEEE Computer Society, October 17–19 1999.
Steven P. Geffner, Divyakant Agrawal, Amr El Abbadi, and T. Smith. Relatve prefix sums: An efficient approach for querying dynamic OLAP data cubes. In Proceedings of the 15th International Conference on Data Engineering, pages 328–335, 1999.
Steven P. Ceffner, Mirek Riedewald, Divyakant Agrawal, and Amr El Abbadi. Data cubes in dynamic environments. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, pages 31–40, 1999.
Haripriyan Harnpapuram and Michael L. Fredman. Optimal biweighted binary trees and the complexity of maintaining partial sums. SIAM Journal on Computing, 28(1):1–9, 1998.
C. Ho, R. Agrawal, N. Megiddo, and R. Srikant. Range queries in OLAP data cubes. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 73–88, 1997.
Wing-Kai Hon, Kunihiko Sadakane, and Wing-Kin Sung. Succinct data structure for searchable partial sums. In Toshihide Ibaraki, Naoki Katoh, and Hirotaka Ono, editors, Algorithms and Computation—ISAAC 2003, 14th International Symposium, volume 2906 of Lecture Notes in Computer Science, pages 505–516. Springer, December 2003.
Richard M. Karp and Vijaya Ramachandran. Parallel algorithms for sharedmemeory machines. In van Leeuwen [28]. chapter 17, pages 869–941.
Roni Leben, Marijan Miletić, Marjan Špegel, Andrej Trost, Andrej Brodnik, and Johan Karlsson. Design of high performance memory module on PC100. In Proceedings Electrotechnical and Computer Science Conference, pages 75–78, Slovenia, 1999.
Kjell Lemström, Gonzalo Navarro, and Yoan Pinzon. Practical algorithms for transposition-invariant string-matching. Journal of Discrete Algorithms, 3(24): 267–292, 2005.
Anany Levitin. Introduction to The Design & Analysis of Algorithms. Pearson Education Inc., Addison-Wesley, 2003.
Andreas Nilsson. Data Structures for Bandwidth Reservation and Quiality of Service on the Internet. Lic. thesis, Department of Computer Science and Electrical Engineering, Luleå University of Technology, Luleå, Sweden, April 2004.
W. Paul and J. Simon. Decision trees and random access machines. In Proc. Int’l. Symp. on Logic and Algorithmic, pages 331–340, Zurich, 1980.
Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct dynamic data structure. In Algorithms and Data Structures, 7th International Workshop, volume 2125 of Lecture Notes in Computer Science, pages 426–437. Springer, 8–10 August 2001.
Mirek Riedewald, Divyakant Agrawal, and Amr El Abbadi. Flexible data cubes for online aggregation. In Database Theory—ICDT 2001, 8th International Conference, London, UK, January 4–6, 2001, Proceedings, volume 1973 of Lecture Notes in Computer Science, pages 159–173, 2001.
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi, and Renato Pajarola. Space-efficient data cubes for dynamic environments. In Proceedings of the International Conference on Data Warehousing and Knowledge Discovery (DaWak), pages 24–33, 2000.
L. G. Valiant. General purpose parallel architectures. In van Leeuwen [28]. chapter 18, pages 943–971.
Peter van Erode Boas. Machine models and simulations. In van Leeuwen [28]. chapter 1, pages 3–66.
Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity. Elsevier/MIT Press, Amsterdam, 1990.
Andrew C. Yao. On the complexity of maintaining partial sums. SIAM Journal on Computing, 14(2):277–288, May 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Brodnik, A., Karlsson, J., Munro, J.I., Nilsson, A. (2006). An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds) Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006. IFIP International Federation for Information Processing, vol 209. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34735-6_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-34735-6_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34633-5
Online ISBN: 978-0-387-34735-6
eBook Packages: Computer ScienceComputer Science (R0)