7 ms·
Readings in Databases
- etrain 12y agoSee also: http://www.cs286.net/home/reading-list http://www.cs286.net/home/reading-list - Joe Hellerstein's graduate database class.
- tokenrove 12y agoGreat list. Almost anything Jim Gray wrote, or any of Michael Stonebraker's C-store stuff, is worth reading. Database Systems: The Complete Book by Garcia-Molina, Ullman, and Widom seems to be one of the few full books with decent coverage of implementing a database, even though anyone wanting to implement a modern database will have to go a long way from what it covers. There are a ton of great papers out there easily accessible, though, at least in part thanks to the VLDB Endowment. The people at MS Research working on databases publish a lot of great papers, too.
- binarymax 12y agoAbsolutely agree. Also for those interested in query processing and optimization I highly recommend some of the fundamental stuff by Goetz Graefe. http://dblife.cs.wisc.edu/person/Goetz_Graefe http://dblife.cs.wisc.edu/person/Goetz_Graefe
- justinmk 12y agolink to "Anatomy of a Database System: Joe Hellerstein"[1] appears to be broken. [1] http://mitpress.mit.edu/books/chapters/0262693143chapm2.pdf http://mitpress.mit.edu/books/chapters/0262693143chapm2.pdf
- etrain 12y agohttp://db.cs.berkeley.edu/cs286/papers/anatomy-redbook2005.pdf http://db.cs.berkeley.edu/cs286/papers/anatomy-redbook2005.p...
- handojin 12y agoChris Date, Database in Depth No idea if legal... http://uk-corp.org/Books/Database/Database_in_Depth.pdf http://uk-corp.org/Books/Database/Database_in_Depth.pdf
- Nzen 12y agoNope, this is an illicit file sharing site. O'Reilly publishes Date's book. uk-corp's whois record has a privacy stand in. These could be legit copies or packaged with malware.
- jedanbik 12y agoReally looking forward to reading these. Thanks for contributing.
- ahmett 12y agoPaxos paper is in "Basics" category just like it is meant to be a joke. Even the "Paxos made simple" paper is not easily understood by graduate students as many studies have shown. (see Raft paper for a study on this.)
- marcosdumay 12y agoA "basic" concept is one that other concepts improve upon. The popular association with "easy" is not always true.
- twic 12y agoThat sounds more like a fundamental concept than a basic one.
- jmcatani 12y agoIs there anything like this list for Operating Systems?
- mtdewcmu 12y agoI'm going to speculate that it's less necessary for operating systems, because the equivalent information for OS has found its way into textbooks.
- walterbell 12y agoThese lists (of lists ..) are reinventing early Yahoo/DMOZ/webrings. If lists were available in a parseable format with accurate metadata (title, author, date, publisher), one could monitor github RSS and generate a local master list for analysis. Related: https://github.com/inukshuk/jekyll-scholar https://github.com/inukshuk/jekyll-scholar
- mtdewcmu 12y agoAssuming you're right that this is a trend, I don't think it should be too hard to heuristically pick out likely examples. Assuming most of them are good quality, there should not be so many that it's impossible to pick through the results and do the final formatting manually. Waiting for a standard format to come along could take a while (seen the semantic web yet?).
- walterbell 12y agoThe jekyll-scholar format already exists and is more "semantic" than Markdown. After people read these database papers, perhaps one will understand the value of indexing structured data and convert/fork the list repo to structure the source format. This is easy at the birth of a collaboratively edited project and impossible later. > Assuming you're right that this is a trend Here is one list of lists, https://github.com/sindresorhus/awesome https://github.com/sindresorhus/awesome
- mtdewcmu 12y agoMy experience has been that expecting people to do more work, even a little bit more, doesn't often pan out.
- walterbell 12y agoAt least MS/Google will thank humans for enriching their proprietary knowledge graphs / semantic webs. It may take a few more years for people to realize why they need "personal algos" as much as "personal computing devices". Humans can then feed delectable metadata to their private algos, in addition to feeding large public spiders.
- checker659 12y agoIf you'd like to learn about databases (at least RMDBs anyways), there's a paid course at Harvard's Extension School. It's offered online for graduate credit at $2k a pop. Link : http://www.extension.harvard.edu/courses/database-systems http://www.extension.harvard.edu/courses/database-systems
- zerr 12y agoLink to downloadable video lectures of this would be useful.
- checker659 12y agoIt's a paid course. You probably didn't read my comment in its entirety.
- zerr 12y agoI've read it. Actually, there are no video lectures on this topic at all (i.e. Database implementation in general, not necessary the paid course you mentioned).
- ExpiredLink 12y agoReadings in database research.
- lvh 12y agoMany of the papers linked are case studies based on production systems. Do they count as research, too?
- rxin 12y agoAuthor of the GitHub repo here. I wanted a list of papers that would be essential in building database systems. It was little bit sad to see many members of the community re-discovering and re-inventing the wheels from 30+ years of relational database and systems research. This list of papers should help build a solid foundation.
- tinco 12y agoIt's a nice list but I have the feeling you can read each of these articles and still not be able do write a halfway decent database because there's nothing on how to actually write data to the disk efficiently on any operating system. I for one would be very interested in that, although perhaps the deprecation of spinning disks has reduced the complexity of the issue.
- walterbell 12y ago> how to actually write data to the disk efficiently on any operating system Discussion between Postgres & Linux devs: http://lwn.net/Articles/590214/ http://lwn.net/Articles/590214/ & https://news.ycombinator.com/item?id=7521008 https://news.ycombinator.com/item?id=7521008
- neilc 12y agoperhaps the deprecation of spinning disks has reduced the complexity of the issue SSDs are much more complicated than spinning disks, so if anything the problem has gotten worse.
- tinco 12y agoAre they? see I really need articles about this :) I thought higher bandwidth and lower seek times meant less complexity, but I could be mistaken.
- walterbell 12y agoFirmware on the SSD is actively in the data path, e.g. wear-levelling to ensure that many writes to a single file does not cause a particular block to wear out much earlier than other blocks, reducing overall capacity of the drive.
- St-Clock 12y agoI really loved reading "CAP Twelve Years Later: How the "Rules" Have Changed". This sentence nailed what I thought was wrong with some early decisions in NoSQL systems: "because partitions are rare, there is little reason to forfeit C or A when the system is not partitioned."
- michaelt 12y agoIf you duplicate your data in locations a few hundred milliseconds apart (e.g. America, Europe and Asia [1]) you either need to tolerate inconsistency or have every write take a few hundred milliseconds. If your system requires response times faster than that, the data centres you don't have time to contact behave sort of like they are partitioned all the time. Me, I tolerate writes that take a bit longer to keep things simple :) [1] http://www.nsmith.net/articles/2011-08/latency-between-amazon-web-services-regions/ http://www.nsmith.net/articles/2011-08/latency-between-amazo...
- St-Clock 12y ago"Me, I tolerate writes that take a bit longer to keep things simple :)" It's not just to keep things simple, it's to keep things consistent :-) Some NoSQL systems (e.g., MongoDB) introduced a new P in the equation (Performance) and used this to justify a lot of questionable decisions that affected consistency (and durability!). They have come a long way since these early decisions though. If a system considers moderate latency as a partition, it would need to perform partition recovery on every write. That's why I'm not sure considering latency as partition is in line with the CAP theorem. Maybe it is more related to availability though (not sure).
- AlisdairO 12y agoCaveat here is that you're duplicating data in a multi-master scenario. If you have a single write master and multiple read-only instances then consistency is easy to maintain (and suffering when you write from a distance) - obviously you're giving up strict read consistency, but that's enormously easier to model and understand. edit: I guess this is written from a very web-tech point of view, where the assumption is often made that reads will dominate writes. Obviously that's not always the case, and the tradeoffs get a lot more complicated!
- sean_the_geek 12y agoNice list, bookmarked!I am going through the SHARK paper and would say that its definately worth a read.
- AlisdairO 12y agoWonderful list! The C-Store papers are particularly fine reading. For people who looked at this wanting to get going with using database systems (as opposed to creating them), I'd recommend: Learning SQL by Alan Beaulieu SQL Performance Explained by Markus Winand SQL Cookbook by Anthony Molinaro The three of these will take you up to a pretty useful level of SQL knowledge/understanding. The first two are fairly easy reading to boot.
- walterbell 12y agoSee also associative databases: http://www.associativemodel.com/associative_intro.htm http://www.associativemodel.com/associative_intro.htm & http://www.bloorresearch.com/analysis/the-return-of-the-associative-database/ http://www.bloorresearch.com/analysis/the-return-of-the-asso...