skip to main content
10.1145/170035.170062acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article
Free Access

Using shared virtual memory for parallel join processing

Authors Info & Claims
Published:01 June 1993Publication History

ABSTRACT

In this paper, we show that shared virtual memory, in a shared-nothing multiprocessor, facilitates the design and implementation of parallel join processing algorithms that perform significantly better in the presence of skew than previously proposed parallel join processing algorithms. We propose two variants of an algorithm for parallel join processing using shared virtual memory, and perform a detailed simulation to investigate their performance. The algorithm is unique in that it employs both the shared virtual memory paradigm and the message-passing paradigm used by current shared-nothing parallel database systems. The implementation of the algorithm requires few modifications to existing shared-nothing parallel database systems.

References

  1. BBDW83.D. Bitton, H. Boral, et al. Parallel algorithms for the execution of relational database operations. A CM Trans. on Database Systems, 8(3), September 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. CBZ91.J. B. Carter, j. K. Bonnet, and W. Zwaenepoel. Implementation and performance of Muffin. In Proc. of the 1991 Syrup. on Operating SyMem Principles, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. DG85.D. J. DeWitt and R. Gerber. Multiprocessor hash-based join algorithms. In Proe. of the 1$th VLDB Conf., 1985.Google ScholarGoogle Scholar
  4. DGS+90.D. DeWitt, S. Ghandeharizadeh, D. Schneider et al. The Gamma database machine project. IEEE Trans. on Knowledge and Data Engineering, 2(1), March 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. DNSS92.D. J. DeWitt, J. F. Naughton, D. A. Schneider, and S. Seshadri. Practical skew handling in parallel joins. In Proc. of the 19th VLDB Conf., August 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. ELZ86.D.L. Eager, E. D. Lazowska, and J. Zahorjan. Adaptive load sharing in homogeneous distributed systems. IEEE Trans. on Software Engineering, SE-12(5), May 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. ESW78.R. Epstein, M. Stonebraker, and E. Wong. Distributed query processing in a relational database system. In Proc. of the A CM-SIGMOD Conf., 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. GD90.S. Ghandeharizadeh and D. J. DeWitt. Hybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machines. In Proc. of the 16th VLDB Conf., September 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. HD91.H. I. Hsiao and D. J. DeWitt. A performance study of three high-availabillty data replication strategies. In Proc. of the 1st int'l Conf. on Parallel and Distributed Systems, December 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. HL91.K. A. Hua and C. Lee. Handling data skew in multiprocessor database computers using partition tuning. In Proc. of the 17th VLDB Conf., August 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. HT88.M. Hsu and V.-O. Tam. Managing databases in distributed virtual memory. Technical Report TR-07-88, Aiken Computation Lab., Harvard Univ., March 1988.Google ScholarGoogle Scholar
  12. HT89.M. Hsu and V.-O. Tam. Transaction synchronization in distributed shared virtual memory systems. Technical Report TR-05-89, Center for Research in Computing Technology, Harvard Univ., 1989.Google ScholarGoogle ScholarCross RefCross Ref
  13. KO90.M. Kitsuregawa and Y. Ogawa. Bucket spreading parallel hash: A new, robust, parallel hash join method for data skew in the Super Database Computer (SDC). In Proc. of the 16#h VLDB Conf., August 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. LH89.K. Li and P. Hudak. Memory coherence in shared virtual memory systems. A CM Transactions on Computer Systems, 7(4), November 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. LKB87.M. Livny, S. Khoshafian, and H. Boral. Multi-disk management algorithms. In Proc. of the 1987 A CM-SIGMETRICS Conf., May 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. LT91.H. Lu and K.-L.Tan. A dynamic and load-bManced taskoriented approach to parallel query processing. DISC Technical Report TPtC7/91, National University of Singapore, July 1991.Google ScholarGoogle Scholar
  17. LTS90.H. Lu, K.-L. Tan, and M.-C. Shaxl. Hash-based join algorithms for multiprocessor computers with shared memory. In Proe. of the 16th VLDB Con}., September 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. LY90.M. S. Lakshmi and P. S. Yu. Effectiveness of parallel joins. IEEE Trans. on Knowledge and Da#a Engineering, 2(4), December 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Omi91.E. Omiecinski. Performance analysis of a ioaxt balancing hash-join algorithm for a shared memory multiprocessor. In Proc. of the 17th VLDB Conf., September 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. RE78.D. Ries and R. Epstein. Evaluation of distribution criteria for distributed database systems. UCB/ERL Technical Report M78/22, University of California, Berkeley, May 1978.Google ScholarGoogle Scholar
  21. Sch90.H. Schwetman. CSIM users' guide. MCC Tech Report ACT-126-90, Microelectronics and Computer Technology Corp., March 1990.Google ScholarGoogle Scholar
  22. SD89.D. A. Schneider and D. J. DeWitt. A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment. In Proc. of the A CM-SIGMOD Conf., June 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. SD90.D. Schneider and D. J. DeWitt. Tradeoffs in processing complex join queries via hashing in multiprocessor database machines. In Proc. of #he 16#h VLDB Conf., September 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. WDJ91.C. B. Walton, A. G. Dale, and R. M. Jenevein. A taxonomy and performance model of data skew effects in parallel joins. In Proc. of the 17th VLDB Conf., September 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. WDYT90.J. L. Wolf, D. M. Dias, et al. An effective algorithm for parallelizing hash joins in the presence of data skew. IBM T. J. Watson Research Center Tech Report RC 15510, 1990.Google ScholarGoogle Scholar

Index Terms

  1. Using shared virtual memory for parallel join processing

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in
                • Published in

                  cover image ACM Conferences
                  SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data
                  June 1993
                  566 pages
                  ISBN:0897915925
                  DOI:10.1145/170035

                  Copyright © 1993 ACM

                  Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 1 June 1993

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • Article

                  Acceptance Rates

                  Overall Acceptance Rate785of4,003submissions,20%

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader