Where Does Big Data Meet Big Database - QCon 2012

2,810 views

Published on

Published in: Technology
0 Comments
5 Likes
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total views
2,810
On SlideShare
0
From Embeds
0
Number of Embeds
1,113
Actions
Shares
0
Downloads
108
Comments
0
Likes
5
Embeds 0
No embeds

No notes for slide

Where Does Big Data Meet Big Database - QCon 2012

  1. 1. Welcome
  2. 2. It used to be easy…
  3. 3. they all looked pretty much alike
  4. 4. NoSQL BigData MapReduce Graph Document Shared Column EventualBigTable CAP Nothing Oriented Consistency ACID BASE Mongo Coudera HadoopVoldemort Cassandra Dynamo Marklogic Redis Velocity Hbase Hypertable Riak BDB
  5. 5. Now it’s downrightc0nfuZ1nG!
  6. 6. What Happened?
  7. 7. we changed scale
  8. 8. tack ge dwe ch an
  9. 9. so where doesbig data meetbig database?
  10. 10. The world’s largest NoSQL database?
  11. 11. The Internet
  12. 12. So how Big is Big?Everything (500,000) Web Pages (40) 0.01% Words (0.6) 1% Sizes in Petabytes
  13. 13. Many more Big Sources mobile weather sensors Social Logs data audio video
  14. 14. But it is pretty usefulMarketingFraud detectionTax EvasionIntelligenceAdvertisingScientific research
  15. 15. Gartner80% of business is conducted on unstructured information
  16. 16. Big Data is now a new class of economic asset* *World economic forum 2012
  17. 17. Yet 80% Enterprise Databases < 1TB
  18. 18. Along came the Big Data Movement
  19. 19. MapReduce (2004)•  Large, distributed, ordered map•  Fault-tolerant file system•  Petabyte scaling
  20. 20. DisruptiveSimplePragmaticSolved an insoluble problemUnencumbered by tradition (good & bad)Hacker rather than Enterprise culture
  21. 21. A Different FocusTradition The new wave•  Global consistency •  Local consistency•  Schema driven •  Schemaless / Last•  Reliable Network •  Unreliable Network•  Highly Structured •  Semi-structured/ Unstructured
  22. 22. Novel?Possibly better put as:A timely and elegant combination of existingideas, placed together to solve a previouslyunsolved problem.
  23. 23. Backlash (2009)Not novel (dates back to the 80’s)Physical level not the logical level (messy?)Incompatible with toolingLack of integrity (referential) & ACIDMR is brute force ignoring indexing, scew
  24. 24. All points are reasonable
  25. 25. And they proved it too!“A comparison of Approaches to Large ScaleData Analysis” – Sigmod 2009 •  Vertica vs. DBMSX vs. Hadoop •  Vertica up to 7 x faster than Hadoop over benchmarks Databases faster than Hadoop
  26. 26. But possibly missed the point?
  27. 27. MapReduce was not supposed to be a Data Warehousing tool?
  28. 28. If you need more, layer it on top For example Tensing & Magastore @ Google
  29. 29. So MapReduce represents abottom-up approach to accessing very large data sets that is unencumbered by the past.
  30. 30. …and the Database Field knew it had Problems
  31. 31. We Lose: Joe Hellerstein (Berkeley) 2001 “Databases are commoditised and corneredto slow-moving, evolving, structure intensive,applications that require schema evolution.“ …“The internet companies are lost and we willremain in the doldrums of the enterprisespace.” …“As databases are black boxes which require alot of coaxing to get maximum performance”
  32. 32. Yet they do some very cool stuff Statistically based optimisers, Compression, indexing structures, distributed optimisers, their own declarative language
  33. 33. They are an Awesome Tool
  34. 34. They Don’t talk our Language
  35. 35. They Default to Constraint
  36. 36. So NoSurprise with NoSQL then Simpler Contract Shared nothing No joins / ACID No impedance mismatch No slow schema evolution Simple code paths Just works
  37. 37. The NoSQL Approach Simple, flexible storage over a diverse range of data structures that willscale almost indefinitely.
  38. 38. Different Flavours
  39. 39. Two Ways In: Key Based Access Client
  40. 40. Two Ways In: Broadcast to Every Node Client
  41. 41. So..A simple bottom up approach to data storagethat scales almost indefinitely.•  No relations•  No joins•  No SQL•  No Transactions•  No sluggish schema evolution
  42. 42. The Relational Database
  43. 43. The ‘Relational Camp’ had been busy too Realisation that the traditional architecture was insufficient for various modern workloads
  44. 44. End of an Era Paper - 2007“Because RDBMSs can be beaten by morethan an order of magnitude on the standardOLTP benchmark, then there is no marketwhere they are competitive. As such, theyshould be considered as legacy technologymore than a quarter of a century in age, forwhich a complete redesign and re-architectingis the appropriate next step.” – MichaelStonebraker
  45. 45. No Longer a One-Size-Fits-All
  46. 46. Architecting for Different Non- Functionals Shared In-Memory Nothing / Disk Fast Column Network/ Orientation SSD
  47. 47. In-Memory
  48. 48. Distributed In-Memory
  49. 49. Shared Disk Architecture Single nodeCache can handlesits any queryabovewholedataset All machines see all data
  50. 50. Shared Nothing Architecture Cache Queries hit every node over just the shard •  Autonomy over a shard •  Divide and conqueror (non-key hit every node)
  51. 51. Vendors polarise over this issueShared Nothing Shared Everything•  TerraData (Aster Data) •  Oracle RAC/Exadata•  Netezza (IBM) •  IBM purescale•  ParAccel •  Sybase IQ•  Vertica •  Microsoft SQL Server•  Greenplumb (there is some blurring)
  52. 52. Column Oriented StorageColumns laid contiguously2-10x compression typicalIndexing becomes less important.Pinpoint I/O slow (tuple construction)Bulk read/write fasterCompression >> row-based alternatives
  53. 53. Solid State Drives1ms 1µs HDD Seek Time SSD Drive •  Traditional databases are designed for sequential access over magnetic drives, not random access over SSD. •  Weakens the columnar/row argument
  54. 54. Faster Networking RAM 10Gigabit Ethernet RDMA Gigabit Ethernet1ms 1µs 1ns HDD Seek Time SSD Drive
  55. 55. The best technologies of the momentare leveraging many of these factors
  56. 56. There is a new and impressive breed•  Products < 5 years old•  Shared nothing with SSD’s over shards•  Large address spaces (256GB+)•  No indexes (column oriented)•  No referential integrity•  Surprisingly quick for big queries when compared with incumbent technologies.
  57. 57. TPC-H BenchmarksSeveral new contenders with good scores: –  Exasol –  ParAccel –  Vectorwise
  58. 58. TPC-H Benchmarks•  Exasol has 100GB -> 10TB benchmarks•  Up to 20x faster than nearest rivals (But take benchmarks with a pinch of salt)
  59. 59. Relational ApproachSolid data from every angle,bounded in terms of scale,but with a boundary that is rapidly expanding.
  60. 60. Comparisons
  61. 61. At the extreme MapReduce has itTB 0 1 10 100 1000 10,000
  62. 62. But there is massive overlapTB 0 1 10 100 1000 10,000
  63. 63. It’s not just data volume/velocity
  64. 64. The Dimensions of Data•  Volume (pure physical size)•  Velocity (rate of change)•  Variety (number of different types of data, formats and sources)•  Static & Dynamic Complexity
  65. 65. Consider the characteristics of data to beintegrated, and how that equates to cost
  66. 66. Ability to model data is much more of agating factor than raw size, particularly when considering new forms of data Dave Campbell (Microsoft – VLDB Keynote)
  67. 67. It becomes about your data and you want to do with itDo you need to more than just SQL to process your data?Does your data change rapidly?Are you ok with some degree of eventual consistency?Do isolation and consistency matterDo you need to answer questions absolutely or within a tolerance?Do you want to keep your data in its natural form?Do you prefer to work bottom up or top down?How risk averse are you?Are you willing to pay big vendor prices?
  68. 68. Composite OfferingsHadoop has Pig & HbaseMongo offers Query Language, atomaticity & MROracle have BigData appliance with ClouderaIBM have a Map Reduce offeringSybase (now part of SAP) provides MR nativelyEMC acquired Greenplum which has MR support
  69. 69. Complementary Solutions
  70. 70. Relational world has focused onkeeping data consistent and wellstructured so it can be sliced and diced at will
  71. 71. Big data technologies focus onexecuting code next to data, wherethat data is held in a more natural form.
  72. 72. So•  NoSQL has disrupted the database market, questioning the need for constraint and highlighting the power of simple solutions.•  DB startups are providing some surprisingly fast solutions that drop some traditional database tenets and cleverly leverage new hardware advances.•  Your problem (and budget) is likely a better guide than the size of the data•  The market is converging on both sides towards a middle ground and integrated suites of complementary tools.
  73. 73. The right tool for the job“Attempting to force one technology or tool tosatisfy a particular need for which another toolis more effective and efficient is likeattempting to drive a screw into a wall with ahammer when a screwdriver is at hand: thescrew may eventually enter the wall but atwhat cost?” E.F. Codd, 1993
  74. 74. Thankshttp://www.benstopford.com

×