high_scalability high_scalability-2014 high_scalability-2014-1620 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: Caching is not new of course, but I don't think I've heard of caching store procedure results before. It's like memoization in the database. Brent Ozar covers this idea in How to Cache Stored Procedure Results . The benefits are the usual for doing work in the database, it doesn't take per developer per app work, just code it once in the stored proc and it works for everyone, everywhere, for all of time. The disadvantage is the usual as well, it adds extra load to a probably already busy database, so it should only be applied to heavy computations. Brent positions this strategy as an emergency bandaid to apply when you need to take pressure off a database now. Developers can then work on moving the cache off the database and into its own tier. Interesting idea. And as the comments show the implementation is never as simple as it seems.
sentIndex sentText sentNum sentScore
1 Caching is not new of course, but I don't think I've heard of caching store procedure results before. [sent-1, score-0.811]
2 Brent Ozar covers this idea in How to Cache Stored Procedure Results . [sent-3, score-0.205]
3 The benefits are the usual for doing work in the database, it doesn't take per developer per app work, just code it once in the stored proc and it works for everyone, everywhere, for all of time. [sent-4, score-1.486]
4 The disadvantage is the usual as well, it adds extra load to a probably already busy database, so it should only be applied to heavy computations. [sent-5, score-1.284]
5 Brent positions this strategy as an emergency bandaid to apply when you need to take pressure off a database now. [sent-6, score-0.908]
6 Developers can then work on moving the cache off the database and into its own tier. [sent-7, score-0.464]
7 And as the comments show the implementation is never as simple as it seems. [sent-9, score-0.421]
wordName wordTfidf (topN-words)
[('procedure', 0.339), ('memoization', 0.279), ('proc', 0.279), ('usual', 0.277), ('disadvantage', 0.233), ('ozar', 0.233), ('brent', 0.227), ('emergency', 0.19), ('positions', 0.171), ('stored', 0.163), ('heard', 0.147), ('busy', 0.144), ('pressure', 0.144), ('everywhere', 0.143), ('covers', 0.141), ('database', 0.136), ('caching', 0.129), ('cache', 0.128), ('adds', 0.126), ('applied', 0.12), ('extra', 0.119), ('work', 0.115), ('comments', 0.114), ('benefits', 0.112), ('heavy', 0.11), ('apply', 0.1), ('per', 0.095), ('course', 0.093), ('show', 0.09), ('implementation', 0.09), ('everyone', 0.089), ('strategy', 0.085), ('seems', 0.085), ('moving', 0.085), ('developer', 0.085), ('probably', 0.084), ('take', 0.082), ('results', 0.08), ('app', 0.071), ('already', 0.071), ('never', 0.071), ('developers', 0.069), ('store', 0.067), ('works', 0.064), ('idea', 0.064), ('simple', 0.056), ('interesting', 0.054), ('think', 0.049), ('code', 0.048), ('well', 0.047)]
simIndex simValue blogId blogTitle
same-blog 1 1.0000001 1620 high scalability-2014-03-27-Strategy: Cache Stored Procedure Results
Introduction: Caching is not new of course, but I don't think I've heard of caching store procedure results before. It's like memoization in the database. Brent Ozar covers this idea in How to Cache Stored Procedure Results . The benefits are the usual for doing work in the database, it doesn't take per developer per app work, just code it once in the stored proc and it works for everyone, everywhere, for all of time. The disadvantage is the usual as well, it adds extra load to a probably already busy database, so it should only be applied to heavy computations. Brent positions this strategy as an emergency bandaid to apply when you need to take pressure off a database now. Developers can then work on moving the cache off the database and into its own tier. Interesting idea. And as the comments show the implementation is never as simple as it seems.
2 0.13768297 936 high scalability-2010-11-09-Facebook Uses Non-Stored Procedures to Update Social Graphs
Introduction: Facebook's Ryan Mack gave a MySQL Tech Talk where he talked about using what he called Non-stored Procedures for adding edges to Facebook's social graph. The question is: how can edges quickly be added to the social graph? The answer is ultimately one of deciding where logic should be executed, especially when locks are kept open during network hops. Ryan explained a key element of the Facebook data model are the connections between people, things they've liked, and places they've checked-in. A lot of their writes are adding edges to the social graph. Currently this is a two step process, run inside a transaction: add a new edge into the graph if the add was successful then increment the number of edges on a node This approach works until there's a very hot node that is being added to rapidly. For example, a popular game adds a new character and everyone likes it at the same time or a new album comes out and everyone likes it at the same time. They were limited to
3 0.11614078 360 high scalability-2008-08-04-A Bunch of Great Strategies for Using Memcached and MySQL Better Together
Introduction: The primero recommendation for speeding up a website is almost always to add cache and more cache. And after that add a little more cache just in case. Memcached is almost always given as the recommended cache to use. What we don't often hear is how to effectively use a cache in our own products. MySQL hosted two excellent webinars (referenced below) on the subject of how to deploy and use memcached. The star of the show, other than MySQL of course, is Farhan Mashraqi of Fotolog. You may recall we did an earlier article on Fotolog in Secrets to Fotolog's Scaling Success , which was one of my personal favorites. Fotolog, as they themselves point out, is probably the largest site nobody has ever heard of, pulling in more page views than even Flickr. Fotolog has 51 instances of memcached on 21 servers with 175G in use and 254G available. As a large successful photo-blogging site they have very demanding performance and scaling requirements. To meet those requirements they've developed a
4 0.11504051 933 high scalability-2010-11-01-Hot Trend: Move Behavior to Data for a New Interactive Application Architecture
Introduction: Two forces account for the trend of moving behavior to data: larger values used in key-value stores and spotty cloud networks. For some time we've seen functions pushed close to data with MapReduce, which is a batch process, but we are now seeing this model extend to interactive applications, which match the current emphasis on highly scalable, real-time, event driven applications. To see the trend look at the increasing support for collocated behavior at the datastore level: HBase is implementing a coprocessor feature . Cassandra is also implementing coprocessors or plugins . Membase is creating NodeCode , which is a process for executing functions on data in the database. MongoDB supports JavaScript stored procedures . VoltDB has Java based stored procedures . In-memory DataGrid products like GigaSpaces have been doing something like this forever. The key difference historically being GigaSpaces' tight integration with languages C++ and Java, instead of using
Introduction: In Resolved: Widespread Application Outage , Heroku tells their story of how they dealt with the Amazon outage . While taking 100% responsibility for the downtime, they also shared a number of the strategies they used to bring their service back to full working order. One of Heroku's most interesting strategies wasn't a technical hack at all, but how they consciously went about deploying their Ops personnel in response to the emergency. An outline of their strategy is: Monitoring systems immediately alerted Ops to the problem. An on-call engineer applied triage logic to the problem and classified it as serious, which caused the on-call Incident Commander to be woken out of restful slumber. The IC contacted AWS . They were in constant contact with their AWS representative and worked closely with AWS to solve problems. The IC alerted Heroku engineers. A full crew: support, data, and other engineering teams worked around the clock to bring every
7 0.094809689 1171 high scalability-2012-01-09-The Etsy Saga: From Silos to Happy to Billions of Pageviews a Month
8 0.093970083 1126 high scalability-2011-09-27-Use Instance Caches to Save Money: Latency == $$$
9 0.093099393 232 high scalability-2008-01-29-When things aren't scalable
10 0.085357271 1052 high scalability-2011-06-03-Stuff The Internet Says On Scalability For June 3, 2011
11 0.084330082 910 high scalability-2010-09-30-Facebook and Site Failures Caused by Complex, Weakly Interacting, Layered Systems
12 0.081200801 1007 high scalability-2011-03-18-Stuff The Internet Says On Scalability For March 18, 2011
13 0.080420062 538 high scalability-2009-03-16-Are Cloud Based Memory Architectures the Next Big Thing?
14 0.080394514 247 high scalability-2008-02-12-We want to cache a lot :) How do we go about it ?
15 0.079374701 1065 high scalability-2011-06-21-Running TPC-C on MySQL-RDS
16 0.077390239 152 high scalability-2007-11-13-Flickr Architecture
17 0.07576967 517 high scalability-2009-02-21-Google AppEngine - A Second Look
18 0.075390957 1346 high scalability-2012-10-24-Saving Cash Using Less Cache - 90% Savings in the Caching Tier
19 0.07473284 589 high scalability-2009-05-05-Drop ACID and Think About Data
20 0.074227646 1646 high scalability-2014-05-12-4 Architecture Issues When Scaling Web Applications: Bottlenecks, Database, CPU, IO
topicId topicWeight
[(0, 0.117), (1, 0.066), (2, -0.036), (3, -0.058), (4, 0.033), (5, 0.03), (6, -0.015), (7, -0.017), (8, -0.03), (9, -0.038), (10, 0.009), (11, -0.027), (12, -0.017), (13, 0.044), (14, -0.042), (15, -0.033), (16, -0.047), (17, -0.043), (18, 0.016), (19, 0.018), (20, -0.043), (21, 0.023), (22, 0.066), (23, -0.003), (24, -0.018), (25, 0.002), (26, 0.027), (27, 0.011), (28, 0.011), (29, 0.036), (30, -0.031), (31, -0.011), (32, -0.057), (33, 0.02), (34, 0.008), (35, 0.019), (36, -0.028), (37, 0.021), (38, 0.036), (39, 0.006), (40, 0.015), (41, -0.029), (42, -0.032), (43, 0.009), (44, 0.024), (45, 0.025), (46, 0.004), (47, 0.03), (48, 0.01), (49, -0.046)]
simIndex simValue blogId blogTitle
same-blog 1 0.97196186 1620 high scalability-2014-03-27-Strategy: Cache Stored Procedure Results
Introduction: Caching is not new of course, but I don't think I've heard of caching store procedure results before. It's like memoization in the database. Brent Ozar covers this idea in How to Cache Stored Procedure Results . The benefits are the usual for doing work in the database, it doesn't take per developer per app work, just code it once in the stored proc and it works for everyone, everywhere, for all of time. The disadvantage is the usual as well, it adds extra load to a probably already busy database, so it should only be applied to heavy computations. Brent positions this strategy as an emergency bandaid to apply when you need to take pressure off a database now. Developers can then work on moving the cache off the database and into its own tier. Interesting idea. And as the comments show the implementation is never as simple as it seems.
2 0.80328256 247 high scalability-2008-02-12-We want to cache a lot :) How do we go about it ?
Introduction: We have a lot of dependencies to our SQL databases and we have heard that caching does help a lot as we move into scaling and providing better performance. So the question is what are some reliable software products out there that we could consider in this space ? We want to put a lot of frequently called database calls that do not change frequently into this caching layer. Also what would be an easy way to move only those database changes into the cache as opposed to reloading or pulling it into cache every few mins or hours. We need something smart that would just push changes to the caching layer as it happens. I guess we could build our own, but are there any good reliable products out there ? Please also mention how they play with regards to pricing 'cos that would be a determining factor as well. Thanks
3 0.79015714 436 high scalability-2008-11-02-Strategy: How to Manage Sessions Using Memcached
Introduction: Dormando shows an enlightened middle way for storing sessions in cache and the database. Sessions are a perfect cache candidate because they are transient, smallish, and since they are usually accessed on every page access removing all that load from the database is a good thing. But as Dormando points out session caches have problems. If you remove expiration times from the cache and you run out of memory then no more logins. If a cache server fails or needs to be upgrade then you just logged out a bunch of potentially angry users. The middle ground Dormando proposes is using both the cache and the database: Reads : read from the cache first, then the database. Typical cache logic. Writes : write to memcached every time, write to the database every N seconds (assuming the data has changed). There's a small chance of data loss, but you've still greatly reduced the database load while providing reliability. Nice solution.
4 0.78385425 1633 high scalability-2014-04-16-Six Lessons Learned the Hard Way About Scaling a Million User System
Introduction: Ever come to a point where you feel you've learned enough to share your experiences in the hopes of helping others traveling the same road? That's what Martin Kleppmann has done in an lovingly written Six things I wish we had known about scaling , an article well worth your time. It's not advice about scaling a Twitter, but of building a million user system, which is the sweet spot for a lot of projects. His conclusion rings true: Building scalable systems is not all sexy roflscale fun. It’s a lot of plumbing and yak shaving. A lot of hacking together tools that really ought to exist already, but all the open source solutions out there are too bad (and yours ends up bad too, but at least it solves your particular problem). Here's a gloss on the six lessons (plus a bonus lesson): Realistic load testing is hard . Testing a large distributed system is not like a scientific experiment that can be conducted under ideal conditions. This is hard for the scientific minded to acce
5 0.78256738 360 high scalability-2008-08-04-A Bunch of Great Strategies for Using Memcached and MySQL Better Together
Introduction: The primero recommendation for speeding up a website is almost always to add cache and more cache. And after that add a little more cache just in case. Memcached is almost always given as the recommended cache to use. What we don't often hear is how to effectively use a cache in our own products. MySQL hosted two excellent webinars (referenced below) on the subject of how to deploy and use memcached. The star of the show, other than MySQL of course, is Farhan Mashraqi of Fotolog. You may recall we did an earlier article on Fotolog in Secrets to Fotolog's Scaling Success , which was one of my personal favorites. Fotolog, as they themselves point out, is probably the largest site nobody has ever heard of, pulling in more page views than even Flickr. Fotolog has 51 instances of memcached on 21 servers with 175G in use and 254G available. As a large successful photo-blogging site they have very demanding performance and scaling requirements. To meet those requirements they've developed a
6 0.77260166 673 high scalability-2009-08-07-Strategy: Break Up the Memcache Dog Pile
7 0.75778913 1346 high scalability-2012-10-24-Saving Cash Using Less Cache - 90% Savings in the Caching Tier
8 0.7560128 602 high scalability-2009-05-17-Scaling Django Web Apps by Mike Malone
9 0.73986846 703 high scalability-2009-09-12-How Google Taught Me to Cache and Cash-In
10 0.73301536 359 high scalability-2008-07-29-Ehcache - A Java Distributed Cache
11 0.72005421 910 high scalability-2010-09-30-Facebook and Site Failures Caused by Complex, Weakly Interacting, Layered Systems
12 0.7129935 911 high scalability-2010-09-30-More Troubles with Caching
13 0.70901293 248 high scalability-2008-02-13-What's your scalability plan?
14 0.70231712 828 high scalability-2010-05-17-7 Lessons Learned While Building Reddit to 270 Million Page Views a Month
15 0.69864362 1080 high scalability-2011-07-15-Stuff The Internet Says On Scalability For July 15, 2011
16 0.69186091 530 high scalability-2009-03-11-13 Screencasts on How to Scale Rails
17 0.68645328 174 high scalability-2007-12-05-Product: Tugela Cache
18 0.6845035 594 high scalability-2009-05-08-Eight Best Practices for Building Scalable Systems
19 0.68157971 1135 high scalability-2011-10-31-15 Ways to Make Your Application Feel More Responsive under Google App Engine
20 0.67790014 1321 high scalability-2012-09-12-Using Varnish for Paywalls: Moving Logic to the Edge
topicId topicWeight
[(1, 0.173), (2, 0.237), (4, 0.315), (61, 0.086), (94, 0.059)]
simIndex simValue blogId blogTitle
1 0.82510662 469 high scalability-2008-12-17-Scalability Strategies Primer: Database Sharding
Introduction: This article is a primer, intended to shine some much needed light on the logical, process oriented implementations of database scalability strategies in the form of a broad introduction. More specifically, the intent is to elaborate on the majority of these implementations by example.
2 0.8087135 12 high scalability-2007-07-15-Isilon Clustred Storage System
Introduction: The Isilon IQ family of clustered storage systems was designed from the ground up to meet the needs of data-intensive enterprises and high-performance computing environments. By combining Isilon's OneFS® operating system software with the latest advances in industry-standard hardware, Isilon delivers modular, pay-as-you-grow, enterprise-class clustered storage systems. OneFS, with TrueScale™ technology, powers the industry's first and only storage system that enables linear or independent scaling of performance and capacity. This new flexible and tunable system, featuring a robust suite of clustered storage software applications, provides customers with an "out of the box" solution that is fully optimized for the widest range of applications and workflow needs. * Scales from 4 TB ti 1 PB * Throughput of up to 10 GB per seond * Linear scaling * Easy to manage Related Articles Inside Skinny On Isilon by StorageMojo
same-blog 3 0.80585688 1620 high scalability-2014-03-27-Strategy: Cache Stored Procedure Results
Introduction: Caching is not new of course, but I don't think I've heard of caching store procedure results before. It's like memoization in the database. Brent Ozar covers this idea in How to Cache Stored Procedure Results . The benefits are the usual for doing work in the database, it doesn't take per developer per app work, just code it once in the stored proc and it works for everyone, everywhere, for all of time. The disadvantage is the usual as well, it adds extra load to a probably already busy database, so it should only be applied to heavy computations. Brent positions this strategy as an emergency bandaid to apply when you need to take pressure off a database now. Developers can then work on moving the cache off the database and into its own tier. Interesting idea. And as the comments show the implementation is never as simple as it seems.
4 0.80210155 282 high scalability-2008-03-18-Database War Stories #3: Flickr
Introduction: [Tim O'Reilly] Continuing my series of queries about how "Web 2.0" companies used databases, I asked Cal Henderson of Flickr to tell me "how the folksonomy model intersects with the traditional database. How do you manage a tag cloud?"
Introduction: Facebook has been teasing us. While many of their recent acquisitions have been surprising, shocking is the only word adequately describing Facebook's 5 day whirlwind acquisition of Oculus , immersive virtual reality visionaries, for a now paltry sounding $2 billion. The backlash is a pandemic, jumping across social networks with the speed only a meme powered by the directly unaffected can generate. For more than 30 years VR has been the dream burning in the heart of every science fiction fan. Now that this future might finally be here, Facebook’s ownage makes it seem like a wonderful and hopeful timeline has been choked off, killing the Metaverse before it even had a chance to begin. For the many who voted for an open future with their Kickstarter dollars , there’s a deep and personal sense of betrayal, despite Facebook’s promise to leave Oculus alone. The intensity of the reaction is because Oculus matters to people. It's new, it's different, it create
6 0.77121097 919 high scalability-2010-10-14-I, Cloud
7 0.76186228 1157 high scalability-2011-12-14-Virtualization and Cloud Computing is Changing the Network to East-West Routing
8 0.75592929 1213 high scalability-2012-03-22-Paper: Revisiting Network I-O APIs: The netmap Framework
9 0.7404995 916 high scalability-2010-10-07-Hot Scalability Links For Oct 8, 2010
10 0.73157358 1094 high scalability-2011-08-08-Tagged Architecture - Scaling to 100 Million Users, 1000 Servers, and 5 Billion Page Views
11 0.72871989 670 high scalability-2009-08-05-Anti-RDBMS: A list of distributed key-value stores
12 0.71427637 79 high scalability-2007-09-01-On-Demand Infinitely Scalable Database Seed the Amazon EC2 Cloud
13 0.70331097 1538 high scalability-2013-10-28-Design Decisions for Scaling Your High Traffic Feeds
14 0.69507271 1436 high scalability-2013-04-05-Stuff The Internet Says On Scalability For April 5, 2013
15 0.68727154 309 high scalability-2008-04-23-Behind The Scenes of Google Scalability
16 0.68485326 754 high scalability-2009-12-22-Incremental deployment
17 0.68252254 942 high scalability-2010-11-15-Strategy: Biggest Performance Impact is to Reduce the Number of HTTP Requests
18 0.68142843 1408 high scalability-2013-02-19-Puppet monitoring: how to monitor the success or failure of Puppet runs
19 0.67908776 948 high scalability-2010-11-24-Great Introductory Video on Scalability from Harvard Computer Science
20 0.67809236 426 high scalability-2008-10-22-Server load balancing architectures, Part 1: Transport-level load balancing