Abstract
New data structures are presented for very fast predecessor queries on integer data sets stored on multiple disks. A structure is presented that supports predecessor queries in one disk seek performed in parallel over multiple disks, no matter how large the data set. For truly massive data sets, the space requirement of this structure approaches twice the space needed to simply store the data on disk.
A second structure is presented that supports predecessor queries in the time it takes to perform two disk seeks, but has more moderate space requirements. Its space usage approaches the space needed to store the data on disk, and has manageable space requirements for smaller massive data sets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1988)
Andersson, A., Miltersen, P.B., Riis, S., Thorup, M.: Static dictionaries on AC 0 rams: Query time \(\Theta(\sqrt{\log n/\log \log n})\) is necessary and sufficient. In: FOCS, pp. 441–450 (1996)
Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. Acta Informatica 1(3), 173–189 (1972)
Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci. 65(1), 38–72 (2002)
Brodal, G.S., Demaine, E.D., Fineman, J.T., Iacono, J., Langerman, S., Munro, J.I.: Cache-oblivious dynamic dictionaries with optimal update/query tradeoff. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, January 17-19, pp. 1448–1456 (2010)
Brodnik, A., Carlsson, S., Fredman, M.L., Karlsson, J., Munro, J.I.: Worst case constant time priority queue. Journal of Systems and Software, 249–259 (2005)
Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer a uf der Heide, F., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: upper and lower bounds. SIAM J. Comput. 23, 738–761 (1994)
Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.G.: Space efficient hash tables with worst case constant access time. Theory Comput. Syst. 38(2), 229–248 (2005)
Fredman, M.L., Saks, M.E.: The cell probe complexity of dynamic data structures. In: STOC, pp. 345–354 (1989)
Leben, R., Miletić, M., Špegel, M., Trost, A., Brodnik, A., Karlsson, J.: Design of a high performance memory module on pc100. In: Proceedings Electrotechnical and Computer Science Conference, Portorož, Slovenia, vol. A, pp. 75–78 (1999)
Miltersen, P.B.: Cell probe complexity — a survey. In: Advances in Data Structures (1999)
Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51(2), 122–144 (2004)
Seeger, B., Larson, P.-Å.: Multi-disk b-trees. In: SIGMOD Conference, pp. 436–445 (1991)
Stallone, S.: First blood. United Artists (1982)
Vitter, J.S.: Algorithms and data structures for external memory. Foundations and Trends in Theoretical Computer Science 2(4), 305–474 (2006)
Vitter, J.S., Shriver, E.A.M.: Algorithms for parallel memory i: Two-level memories. Algorithmica 12(2/3), 110–147 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brodnik, A., Iacono, J. (2010). Unit-Time Predecessor Queries on Massive Data Sets. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17517-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-17517-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17516-9
Online ISBN: 978-3-642-17517-6
eBook Packages: Computer ScienceComputer Science (R0)