Claims
- 1. A method for adding an nth partition to existing partitions of a file and balancing records among the nth partition and existing partitions, by a data processing system having a memory, comprising the steps of:adding an nth partition to the existing partitions; executing a function to determine a partition and an offset for each of one or more records of the existing partitions from an input of an identifier and a total number of partitions; and if the determined partition is the nth partition, moving and inserting the record into the nth partition.
- 2. The method of claim 1 further including the step of:compressing the records of the existing partitions.
- 3. The method of claim 1, wherein if the file has a format of a sequential array of records, the executing step includes the step of:moving and inserting each record at an nth position to the nth partition.
Parent Case Info
This application is a divisional of U.S. application Ser. No. 09/162,256, filed on Sep. 28, 1998, now U.S. Pat. No. 6,473,774 titled “Method and apparatus for record addressing in partitioned files”, which is herein incorporated by reference in its entirety.
US Referenced Citations (11)
Non-Patent Literature Citations (1)
Entry |
Varman et al., An Efficient Multiprocessor Merge Algorithm, Databases, Parallel Architectures and their Applications PARBASE-90 (IEEE), p. 276-283, Mar. 1990. |