An adaptive packed-memory array

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 20-29

  Bender, Michael A ^a   Hu, Haodong ^a  

^a Stony Brook University   (United States)

Author keywords

Adaptive packed memory array; Cache oblivious; Locality preserving; Packed memory array; Range query; Rebalance; Sequential file maintenance; Sequential scan; Sparse array

Indexed keywords

COMPUTER SIMULATION; DATA STRUCTURES; MAGNETIC DISK STORAGE; QUERY PROCESSING; SOFTWARE PACKAGES;

ADAPTIVE PACKED-MEMORY ARRAY (APMA); AMORTIZED ELEMENT; LOCALITY PRESERVING; PACKED-MEMORY ARRAY; RANGE QUERY; SEQUENTIAL SCAN; SIZED ARRAY;

STORAGE ALLOCATION (COMPUTER);

EID: 34250669251     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142355     Document Type: Conference Paper

References (20)

1. M. A. Bender, R. Cole, E. D. Demaine, and M. Farach-Colton. Scanning and traversing: Maintaining data for traversals in a memory hierarchy. In Proc. 10th Annual European Symposium on Algorithms (ESA), volume 2461 of Lecture Notes in Computer Science, pages 139-151, 2002.
2. M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS), pages 399-409, 2000.
3. M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. SIAM Journal on Computing, 35(2):341-358, 2005.
4. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annual Symposium on Discrete Mathematics (SODA), pages 29-38, 2002.
5. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. Journal of Algorithms, 3(2):115-136, 2004.
6. M. A. Bender, M. Farach-Colton, and B. Kuszmaul. Cache-oblivious string B-trees. In Proc. 25th Symposium on Principles of Database Systems (PODS), 2006.
7. M. A. Bender, M. Farach-Colton, and M. Mosteiro. Insertion sort is O(n log n). In Proc. 3rd International Conference on Fun with Algorithms (FUN), pages 16-23, 2004.
8. M. A. Bender, J. T. Fineman, S. Gilbert, and B. C. Kuszmaul. Concurrent cache-oblivious B-trees. In Proc. 17th Annual Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 228-237, 2005.
9. G. S. Brodal. R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proc. 13th Annual Symposium on Discrete Algorithms (SODA), pages 39-48, 2002.
10. P. F. Dietz. Maintaining order in a linked list. In Proc. Symposium on the Theory of Computing (STOC), pages 122-127, 1982.
11. P. F. Dietz, J. I. Seiferas, and J. Zhang. A tight lower bound for on-line monotonie list labeling. In Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT), volume 824 of Lecture Notes in Computer Science, pages 131-142, 1994.
12. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proc. 19th Annual Symposium on Theory of Computing (STOC), pages 365-372, 1987.
13. P. F. Dietz and J. Zhang. Lower bounds for monotonic list labeling. In Proc. 2nd Scandinavian Workshop on Algorithm Theory (SWAT), volume 447 of Lecture Notes in Computer Science, 1990.
14. A. Itai, A. G. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In Proc. 8th Internationl Colloquium on Automata, Languages, and Programming (ICALP), volume 115 of Lecture Notes in Computer Science, pages 417-431, 1981.
15. I. Katriel. Implicit data structures based on local reorganizations. Master's thesis, Technion - Israel List. of Tech., Haifa, May 2002.
16. V. Raman. Locality-preserving dictionaries: theory and application to clustering in databases. In Proc. 18th Symposium on Principles of Database Systems (PODS), pages 337-345, 1999.
17. A. K. Tsakalidis. Maintaining order in a generalized linked list. Acta Informatica, 21(1):101-112, 1984.
18. D. Willard. Maintaining dense sequential flies in a dynamic environment (extended abstract). In Proc. 14th Annual Symposium on Theory of Computing (STOC), pages 114-121, 1982.
19. D. E. Willard. Good worst-case algorithms for inserting and deleting records in dense sequential files. In Proc. International Conference on Management of Data (SIGMOD), pages 251-260, 1986.
20. D. E. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation, 97(2): 150-204, 1992.