Abstract
We propose to store equi-join relationships of tuples on inexpensive and space abundant devices, such as disks, to facilitate query processing. The equi-join relationships are captured, grouped, and stored as various tables, which are collectively called the Join Core. Queries involving arbitrary legitimate sequences of equi-joins, semi-joins, outer-joins, anti-joins, unions, differences, and intersections can all be answered quickly by merely merging these tables. The Join Core can also be updated dynamically. Experimental results showed that all test queries began to generate results instantly, and many completed instantly too. The proposed methodology can be very useful for queries with complex joins of large relations as there are fewer or even no relations or intermediate results needed to be retrieved and generated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Agarawal, S., Chaudhuri, S., and Narasayya, V.: Automated selection of materialized views and indexes for SQL databses. In: VLDB, pp. 496–505 (2000)
Chu, S., Balazinska, M., and Suciu, D.: From theory to practice: efficient join query evaluation in a parallel database system. In: ACM SIGMOD Conference, pp. 63–78 (2015)
DeWitt, D., Gerber, R.: Multiprocessor hash-based join algorithms. In: VLDB, pp. 151–164 (1985)
Goldstein, J., Larson, P.-A.: Optimizing queries using materialized views: a practical, scalable solution. In: ACM SIGMOD, pp. 331–342 (2001)
He, B., Yang, K., Fang, R., Lu, M., Govindaraju, N., Luo, Q., Sander, P.: Relational joins on graphics processors. In: ACM SIGMOD Conference, pp. 511–524 (2008)
Karloff, H., Mihail, M.: On the complexity of the view-selection problem. In: ACM PODS Conference, 167–173 (1999)
Kitsuregawa, M., Tanaka, H., Moto-Oka, T.: Application of hash to data base machine and its architecture. New Gener. Comput. 1(1), 63–74 (1983)
Li, Z., Ross, K.A.: Fast joins using join indices. VLDB J.—Int. J. Very Large Data Bases 8(1), 1–24 (1999)
Pottinger, R., Levy, A.: A scalable algorithm for answering queries using views. In: VLDB Conference, pp. 484–495 (2000)
Valduriez, P.: Join indices. ACM Trans. Datab. Syst. (TODS) 12(2), 218–246 (1987)
Yang, J., Karlapalem, K., Li, Q.: Algorithms for materialized view design in data warehousing environment. In: VLDB, pp. 25–29 (1997)
Storing Join Relationships for Fast Join Query Processing. https://goo.gl/7N3JSd
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Hamdi, M., Yu, F., Alswedani, S., Hou, WC. (2017). Storing Join Relationships for Fast Join Query Processing. In: Benslimane, D., Damiani, E., Grosky, W., Hameurlain, A., Sheth, A., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2017. Lecture Notes in Computer Science(), vol 10438. Springer, Cham. https://doi.org/10.1007/978-3-319-64468-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-64468-4_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64467-7
Online ISBN: 978-3-319-64468-4
eBook Packages: Computer ScienceComputer Science (R0)