Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Distributed joins and data placement for minimal network traffic
Polychroniou O., Zhang W., Ross K.  ACM Transactions on Database Systems 43 (3): 1-45, 2018. Type: Article
Date Reviewed: Jan 13 2022

This paper introduces the track join algorithm, which greatly reduces the network traffic and total execution time of join queries between distributed database tables. Even fast hardware still struggles with large datasets. Reducing communication via software is a good solution. But for a good solution to be perfect, the overload on the local central processing units (CPUs) must be reduced, too. Track join fulfills such an endeavor by finding a balance between network cost and CPU cost, which is achieved by optimizing a transfer schedule for each distinct join key after tracking the initial location of the data of that key, which in return allows for efficient and reduced data placement across all nodes over the network.

In fact, track join favors data locality, which means: move the computations, not the data, but create locality on purpose. This job is done through phases--the algorithms are clearly outlined and explained in the paper. In addition, two theorems on the optimality of the approach are instantiated and their proofs well elaborated. Besides the basic illustrations that are offered in order to exemplify the track join algorithm, there are also 17 figures that illustrate the analysis of simulating the overall system performance (network costs, CPU costs, query execution times, and so on).

The paper is very well organized and contains adequate material regarding its analysis of algorithms. It is recommended to distributed database designers and researchers, as well as optimization computer scientists.

Reviewer:  Mario Antoine Aoun Review #: CR147400
Bookmark and Share
  Featured Reviewer  
General (H.0 )
Database Management (H.2 )
Would you recommend this review?
Other reviews under "General": Date
Understanding movement in context with heterogeneous data
Derin O., Mitra A., Stroila M., Custers B., Meulemans W., Roeloffzen M., Verbeek K.  MOVE 2019 (Proceedings of the 1st ACM SIGSPATIAL International Workshop on Computing with Multifaceted Movement Data, Chicago, IL,  Nov 5, 2019) 1-4, 2019. Type: Proceedings
Sep 22 2021
Automated expertise retrieval: a taxonomy-based survey and open issues
Gonçalves R., Dorneles C.  ACM Computing Surveys 52(5): 1-30, 2019. Type: Article
Aug 31 2021
 An army of me: sockpuppets in online discussion communities
Kumar S., Cheng J., Leskovec J., Subrahmanian V.  WWW 2017 (Proceedings of the 26th International World Wide Web Conference, Perth, Australia,  Apr 3-7, 2017) 857-866, 2017. Type: Proceedings
Jun 21 2021

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2022 ThinkLoud, Inc.
Terms of Use
| Privacy Policy