{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:02Z","timestamp":1742913842836,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319340982"},{"type":"electronic","value":"9783319340999"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-34099-9_16","type":"book-chapter","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T14:40:35Z","timestamp":1461768035000},"page":"216-224","source":"Crossref","is-referenced-by-count":1,"title":["Non-recursive Approach for Sort-Merge Join Operation"],"prefix":"10.1007","author":[{"given":"Norah","family":"Asiri","sequence":"first","affiliation":[]},{"given":"Rasha","family":"Alsulim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,28]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0003-6870(80)90114-3","volume":"11","author":"S Agate","year":"1980","unstructured":"Agate, S., Drury, C.: Electronic calculators: which notation is the better? Appl. ergonomics 11(1), 2\u20136 (1980)","journal-title":"Appl. ergonomics"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Al-Rawi, A., Lansari, A., Bouslama, F.: A new non-recursive algorithm for binary search tree traversal. In: 10th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2003 (2003)","DOI":"10.1109\/ICECS.2003.1301900"},{"issue":"10","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.14778\/2336664.2336678","volume":"5","author":"MC Albutiu","year":"2012","unstructured":"Albutiu, M.C., Kemper, A., Neumann, T.: Massively parallel sort-merge joins in main memory multi-core database systems. Proc. VLDB Endowment. 5(10), 1064\u20131075 (2012)","journal-title":"Proc. VLDB Endowment."},{"key":"16_CR4","unstructured":"Capasso, T.: Evaluate Logical Expressions Using Recursive CTEs and Reverse Polish Notation. Penton Business Media, Inc (2014)"},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1109\/69.506709","volume":"8","author":"MS Chen","year":"1996","unstructured":"Chen, M.S., Yu, P., Wu, K.L.: Optimization of parallel execution for multi-join queries. IEEE Trans. Knowl. Data Eng. 8(3), 416\u2013428 (1996)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Graefe, G.: Rule-based query optimization in extensible database systems (1987)","DOI":"10.1007\/3-540-50345-5_36"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.14778\/1687553.1687564","volume":"2","author":"C Kim","year":"2009","unstructured":"Kim, C., et al.: Sort vs. hash revisited: fast join implementation on modern multi-core cpus. Proc. VLDB Endowment 2(2), 1378\u20131389 (2009)","journal-title":"Proc. VLDB Endowment"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Kim, W.: A new way to compute the product and join of relations. In: Proceedings of the 1980 ACM SIGMOD International Conference on Management of Data (1980)","DOI":"10.1145\/582250.582278"},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1080\/00207160410001660826","volume":"81","author":"P Krtolica","year":"2004","unstructured":"Krtolica, P., Stanimirovi, P.: Reverse polish notation method. Int. J. Comput. Math. 81(3), 273\u2013284 (2004)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/128762.128764","volume":"24","author":"P Mishra","year":"1992","unstructured":"Mishra, P., Eich, M.: Join processing in relational databases. ACM Comput. Surv. (CSUR) 24(1), 63\u2013113 (1992)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"16_CR11","first-page":"652","volume-title":"Fundamentals of Database Systems","author":"S Navathe","year":"2010","unstructured":"Navathe, S., Elmasri, R.: Fundamentals of Database Systems, pp. 652\u2013660. Pearson Education, Upper Saddle River (2010)"},{"key":"16_CR12","unstructured":"Ono, K., Lohman, G.: Measuring the complexity of join enumeration in query optimization. In: VLDB (1990)"},{"key":"16_CR13","unstructured":"Taniar, D., Tan, R.B.N.: Parallel processing of multi-join expansion-aggregate data cube query in high performance database systems. In: International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002 (2002)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Wilschut, A., Flokstra, J., Apers, P.: Parallel evaluation of multi-join queries. In: ACM SIGMOD Record (1995)","DOI":"10.1145\/223784.223803"}],"container-title":["Communications in Computer and Information Science","Beyond Databases, Architectures and Structures. Advanced Technologies for Data Mining and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-34099-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T22:40:00Z","timestamp":1567809600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-34099-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319340982","9783319340999"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-34099-9_16","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}