{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:55:59Z","timestamp":1770296159056,"version":"3.49.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p>\n            This paper introduces Crescando: a scalable, distributed relational table implementation designed to perform large numbers of queries and updates with guaranteed access latency and data freshness. To this end, Crescando leverages a number of modern query processing techniques and hardware trends. Specifically, Crescando is based on parallel, collaborative scans in main memory and so-called \"query-data\" joins known from data-stream processing. While the proposed approach is not always optimal for a given workload, it provides latency and freshness guarantees for\n            <jats:italic>all<\/jats:italic>\n            workloads. Thus, Crescando is particularly attractive if the workload is unknown, changing, or involves many different queries. This paper describes the design, algorithms, and implementation of a Crescando storage node, and assesses its performance on modern multi-core hardware.\n          <\/jats:p>","DOI":"10.14778\/1687627.1687707","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"706-717","source":"Crossref","is-referenced-by-count":65,"title":["Predictable performance for unpredictable workloads"],"prefix":"10.14778","volume":"2","author":[{"given":"P.","family":"Unterbrunner","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Giannikis","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Alonso","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Fauser","sequence":"additional","affiliation":[{"name":"Amadeus IT Group, SA, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Kossmann","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proc. VLDB '01","author":"A.","year":"2001","unstructured":"A. Ailamaki et. al. Weaving relations for cache performance . In Proc. VLDB '01 , 2001 . A. Ailamaki et. al. Weaving relations for cache performance. In Proc. VLDB '01, 2001."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.180605"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223785"},{"key":"e_1_2_1_4_1","volume-title":"Proc. VLDB '99","author":"P. A.","year":"1999","unstructured":"P. A. Boncz et. al. Database architecture optimized for the new bottleneck: Memory access . In Proc. VLDB '99 , 1999 . P. A. Boncz et. al. Database architecture optimized for the new bottleneck: Memory access. In Proc. VLDB '99, 1999."},{"key":"e_1_2_1_5_1","volume-title":"Proc. CIDR '05","author":"P. A.","year":"2005","unstructured":"P. A. Boncz et. al. Monetdb\/x100 : Hyper-pipelining query execution . In Proc. CIDR '05 , 2005 . P. A. Boncz et. al. Monetdb\/x100: Hyper-pipelining query execution. In Proc. CIDR '05, 2005."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287388"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.50905"},{"key":"e_1_2_1_8_1","volume-title":"Proc. VLDB '91","author":"D.","year":"1991","unstructured":"D. J. DeWitt et. al. An evaluation of non-equijoin algorithms . In Proc. VLDB '91 , 1991 . D. J. DeWitt et. al. An evaluation of non-equijoin algorithms. In Proc. VLDB '91, 1991."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375677"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066201"},{"key":"e_1_2_1_13_1","volume-title":"Novell Technical Whitepaper","author":"Kleen A.","year":"2005","unstructured":"A. Kleen . A numa api for linux . Novell Technical Whitepaper , 2005 . http:\/\/www.novell.com\/-resourcecenter\/ext_item.jsp?itemId=14444. A. Kleen. A numa api for linux. Novell Technical Whitepaper, 2005. http:\/\/www.novell.com\/-resourcecenter\/ext_item.jsp?itemId=14444."},{"key":"e_1_2_1_14_1","volume-title":"Proc. ICDE '07","author":"C.","year":"2007","unstructured":"C. Lang et. al. Increasing buffer-locality for multiple relational table scans through grouping and throttling . Proc. ICDE '07 , 2007 . C. Lang et. al. Increasing buffer-locality for multiple relational table scans through grouping and throttling. Proc. ICDE '07, 2007."},{"key":"e_1_2_1_15_1","volume-title":"Proc. VLDB '93","author":"Lomet D. B.","year":"1993","unstructured":"D. B. Lomet . Key range locking strategies for improved concurrency . In Proc. VLDB '93 , 1993 . D. B. Lomet. Key range locking strategies for improved concurrency. In Proc. VLDB '93, 1993."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/128765.128770"},{"key":"e_1_2_1_17_1","volume-title":"Proc. VLDB '08","author":"L.","year":"2008","unstructured":"L. Qiao et. al. Main-memory scan sharing for multi-core cpus . Proc. VLDB '08 , 1(1), 2008 . L. Qiao et. al. Main-memory scan sharing for multi-core cpus. Proc. VLDB '08, 1(1), 2008."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497414"},{"key":"e_1_2_1_19_1","volume-title":"MySQL Technical Whitepaper","author":"Ronstr\u00f6m M.","year":"2004","unstructured":"M. Ronstr\u00f6m and L. Thalmann . Mysql cluster architecture overview: High availability features of mysql cluster . MySQL Technical Whitepaper , 2004 . http:\/\/www.techworld.com\/whitepapers\/index.cfm?-whitepaperid=5663. M. Ronstr\u00f6m and L. Thalmann. Mysql cluster architecture overview: High availability features of mysql cluster. MySQL Technical Whitepaper, 2004. http:\/\/www.techworld.com\/whitepapers\/index.cfm?-whitepaperid=5663."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543628"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/974750.974755"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42203"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/216585.216588"},{"key":"e_1_2_1_25_1","volume-title":"Proc. VLDB '07","author":"M.","year":"2007","unstructured":"M. Zukowski et. al. Cooperative scans : Dynamic bandwidth sharing in a dbms . In Proc. VLDB '07 , 2007 . M. Zukowski et. al. Cooperative scans: Dynamic bandwidth sharing in a dbms. In Proc. VLDB '07, 2007."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1687627.1687707","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:31:09Z","timestamp":1672227069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1687627.1687707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.14778\/1687627.1687707"],"URL":"https:\/\/doi.org\/10.14778\/1687627.1687707","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}