ACM Home Page
Please provide us with feedback. Feedback
Using shared virtual memory for parallel join processing
Full text PdfPdf (1.08 MB)
Source International Conference on Management of Data archive
Proceedings of the 1993 ACM SIGMOD international conference on Management of data table of contents
Washington, D.C., United States
Pages: 119 - 128  
Year of Publication: 1993
ISBN:0-89791-592-5
Also published in ...
Authors
Ambuj Shatdal  Computer Sciences Department, University of Wisconsin-Madison
Jeffrey F. Naughton  Computer Sciences Department, University of Wisconsin-Madison
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 30,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/170035.170062
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

BBDW83
CBZ91
 
DG85
D. J. DeWitt and R. Gerber. Multiprocessor hash-based join algorithms. In Proe. of the 1$th VLDB Conf., 1985.
 
DGS+90
 
DNSS92
 
ELZ86
ESW78
 
GD90
 
HD91
 
HL91
 
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.
 
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.
 
KO90
LH89
LKB87
 
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.
 
LTS90
 
LY90
 
Omi91
 
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.
 
Sch90
H. Schwetman. CSIM users' guide. MCC Tech Report ACT-126-90, Microelectronics and Computer Technology Corp., March 1990.
SD89
 
SD90
 
WDJ91
 
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.

CITED BY  11

Collaborative Colleagues:
Ambuj Shatdal: colleagues
Jeffrey F. Naughton: colleagues