the morning paper | a random walk through Computer Science research, by Adrian Colyer
TLDR; this is the last edition of The Morning Paper for now. Plus: one strand of research you won’t want to miss! I was listening to a BBC Radio 4 podcast recently (More or Less: Behind the Stats - Ants and Algorithms) in which the host Tim Harford is interviewing David Sumpter about his recent ... Continue Reading An overview of end-to-end entity resolution for big data, Christophides et al., ACM
Peter Bailis: Highly Available, Seldom Consistent | Peter Bailis
Peter Bailis :: Highly Available, Seldom Consistent Data management, distributed systems, and beyond Index How To Make Fossils Productive Again (30 Apr 2016) You Can Do Research Too (24 Apr 2016) Lean Research (20 Feb 2016) I Loved Graduate School (01 Jan 2016) NSF Graduate Research Fellowship: N=1 Materials for Systems Research (03 Sep 2015) Worst-Case Distributed Systems Design (03 Feb 2015) Whe
GitHub - rxin/db-readings: Readings in Databases
The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb (1997): This paper (and the original one proposed 10 years earlier) illustrates a quantitative formula to calculate whether a data page should be cached in memory or not. It is a delight to read Jim Gray approach to an array of related problems, e.g. how big should a page size be. AlphaSort: A Cache-Sensitive Parallel
æ¾å°¾ãã¿ã®è«–æ–‡ã®æ›¸ã方：英語論文 | æ¾å°¾ 豊
ã‚ーã€ã‚„ã£ã±ã‚Šã“ã®å›½éš›ä¼šè°ã¯é›£ã—ã„ãªã€‚日本人ã»ã¨ã‚“ã©é€šã£ã¦ãªã„ã—ãªã。çµæ§‹é ‘å¼µã£ãŸã‚“ã ã‘ã©ãªã。ã§ã‚‚査èªè€…ã€ãªã‚“ã‹è‰¯ã分ã‹ã‚‰ãªã„ã“ã¨ã‚’言ã£ã¦ã‚‹ã€‚ã“ã„ã¤åˆ†ã‹ã£ã¦ãªã„ãªã€‚ã“ã‚“ãªæŸ»èªè€…ã«å½“ãŸã‚‹ã¨ã¯é‹ãŒæ‚ªã„。３人ä¸ï¼‘人ã¯ã™ã”ãã„ã„コメントãªã®ã«ãªã。ã¾ã€ã„ã„ã‚„ã€ç ”究会論文ã§ã‚‚書ã“ã†ã€‚ （※ã«æˆ»ã‚‹ï¼‰ ç§ã‚‚以å‰ã¯ã“ã‚“ãªæ„Ÿã˜ã§ã—ãŸã€‚主è¦ãªå›½éš›ä¼šè°ã®ãƒ¬ãƒ™ãƒ«ã¯é«˜ã„ã¨æ€ã£ã¦ã¾ã—ãŸã€‚今ã§ã¯ã€ãã†ã¯æ€ã„ã¾ã›ã‚“。何ã¨ã„ã£ã¦ã‚‚ã€ã¾ãšã¯å®Œæˆåº¦ã®å•é¡Œã§ã™ã€‚ 完æˆåº¦ã‚’上ã’ã‚‹ã“ã¨ã®é‡è¦æ€§ 完æˆåº¦ã‚’上ã’ã‚‹ã¨ã¯ã€è‡ªåˆ†ã§ä¿®æ£ã™ã‚‹ã¨ã“ã‚ãŒãªããªã‚‹ã¾ã§ã€ä¿®æ£ã‚’ç¹°ã‚Šè¿”ã™ã“ã¨ã§ã™ã€‚ 上ã®ä¾‹ã§ã¯ã€åˆç¨¿ã®æ®µéšŽã§æŠ•ç¨¿ã—ã¦ã„ã¾ã™ã。ã“ã‚Œã§é€šã›ã‚‹äººã¯èª°ã‚‚ã„ã¾ã›ã‚“。ã“ã“ã§ç§ãŒã‚ˆã目安ã«ä½¿ã£ã¦ã„ã‚‹ï¼’ã¤ã®çµŒé¨“則を紹介ã—ã¾ã—ょã†ã€‚ 執ç†æ™‚é–“ã®æ³•å‰‡ï¼š 経験上ã€æ¬¡ã®ã‚ˆã†ãªæ³•å‰‡ãŒã‚ã‚Šã¾ã™ã€‚「書ã“ã†ã€ã¨æ€ã£ã¦ã‹ã‚‰ã€åˆç¨¿ãŒã§ãã‚‹ã¾ã§ã®æ™‚é–“ã‚’a0ã¨ã—ã¾ã™ã€‚ã™ã‚‹ã¨ã€ç¬¬ï¼’
Achieving Rapid Response Times in Large Online Services
Talk given at Berkeley AMPLab Cloud Seminar, March 26, 2012 (2012) Today’s large-scale web services provide rapid responses to interactive requests by applying large amounts of computational resources to massive datasets. They typically operate in warehouse-sized datacenters and run on clusters of machines that are shared across many kinds of interactive and batch jobs. As these systems distribute
Excellent Papers for 2011
UPDATE: Added Theo Vassilakis as an author for "Dremel: Interactive Analysis of Web-Scale Datasets" Googlers across the company actively engage with the scientific community by publishing technical papers, contributing open-source packages, working on standards, introducing new APIs and tools, giving talks and presentations, participating in ongoing technical debates, and much more. Our publicatio
英語ã§è«–文を書ã“ã†ã¨ã™ã‚‹äººã¸
目次 ãŠã“ã¨ã‚ã‚Š 論文を書ãã¨ãã®ä½œæ¥ã«é–¢ã™ã‚‹ã“㨠辞書ã¯ã©ã‚“ãªãµã†ã«ä½¿ã†ã¨ã‚ˆã„㋠スペルãƒã‚§ãƒƒã‚¯ è«–æ–‡ã®è¡¨è¨˜æ³•ãƒ»å½¢å¼ã«é–¢ã™ã‚‹ã“㨠コンマ，ピリオド，セミコãƒãƒ³ å˜èªžã®é æ–‡å—ã«ã‚ˆã‚‹ç•¥èªžã¨ãã®è¡¨è¨˜ è«–æ–‡ã®è¡¨é¡Œï¼Œã‚»ã‚¯ã‚·ãƒ§ãƒ³ã®ã‚¿ã‚¤ãƒˆãƒ«ï¼Œå›³ã®ã‚ャプションãªã©ã«ãŠã‘る大文å—㨠å°æ–‡å— フォントã«ã¤ã„ã¦ã®æ³¨æ„ "a MIMD machine" 㨠"an MIMD machine" è«–æ–‡ã®æ–‡ä½“ã«é–¢ã™ã‚‹ã“㨠英語論文ã«ãŠã‘る一人称複数 "we" æ–‡é ã® "And", "But" æ–‡ä¸ã® "and", "but" åè©žã®å˜æ•°å½¢ã¨è¤‡æ•°å½¢ï¼Œ"a"ã¨"the" 主部ã¨è¿°éƒ¨ã®é•·ã•ã®ãƒãƒ©ãƒ³ã‚¹ ãŠã¾ã‘ è«–æ–‡ã«ããã‚ãªã„è¡¨ç¾ çŸ¥ã£ã¦ã„ã‚‹ã¨ä¾¿åˆ©ãªè¡¨ç¾ ãŠã“ã¨ã‚ã‚Š ã“ã®æ–‡æ›¸ã¯ï¼Œè‹±èªžã§è«–文を書ãå ´åˆã«æ–‡ä½“ãã®ä»–ã§æœ€ä½Žé™æ³¨æ„ã—ã¦æ¬²ã—ã„ãªã ã¨ç§ãŒæ€ã†ã“ã¨ã‚’æ•´ç†ã—ãŸã‚‚ã®ã§ã‚る．「ã“ã‚ŒãŒæ£ã—ã„英語論文ã ã€ã¨è¨€ã£ã¦ã„ã‚‹ã‚ã‘ã§ã¯ãªãã¦
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Dystopia as a Service | USENIX
Ctlab.org
https://people.eecs.berkeley.edu/~matei/papers/2013/sigmod_shark.pdf
http://www.umiacs.umd.edu/~jimmylin/publications/Busch_etal_ICDE2012.pdf
Spanner: Google’s Globally-Distributed Database
http://vldb.org/pvldb/vol5/p1196_haroldlim_vldb2012.pdf
WEB 2013
The Impact of Memory Subsystem Resource Sharing on Datacenter Applications
Photo Tourism: Microsoft Research, Interactive Visual Media Group
Sort vs. Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs
Application-layer anycasting: a server selection architecture and use in a replicated Web service
http://ccr.sigcomm.org/online/files/p63.pdf
https://dl.acm.org/citation.cfm?id=1920928
{{#tags}}- {{label}}
{{/tags}}