A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time

Abstract Consider a file which arranges records in sequential order, and stores them with possible empty spaces in M consecutive pages of memory. We develop an insertion-deletion algorithm which runs in a worst-case time approximately proportional to log 2 M divided by the page-size when the set of manipulated records has cardinality O ( M ).

[1]  George S. Lueker,et al.  Adding range restriction capability to dynamic data structures , 1985, JACM.

[2]  John H. Reif,et al.  Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search , 1989, Inf. Comput..

[3]  W. Randolph Franklin.  Padded Lists: Set Operations in Expected Theta(log log N) Time , 1979, Inf. Process. Lett..

[4]  Dan E. Willard.  Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N) , 1983, Inf. Process. Lett..

[5]  D. Willard,et al.  The Super-B-Tree Algorithm. , 1979 .

[6]  David Gries,et al.  Sorting and Searching Using Controlled Density Arrays , 1978 .

[7]  Paul F. Dietz,et al.  Two algorithms for maintaining order in a list , 1987, STOC.

[8]  Dan E. Willard,et al.  New Data Structures for Orthogonal Range Queries , 1985, SIAM J. Comput..

[9]  George S. Lueker,et al.  A Data Structure for Dynamic Range Queries , 1982, Inf. Process. Lett..

[10]  Yehoshua Perl,et al.  Understanding the Complexity of Interpolation Search , 1977, Inf. Process. Lett..

[11]  Micha Hofri,et al.  Padded Lists Revisited , 1987, SIAM J. Comput..

[12]  Kurt Mehlhorn,et al.  Dynamic Interpolation Search , 1985, ICALP.

[13]  David Gries,et al.  Controlled Density Sorting , 1980, Inf. Process. Lett..

[14]  Dan E. Willard.  New Trie Data Structures Which Support Very Fast Search Operations , 1984, J. Comput. Syst. Sci..

[15]  Dan E. Willard.  Predicate-Oriented Database Search Algorithms , 1978, Outstanding Dissertations in the Computer Sciences.

[16]  Edward G. Coffman,et al.  Algorithms for resolving conflicts in dynamic storage allocation , 1985, JACM.

[17]  Roy Stuart Hallquist.  DYNAMIC STORAGE ALLOCATION. , 1973 .

[18]  Dan E. Willard,et al.  Good worst-case algorithms for inserting and deleting records in dense sequential files , 1986, SIGMOD '86.

[19]  George S. Lueker,et al.  A data structure for orthogonal range queries , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[20]  Dan E. Willard.  Searching Unindexed and Nonuniformly Generated Files in log log N Time , 1985, SIAM J. Comput..

[21]  Alon Itai,et al.  Interpolation search—a log logN search , 1978, CACM.