Parallel relational operations based on clustered surrogate files

In the context of very large databases, the main problem is how to process relational operations in the minimum amount of time to satisfy user queries. To speed up the relational operations on very large databases, parallel processing is essential. A reasonable indexing scheme for parallel processing systems is the concatenated code word (CCW) surrogate file, which is small in size and requires simple maintenance. Since interrelated relational operations can be performed on the CCW surrogate files, considerable processing time can be saved by performing interrelated relational operations on CCW files before the large data files are accessed. CCW surrogate files can be satisfactorily mapped into parallel architectures because their structure is quite compact and regular. To speed up the relational operations based on CCW surrogate files. it is possible to cluster the CCW surrogate files. If a CCW surrogate file is clustered, only a subset of the surrogate file is searched for a relational operation. Clustered-CCW surrogate file and data file structures suitable for a parallel processing system are introduced. Parallel relational operation algorithms based on the clustered file structures are developed and evaluated.<>