{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:45Z","timestamp":1750307385402,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Queue"],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:p>Would you believe me if I claimed that an algorithm that has been on the books as \"optimal\" for 46 years, which has been analyzed in excruciating detail by geniuses like Knuth and taught in all computer science courses in the world, can be optimized to run 10 times faster? A couple of years ago, I fell into some interesting company and became the author of an open source HTTP accelerator called Varnish, basically an HTTP cache to put in front of slow Web servers. Today Varnish is used by Web sites of all sorts, from Facebook, Wikia, and Slashdot to obscure sites you have surely never heard of.<\/jats:p>","DOI":"10.1145\/1810226.1814327","type":"journal-article","created":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T03:27:33Z","timestamp":1599103653000},"page":"20-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["You\u2019re Doing It Wrong"],"prefix":"10.1145","volume":"8","author":[{"given":"Poul-Henning","family":"Kamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/366786.366800"},{"key":"e_1_2_1_2_1","unstructured":"Williams J. W. J. 1964. Algorithm 232 - Heapsort. Communications of the ACM 7(6): 347***348.  Williams J. W. J. 1964. Algorithm 232 - Heapsort. Communications of the ACM 7(6): 347***348."}],"container-title":["Queue"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810226.1814327","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810226.1814327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:25Z","timestamp":1750245805000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810226.1814327"}},"subtitle":["Think you\u2019ve mastered the art of server performance? Think again."],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":2,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["10.1145\/1810226.1814327"],"URL":"https:\/\/doi.org\/10.1145\/1810226.1814327","relation":{},"ISSN":["1542-7730","1542-7749"],"issn-type":[{"type":"print","value":"1542-7730"},{"type":"electronic","value":"1542-7749"}],"subject":[],"published":{"date-parts":[[2010,6]]},"assertion":[{"value":"2010-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}