Evan Philip Harris. Towards Optimal Storage Design for Efficient Query Processing in Relational Database Systems. PhD thesis, 1995, Department of Computer Science, The University of Melbourne, Parkville, Victoria 3052, Australia.  Home/Search   Document Details and Download   Summary   Related Articles

....merits. Some new database architectures and join techniques have been proposed in recent years which hold hopes to further improve the performance of join execution in relational database. These techniques include signature method [15, 31, 34] clustering of data tuples and partition of relations [59], join index [28, 61] composite index [33] layered relational database [52] etc. Essentially, the improvements these new techniques made are either better organizing of physical storage of data on the disk to take advantage of some special cases such as sequential disk accesses, or adding some ....

....the third pass, S file is read forwardly from the top to the bottom and tuples at the top of S file don t need to be read again. The name rocking comes from the fact that the reading of S file is done alternatively from the top and from the bottom. Another implementation of the rocking technique [59] is to read S file in a circular manner. This implementation could be useful if forward access is more efficient than backward access, or if backward access is simply impossible. Assume there are m blocks in S file and buffer B s can hold up to 100 blocks. The first pass is to read blocks 1, 2, ....

Evan Philip Harris. Towards Optimal Storage Design for Efficient Query Processing in Relational Database Systems. PhD thesis, 1995, Department of Computer Science, The University of Melbourne, Parkville, Victoria 3052, Australia.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC