{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:13:33Z","timestamp":1775247213253,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,10,11]],"date-time":"2018-10-11T00:00:00Z","timestamp":1539216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["Priority Program 2037"],"award-info":[{"award-number":["Priority Program 2037"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["Collaborative Research Center 1053"],"award-info":[{"award-number":["Collaborative Research Center 1053"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Datenbank Spektrum"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s13222-018-0297-6","type":"journal-article","created":{"date-parts":[[2018,10,11]],"date-time":"2018-10-11T05:27:09Z","timestamp":1539235629000},"page":"203-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scalable Data Management on Modern Networks"],"prefix":"10.1007","volume":"18","author":[{"given":"Carsten","family":"Binnig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,11]]},"reference":[{"issue":"1","key":"297_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/1900000036","volume":"5","author":"S Babu","year":"2013","unstructured":"Babu S et al (2013) Massively parallel databases and mapreduce systems. Found Trend Datab 5(1):1\u2013104","journal-title":"Found Trend Datab"},{"key":"297_CR2","doi-asserted-by":"crossref","first-page":"1463","DOI":"10.1145\/2723372.2750547","volume-title":"ACM SIGMOD","author":"C Barthels","year":"2015","unstructured":"Barthels C et al (2015) Rack-scale in-memory join processing using RDMA. In: ACM SIGMOD, pp\u00a01463\u20131475"},{"issue":"5","key":"297_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.14778\/3055540.3055545","volume":"10","author":"C Barthels","year":"2017","unstructured":"Barthels C et al (2017) Distributed join algorithms on thousands of cores. Proceedings VLDB Endowment 10(5):517\u2013528","journal-title":"Proceedings VLDB Endowment"},{"issue":"6","key":"297_CR4","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1007\/s00778-014-0359-9","volume":"23","author":"C Binnig","year":"2014","unstructured":"Binnig C et al (2014) Distributed snapshot isolation: global transactions pay globally, local transactions pay locally. VLDB\u00a0J 23(6):987\u20131011","journal-title":"VLDB J"},{"issue":"7","key":"297_CR5","doi-asserted-by":"publisher","first-page":"528","DOI":"10.14778\/2904483.2904485","volume":"9","author":"C Binnig","year":"2016","unstructured":"Binnig C et al (2016) The end of slow networks: It\u2019s time for a redesign. Proceedings VLDB Endowment 9(7):528\u2013539","journal-title":"Proceedings VLDB Endowment"},{"key":"297_CR6","first-page":"1:1","volume-title":"ACM DaMoN@SIGMOD","author":"M Bl\u00f6cher","year":"2018","unstructured":"Bl\u00f6cher M et al (2018) Boosting scalable data analytics with modern programmable networks. In: ACM DaMoN@SIGMOD ACM, pp\u00a01:1\u20131:3"},{"key":"297_CR7","first-page":"251","volume-title":"Proc. of ACM SIGMOD","author":"M Brantner","year":"2008","unstructured":"Brantner M et al (2008) Building a database on S3. In: Proc. of ACM SIGMOD, pp\u00a0251\u2013264"},{"issue":"1","key":"297_CR8","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/3092701","volume":"35","author":"H Chen","year":"2017","unstructured":"Chen H et al (2017) Fast in-memory transaction processing using RDMA and HTM. ACM Trans Comput Syst 35(1):3:1\u20133:37","journal-title":"ACM Trans Comput Syst"},{"issue":"1-2","key":"297_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.14778\/1920841.1920853","volume":"3","author":"C Curino","year":"2010","unstructured":"Curino C et al (2010) Schism: a workload-driven approach to database replication and partitioning. Proceedings VLDB Endowment 3(1-2):48\u201357","journal-title":"Proceedings VLDB Endowment"},{"key":"297_CR10","unstructured":"DDR3 SDRAM Standard. www.jedec.org\/standards-documents\/docs\/jesd-79-3d . Accessed 19 Oct 2016"},{"key":"297_CR11","first-page":"408","volume-title":"ICPP","author":"A Devulapalli","year":"2005","unstructured":"Devulapalli A et al (2005) Distributed queue-based locking using advanced network features. In: ICPP, pp\u00a0408\u2013415"},{"key":"297_CR12","first-page":"401","volume-title":"Proc. of NSDI","author":"A Dragojevi\u0107","year":"2014","unstructured":"Dragojevi\u0107 A et al (2014) FaRM: Fast remote memory. In: Proc. of NSDI, pp\u00a0401\u2013414"},{"key":"297_CR13","first-page":"54","volume-title":"Proc. of OSDI","author":"A Dragojevi\u0107","year":"2015","unstructured":"Dragojevi\u0107 A et al (2015) No compromises: distributed transactions with consistency, availability, and performance. In: Proc. of OSDI, pp\u00a054\u201370"},{"issue":"1","key":"297_CR14","first-page":"3","volume":"40","author":"A Dragojevic","year":"2017","unstructured":"Dragojevic A et al (2017) RDMA reads: to use or not to use? IEEE Data Eng Bull 40(1):3\u201314","journal-title":"IEEE Data Eng. Bull"},{"key":"297_CR15","first-page":"73","volume-title":"IEEE SRDS 2005","author":"S Elnikety","year":"2005","unstructured":"Elnikety S et al (2005) Database replication using generalized snapshot isolation. In: IEEE SRDS 2005, pp\u00a073\u201384"},{"key":"297_CR16","unstructured":"Feldman M (2010) RoCE: an Ethernet-Infiniband love story. HPC Wire. https:\/\/www.hpcwire.com\/2010\/04\/22\/roce_an_ethernet-infiniband_love_story\/"},{"key":"297_CR17","unstructured":"Firestone D et al (2018) Azure accelerated networking: SmartNICs in the public cloud. NSDI, 51\u201366. https:\/\/www.usenix.org\/conference\/nsdi18\/presentation\/firestone . Accessed: 13 Apr 2018"},{"key":"297_CR18","volume-title":"Using advanced MPI: modern features of the message-passing interface","author":"W Gropp","year":"2014","unstructured":"Gropp W et al (2014) Using advanced MPI: modern features of the message-passing interface. MIT Press, Cambridge"},{"key":"297_CR19","volume-title":"Infiniband architecture specification release 1.2.1","author":"Infiband Trade Association","year":"2010","unstructured":"Infiband Trade Association (2010) Infiniband architecture specification release 1.2.1. http:\/\/www.infinibandta.org\/ . Accessed 19 Oct 2016"},{"key":"297_CR20","volume-title":"InfiniBand Roadmap","author":"Infiband Trade Association","year":"2013","unstructured":"Infiband Trade Association (2013) InfiniBand Roadmap. http:\/\/www.infinibandta.org\/ . Accessed 19 Oct 2016"},{"key":"297_CR21","first-page":"295","volume-title":"Proc. of ACM SIGCOMM","author":"A Kalia","year":"2014","unstructured":"Kalia A et al (2014) Using rdma efficiently for key-value services. In: Proc. of ACM SIGCOMM, pp\u00a0295\u2013306"},{"key":"297_CR22","first-page":"185","volume-title":"Proc. of OSDI","author":"A Kalia","year":"2016","unstructured":"Kalia A et al (2016) FaSST: fast, scalable and simple distributed transactions with two-sided (RDMA) datagram RPCs. In: Proc. of OSDI, pp\u00a0185\u2013201"},{"issue":"1","key":"297_CR23","doi-asserted-by":"publisher","first-page":"253","DOI":"10.14778\/1687627.1687657","volume":"2","author":"T Kraska","year":"2009","unstructured":"Kraska T et al (2009) Consistency rationing in the cloud: pay only when it matters. Proceedings VLDB Endowment 2(1):253\u2013264","journal-title":"Proceedings VLDB Endowment"},{"issue":"2","key":"297_CR24","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1006\/jcss.1997.1527","volume":"55","author":"V Krishnaswamy","year":"1997","unstructured":"Krishnaswamy V et al (1997) Relative serializability: an approach for relaxing the atomicity of transactions. J\u00a0Comput Syst Sci 55(2):344\u2013354","journal-title":"J Comput Syst Sci"},{"key":"297_CR25","volume-title":"CIDR 2015, Online Proceedings","author":"JJ Levandoski","year":"2015","unstructured":"Levandoski JJ et al (2015) High performance transactions in deuteronomy. In: CIDR 2015, Online Proceedings"},{"key":"297_CR26","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1145\/2723372.2751519","volume-title":"ACM SIGMOD","author":"S Loesing","year":"2015","unstructured":"Loesing S et al (2015) On the design and scalability of distributed shared-data databases. In: ACM SIGMOD, pp\u00a0663\u2013676"},{"key":"297_CR27","first-page":"103","volume-title":"Proc. of USENIX ATC","author":"C Mitchell","year":"2013","unstructured":"Mitchell C et al (2013) Using one-sided RDMA reads to build a fast, CPU-efficient key-value store. In: Proc. of USENIX ATC, pp\u00a0103\u2013114"},{"key":"297_CR28","first-page":"583","volume-title":"IEEE CCGrid","author":"S Narravula","year":"2007","unstructured":"Narravula S et al (2007) High performance distributed lock management services using network-based remote atomic operations. In: IEEE CCGrid, pp\u00a0583\u2013590"},{"issue":"7","key":"297_CR29","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/1965724.1965751","volume":"54","author":"J Ousterhout","year":"2011","unstructured":"Ousterhout J et al (2011) The case for RAMCloud. Commun ACM 54(7):121\u2013130","journal-title":"Commun ACM"},{"issue":"2","key":"297_CR30","doi-asserted-by":"publisher","first-page":"85","DOI":"10.14778\/2078324.2078325","volume":"5","author":"A Pavlo","year":"2011","unstructured":"Pavlo A et al (2011) On predictive modeling for optimizing transaction execution in parallel oltp systems. Proceedings VLDB Endowment 5(2):85\u201396","journal-title":"Proceedings VLDB Endowment"},{"key":"297_CR31","first-page":"61","volume-title":"Proc. of ACM SIGMOD","author":"A Pavlo","year":"2012","unstructured":"Pavlo A et al (2012) Skew-aware automatic database partitioning in shared-nothing, parallel oltp systems. In: Proc. of ACM SIGMOD, pp\u00a061\u201372"},{"key":"297_CR32","volume-title":"ACM SIGMOD","author":"O Polychroniou","year":"2014","unstructured":"Polychroniou O et al (2014) Track join: distributed joins with minimal network traffic. In: ACM SIGMOD"},{"key":"297_CR33","first-page":"430","volume-title":"Proc. of EBDT","author":"A Quamar","year":"2013","unstructured":"Quamar A et al (2013) SWORD: scalable workload-aware data placement for transactional workloads. In: Proc. of EBDT, pp\u00a0430\u2013441"},{"key":"297_CR34","volume-title":"ICDCIT","author":"S Ramesh","year":"2008","unstructured":"Ramesh S et al (2008) Optimizing distributed joins with bloom filters. In: ICDCIT"},{"key":"297_CR35","volume-title":"ICDE","author":"W R\u00f6diger","year":"2014","unstructured":"R\u00f6diger W et al (2014) Locality-sensitive operators for parallel main-memory database clusters. In: ICDE"},{"issue":"1","key":"297_CR36","first-page":"27","volume":"40","author":"A Salama","year":"2017","unstructured":"Salama A et al (2017) Rethinking distributed query execution on high-speed networks. IEEE Data Eng Bull 40(1):27\u201337","journal-title":"IEEE Data Eng Bull"},{"key":"297_CR37","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1145\/3127479.3132018","volume-title":"SoCC","author":"A Sapio","year":"2017","unstructured":"Sapio A et al (2017) DAIET: a system for data aggregation inside the network. In: SoCC ACM, p 626"},{"key":"297_CR38","volume-title":"CLUSTER","author":"H Subramoni","year":"2009","unstructured":"Subramoni H et al (2009) RDMA over ethernet \u2013 a\u00a0preliminary study. In: CLUSTER"},{"key":"297_CR39","first-page":"1571","volume-title":"ACM SIGMOD","author":"DY Yoon","year":"2018","unstructured":"Yoon DY et al (2018) Distributed lock management with RDMA: decentralization without starvation. In: ACM SIGMOD, pp\u00a01571\u20131586"},{"issue":"6","key":"297_CR40","doi-asserted-by":"publisher","first-page":"685","DOI":"10.14778\/3055330.3055335","volume":"10","author":"E Zamanian","year":"2017","unstructured":"Zamanian E et al (2017) The end of a myth: distributed transaction can scale. Proceedings VLDB Endowment 10(6):685\u2013696","journal-title":"Proceedings VLDB Endowment"}],"container-title":["Datenbank-Spektrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13222-018-0297-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-018-0297-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-018-0297-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T19:30:02Z","timestamp":1775244602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13222-018-0297-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,11]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["297"],"URL":"https:\/\/doi.org\/10.1007\/s13222-018-0297-6","relation":{},"ISSN":["1618-2162","1610-1995"],"issn-type":[{"value":"1618-2162","type":"print"},{"value":"1610-1995","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,11]]},"assertion":[{"value":"11 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}