{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:38:06Z","timestamp":1743097086324,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031001222"},{"type":"electronic","value":"9783031001239"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-00123-9_6","type":"book-chapter","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:14:54Z","timestamp":1651007694000},"page":"88-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$$\\mu $$-join: Efficient Join with Versioned Dimension Tables"],"prefix":"10.1007","author":[{"given":"Mika","family":"Takata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Goda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaru","family":"Kitsuregawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"issue":"4","key":"6_CR1","first-page":"353","volume":"8","author":"R Barber","year":"2014","unstructured":"Barber, R., et al.: Memory-efficient hash joins. PVLDB 8(4), 353\u2013364 (2014)","journal-title":"PVLDB"},{"issue":"7","key":"6_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"1\u20132","key":"6_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(96)00132-6","volume":"171","author":"P Bosc","year":"1997","unstructured":"Bosc, P., Dubois, D., Pivert, O., Prade, H.: Flexible queries in relational databases - the example of the division operator. Theor. Comput. Sci. 171(1\u20132), 281\u2013302 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/91.366566","volume":"3","author":"P Bosc","year":"1995","unstructured":"Bosc, P., Pivert, O.: SQLF: a relational database language for fuzzy querying. IEEE Trans. Fuzzy Syst. 3(1), 1\u201317 (1995)","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"6_CR5","unstructured":"Chatziantoniou, D., Ross, K.A.: Querying multiple features of groups in relational databases. In: VLDB, vol. 96, pp. 295\u2013306 (1996)"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/245882.245907","volume":"25","author":"A Eisenberg","year":"1996","unstructured":"Eisenberg, A.: New standard for stored procedures in SQL. SIGMOD Rec. 25(4), 81\u201388 (1996)","journal-title":"SIGMOD Rec."},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1009726021843","volume":"1","author":"J Gray","year":"1997","unstructured":"Gray, J., et al.: Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub totals. Data Min. Knowl. Discov. 1(1), 29\u201353 (1997)","journal-title":"Data Min. Knowl. Discov."},{"key":"6_CR8","volume-title":"Transaction Processing: Concepts and Techniques","author":"J Gray","year":"1993","unstructured":"Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann, Burlington (1993)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, A., et al.: Amazon redshift and the case for simpler data warehouses. In: SIGMOD, pp. 1917\u20131923 (2015)","DOI":"10.1145\/2723372.2742795"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Hosain, S., Jamil, H.: Algebraic operator support for semantic data fusion in extended SQL. In: ICCTIS, pp. 1\u20136. IEEE (2010)","DOI":"10.1109\/UKRICIS.2010.5898129"},{"issue":"1","key":"6_CR11","first-page":"1","volume":"10","author":"D Jiang","year":"2016","unstructured":"Jiang, D., et al.: Cohort query processing. PVLDB 10(1), 1\u201312 (2016)","journal-title":"PVLDB"},{"key":"6_CR12","volume-title":"The Data Warehouse Toolkit: The Complete Guide to Dimensional Modeling","author":"R Kimball","year":"2011","unstructured":"Kimball, R., Ross, M.: The Data Warehouse Toolkit: The Complete Guide to Dimensional Modeling. Wiley, Hoboken (2011)"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF03037022","volume":"1","author":"M Kitsuregawa","year":"1983","unstructured":"Kitsuregawa, M., Tanaka, H., Moto-Oka, T.: Application of hash to data base machine and its architecture. New Gener. Comput. 1(1), 63\u201374 (1983)","journal-title":"New Gener. Comput."},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s007780000031","volume":"9","author":"S Manegold","year":"2000","unstructured":"Manegold, S., Boncz, P.A., Kersten, M.L.: Optimizing database architecture for the new bottleneck: memory access. VLDB J. 9(3), 231\u2013246 (2000)","journal-title":"VLDB J."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Patel, J.M., Carey, M.J., Vernon, M.K.: Accurate modeling of the hybrid hash join algorithm. In: SIGMETRICS, pp. 56\u201366 (1994)","DOI":"10.1145\/183019.183025"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/6314.6315","volume":"11","author":"LD Shapiro","year":"1986","unstructured":"Shapiro, L.D.: Join processing in database systems with large main memories. ACM Trans. Database Syst. 11(3), 239\u2013264 (1986)","journal-title":"ACM Trans. Database Syst."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Stonebraker, M., et al.: C-store: a column-oriented DBMS. In: Making Databases Work: The Pragmatic Wisdom of Michael Stonebraker, pp. 491\u2013518. ACM\/Morgan & Claypool (2019)","DOI":"10.1145\/3226595.3226638"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Yu, X., et al.: PushdownDB: accelerating a DBMS using S3 computation. In: ICDE, pp. 1802\u20131805. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00174"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-00123-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:15:44Z","timestamp":1651007744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-00123-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031001222","9783031001239"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-00123-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2022.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"543","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was originally planned to take place in Hyberabad, India. 24 other papers are included in the volume.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}