APA (7th ed.) Citation

Wolf, J. L., Dias, D. M., & Yu, P. S. (1990, July). An effective algorithm for parallelizing sort merge joins in the presence of data skew. Databases in Parallel and Distributed Systems: 2nd International Symposium, 103-115. https://doi.org/10.1145/319057.319072

Chicago Style (17th ed.) Citation

Wolf, Joel L., Daniel M. Dias, and Philip S. Yu. "An Effective Algorithm for Parallelizing Sort Merge Joins in the Presence of Data Skew." Databases in Parallel and Distributed Systems: 2nd International Symposium Jul. 1990: 103-115. https://doi.org/10.1145/319057.319072.

MLA (9th ed.) Citation

Wolf, Joel L., et al. "An Effective Algorithm for Parallelizing Sort Merge Joins in the Presence of Data Skew." Databases in Parallel and Distributed Systems: 2nd International Symposium, Jul. 1990, pp. 103-115, https://doi.org/10.1145/319057.319072.