- BigTable
BigTable is a compressed, high performance, and proprietary database system built on
Google File System (GFS), Chubby Lock Service, and a few otherGoogle programs; it is currently not distributed or used outside of Google, although Google offers access to it as part of theirGoogle App Engine . It began in 2004"First an overview. BigTable has been in development since early 2004 and has been in active use for about eight months (about February 2005)." [http://andrewhitchcock.org/?post=214 Google's BigTable] ] and is now used by a number of Google applications, such asMapReduce , which is often used for generating and modifying data stored in BigTable ["Bigtable can be used with MapReduce, a framework for running large-scale parallel computations developed at Google. We have written a set of wrappers that allow a Bigtable to be used both as an input source and as an output target for MapReduce job". pg 3 of "Bigtable: A Distributed Storage System for Structured Data", 2006] ,Google Reader ,"Reader is using Google's BigTable in order to create a haven for what is likely to be a massive trove of items." [http://googlereader.blogspot.com/2005/10/google-reader-two-weeks.html Official Google Reader] blog.]Google Maps ,"There are currently around 100 cells for services such as Print, Search History, Maps, and Orkut." [http://andrewhitchcock.org/?post=214 Google's BigTable] ]Google Book Search , "My Search History",Google Earth ,Blogger.com ,Google Code hosting,Orkut , andYouTube ["Their new solution for thumbnails is to use Google’s BigTable, which provides high performance for a large number of rows, fault tolerance, caching, etc. This is a nice (and rare?) example of actual synergy in an acquisition." [http://kylecordes.com/2007/07/12/youtube-scalability/ YouTube Scalability Talk] ] . Google's reasons for developing its own database include scalability, and better control of performance characteristics. ["We have described Bigtable, a distributed system for storing structured data at Google....Our users like the performance and high availability provided by the Bigtable implementation, and that they can scale the capacity of their clusters by simply adding more machines to the system as their resource demands change over time...Finally, we have found that there are significant advantages to building our own storage solution at Google. We have gotten a substantial amount of flexibility from designing our own data model for Bigtable." from the Conclusion of "Bigtable: A Distributed Storage System for Structured Data", 2006]BigTable is a fast and extremely large-scale DBMS. However, it departs from the typical convention of a fixed number of columns, instead described by the authors as "a sparse, distributed multi-dimensional sorted map", sharing characteristics of both row-oriented and column-oriented databases. BigTable is designed to scale into the
petabyte range across hundreds or thousands of machines, and to make it easy to add more machines to the system and automatically start taking advantage of those resources without any reconfiguration".* [http://radar.oreilly.com/archives/2006/05/database_war_stories_7_google.html "Database War Stories #7: Google File System and BigTable"] ]Each table has multiple
dimension s (one of which is a field fortime , allowingversioning ). Tables are optimized for GFS by being split into multiple "tablets" - segments of the table as split along a row chosen such that the tablet will be ~200megabyte s in size. When sizes threaten to grow beyond a specified limit, the tablets are compressed using the secret algorithms BMDiff [http://blog.outer-court.com/archive/2005-10-23-n61.html Google's Bigtable] ] and Zippy, which are described as less space-optimal thanLZW but more efficient in terms of computing time. The locations in the GFS of tablets are recorded as database entries in multiple special tablets, which are called "META1" tablets. META1 tablets are found by querying the single "META0" tablet, which typically has a machine to itself since it is often queried by clients as to the location of the "META1" tablet which itself has the answer to the question of where the actual data is located. Like GFS' master server, the META0 is not generally abottleneck since the processor time and bandwidth necessary to discover and transmit META1 locations is minimal and clients aggressively cache locations to minimize queries.Other Implementations
The
Hadoop project has made some progress toward a working implementation of BigTable. They call this projectHBase ."Just as Bigtable leverages the distributed data storage provided by the Google File System, HBase will provide Bigtable-like capabilities on top of Hadoop." [ [http://wiki.apache.org/hadoop/Hbase#background HBase - Hadoop Wiki, Background section] ]
Another open source project, [http://www.hypertable.org Hypertable] , launched on
February 4 ,2008 with 0.9 alpha release.ee also
*
MapReduce
*Column-oriented DBMS References
External links
* [http://labs.google.com/papers/bigtable.html Bigtable: A Distributed Storage System for Structured Data] -(official paper; [http://labs.google.com/papers/bigtable-osdi06.pdf PDF] )
* [http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=437 BigTable: A Distributed Structured Storage System] ( [http://video.google.com/videoplay?docid=7278544055668715642&q=bigtable video] )
** [http://www.uwtv.org/programs/displayevent.asp?rid=2787 more video]
** [http://andrewhitchcock.org/?post=214 Google's BigTable] -(notes on the official presentation)
* [http://www.baselinemag.com/article2/0,1540,1985047,00.asp "How Google Works"]
* [http://glinden.blogspot.com/2005/09/googles-bigtable.html "Google's BigTable"] -(from theblog "Geeking with Greg")
* [http://glinden.blogspot.com/2006/05/c-store-and-google-bigtable.html C-Store and Google BigTable]
* [http://www.niallkennedy.com/blog/archives/2006/11/google-mondrian.html Mondrian uses BigTable] - byGuido van Rossum
* [http://wiki.apache.org/lucene-hadoop/Hbase Bigtable-like structured storage for Hadoop HDFS] - (from the Lucene-hadoop wiki)
Wikimedia Foundation. 2010.