Abstract: The invention is a method and system of updating address data representative of a changed address. Updates are accomplished by initiating an address data request at a client system. The request is transmitted to an application host system where it is translated into a format readable by a master system comprising change of address files. The interface between the application host system and the master system includes a translation step. The translation step begins by creating a data map representative of the address data request. The created data map is compared against either a mailing list correction (MLC) scheme or a multi-line optical character reader (MLOCR) scheme to establish a second data map representative of the address request. The second data map is then transmitted via a SCSI interface to the master system for processing of the address request. The master system matches the address data request to records of address changes to determine whether a match exists.

Abstract: A device and method is disclosed for using a data structure known as a cube forest for use in a batch-load-then-read-intensively system. The device and method significantly improve the time to execute a bit vector query. Hierarchically split cube forests provide a method for efficiently duplicating information, and can be optimized to reduce update and storage costs. Cube forests including hierarchically split cube forests are most appropriate for read-intensive, update-rarely-and-in-large-batches multidimensional applications in an off-the-shelf (low cost) hardware environment. A method and an apparatus for querying a cube forest for aggregates are disclosed herein.