high_scalability high_scalability-2009 high_scalability-2009-621 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: I've seen mentioned in few times sites like Digg or LinkedIn using graph servers to hold their social graphs. But the only sort of open source graph server I've found is http://neo4j.org/ . Can anyone recommend an open source graph server? Thanks Aaron
sentIndex sentText sentNum sentScore
1 I've seen mentioned in few times sites like Digg or LinkedIn using graph servers to hold their social graphs. [sent-1, score-1.861]
2 But the only sort of open source graph server I've found is http://neo4j. [sent-2, score-1.431]
3 Can anyone recommend an open source graph server? [sent-4, score-1.47]
wordName wordTfidf (topN-words)
[('graph', 0.552), ('recommend', 0.312), ('digg', 0.278), ('hold', 0.27), ('mentioned', 0.262), ('linkedin', 0.258), ('source', 0.215), ('open', 0.205), ('anyone', 0.186), ('sort', 0.181), ('seen', 0.176), ('sites', 0.159), ('social', 0.156), ('server', 0.139), ('found', 0.139), ('times', 0.118), ('http', 0.118), ('servers', 0.075), ('using', 0.049), ('like', 0.044)]
simIndex simValue blogId blogTitle
same-blog 1 0.99999994 621 high scalability-2009-06-06-Graph server
Introduction: I've seen mentioned in few times sites like Digg or LinkedIn using graph servers to hold their social graphs. But the only sort of open source graph server I've found is http://neo4j.org/ . Can anyone recommend an open source graph server? Thanks Aaron
2 0.36316985 628 high scalability-2009-06-13-Neo4j - a Graph Database that Kicks Buttox
Introduction: Update: Social networks in the database: using a graph database . A nice post on representing, traversing, and performing other common social network operations using a graph database. If you are Digg or LinkedIn you can build your own speedy graph database to represent your complex social network relationships. For those of more modest means Neo4j , a graph database, is a good alternative. A graph is a collection nodes (things) and edges (relationships) that connect pairs of nodes. Slap properties (key-value pairs) on nodes and relationships and you have a surprisingly powerful way to represent most anything you can think of. In a graph database "relationships are first-class citizens. They connect two nodes and both nodes and relationships can hold an arbitrary amount of key-value pairs. So you can look at a graph database as a key-value store, with full support for relationships." A graph looks something like: For more lovely examples take a look at the Graph Image Gal
3 0.31989396 626 high scalability-2009-06-10-Paper: Graph Databases and the Future of Large-Scale Knowledge Management
Introduction: Relational databases, document databases, and distributed hash tables get most of the hype these days, but there's another option: graph databases. Back to the future it seems. Here's a really interesting paper by Marko A. Rodriguez introducing the graph model and it's extension to representing the world wide web of data. Modern day open source and commercial graph databases can store on the order of 1 billion relationships with some databases reaching the 10 billion mark. These developments are making the graph database practical for applications that require large-scale knowledge structures. Moreover, with the Web of Data standards set forth by the Linked Data community, it is possible to interlink graph databases across the web into a giant global knowledge structure. This talk will discuss graph databases, their underlying data model, their querying mechanisms, and the benefits of the graph data structure for modeling and analysis.
4 0.27000162 1406 high scalability-2013-02-14-When all the Program's a Graph - Prismatic's Plumbing Library
Introduction: At some point as a programmer you might have the insight/fear that all programming is just doing stuff to other stuff. Then you may observe after coding the same stuff over again that stuff in a program often takes the form of interacting patterns of flows. Then you may think hey, a program isn't only useful for coding datastructures, but a program is a kind of datastructure and that with a meta level jump you could program a program in terms of flows over data and flow over other flows. That's the kind of stuff Prismatic is making available in the Graph extension to their plumbing package ( code examples ), which is described in an excellent post: Graph: Abstractions for Structured Computation . You may remember Prismatic from previous profile we did on HighScalability: Prismatic Architecture - Using Machine Learning On Social Networks To Figure Out What You Should Read On The Web . We learned how Prismatic, an interest driven content suggestion service, builds programs in
5 0.24253301 148 high scalability-2007-11-11-Linkedin architecture
Introduction: Hi, An interesting post on Linkedin architecture: http://furiouspurpose.blogspot.com/2007/11/qcon-linkedin-architecture.html
7 0.23086539 1088 high scalability-2011-07-27-Making Hadoop 1000x Faster for Graph Problems
8 0.21709955 805 high scalability-2010-04-06-Strategy: Make it Really Fast vs Do the Work Up Front
9 0.21579155 339 high scalability-2008-06-04-LinkedIn Architecture
10 0.21562031 554 high scalability-2009-04-04-Digg Architecture
11 0.18694346 1285 high scalability-2012-07-18-Disks Ain't Dead Yet: GraphChi - a disk-based large-scale graph computation
12 0.17108238 827 high scalability-2010-05-14-Hot Scalability Links for May 14, 2010
13 0.16525578 833 high scalability-2010-06-01-Sponsored Post: Get Your High Scalability Fix at Digg
14 0.16182899 766 high scalability-2010-01-26-Product: HyperGraphDB - A Graph Database
15 0.15883757 1136 high scalability-2011-11-03-Paper: G2 : A Graph Processing System for Diagnosing Distributed Systems
16 0.14832346 797 high scalability-2010-03-19-Hot Scalability Links for March 19, 2010
17 0.1394088 90 high scalability-2007-09-12-Technology behind mediatemple grid service
18 0.11751953 722 high scalability-2009-10-15-Hot Scalability Links for Oct 15 2009
19 0.11653542 183 high scalability-2007-12-12-Report from OpenSocial Meetup at Google
20 0.11644923 1064 high scalability-2011-06-20-35+ Use Cases for Choosing Your Next NoSQL Database
topicId topicWeight
[(0, 0.104), (1, 0.036), (2, 0.043), (3, -0.033), (4, 0.077), (5, 0.05), (6, -0.108), (7, -0.035), (8, 0.031), (9, 0.177), (10, 0.082), (11, 0.015), (12, -0.071), (13, -0.141), (14, -0.09), (15, -0.069), (16, -0.0), (17, 0.34), (18, 0.075), (19, 0.165), (20, -0.207), (21, -0.054), (22, -0.055), (23, -0.076), (24, -0.094), (25, 0.114), (26, -0.014), (27, 0.037), (28, 0.02), (29, -0.145), (30, 0.008), (31, -0.092), (32, 0.009), (33, -0.079), (34, 0.011), (35, 0.154), (36, 0.048), (37, -0.024), (38, -0.028), (39, -0.039), (40, 0.043), (41, -0.0), (42, 0.044), (43, -0.083), (44, 0.056), (45, -0.0), (46, 0.023), (47, -0.03), (48, 0.047), (49, 0.059)]
simIndex simValue blogId blogTitle
same-blog 1 0.98180795 621 high scalability-2009-06-06-Graph server
Introduction: I've seen mentioned in few times sites like Digg or LinkedIn using graph servers to hold their social graphs. But the only sort of open source graph server I've found is http://neo4j.org/ . Can anyone recommend an open source graph server? Thanks Aaron
2 0.83004594 1285 high scalability-2012-07-18-Disks Ain't Dead Yet: GraphChi - a disk-based large-scale graph computation
Introduction: GraphChi uses a Parallel Sliding Windows method which can: process a graph with mutable edge values efficiently from disk, with only a small number of non-sequential disk accesses, while supporting the asynchronous model of computation. The result is graphs with billions of edges can be processed on just a single machine. It uses a vertex-centric computation model similar to Pregel , which supports iterative algorithims as apposed to the batch style of MapReduce. Streaming graph updates are supported. About GraphChi, Carlos Guestrin, codirector of Carnegie Mellon's Select Lab, says : A Mac Mini running GraphChi can analyze Twitter's social graph from 2010—which contains 40 million users and 1.2 billion connections—in 59 minutes. "The previous published result on this problem took 400 minutes using a cluster of about 1,000 computers Related Articles Aapo Kyrola Home Page Your Laptop Can Now Analyze Big Data by JOHN PAVLUS Example Applications Runn
3 0.82010204 626 high scalability-2009-06-10-Paper: Graph Databases and the Future of Large-Scale Knowledge Management
Introduction: Relational databases, document databases, and distributed hash tables get most of the hype these days, but there's another option: graph databases. Back to the future it seems. Here's a really interesting paper by Marko A. Rodriguez introducing the graph model and it's extension to representing the world wide web of data. Modern day open source and commercial graph databases can store on the order of 1 billion relationships with some databases reaching the 10 billion mark. These developments are making the graph database practical for applications that require large-scale knowledge structures. Moreover, with the Web of Data standards set forth by the Linked Data community, it is possible to interlink graph databases across the web into a giant global knowledge structure. This talk will discuss graph databases, their underlying data model, their querying mechanisms, and the benefits of the graph data structure for modeling and analysis.
4 0.804977 1406 high scalability-2013-02-14-When all the Program's a Graph - Prismatic's Plumbing Library
Introduction: At some point as a programmer you might have the insight/fear that all programming is just doing stuff to other stuff. Then you may observe after coding the same stuff over again that stuff in a program often takes the form of interacting patterns of flows. Then you may think hey, a program isn't only useful for coding datastructures, but a program is a kind of datastructure and that with a meta level jump you could program a program in terms of flows over data and flow over other flows. That's the kind of stuff Prismatic is making available in the Graph extension to their plumbing package ( code examples ), which is described in an excellent post: Graph: Abstractions for Structured Computation . You may remember Prismatic from previous profile we did on HighScalability: Prismatic Architecture - Using Machine Learning On Social Networks To Figure Out What You Should Read On The Web . We learned how Prismatic, an interest driven content suggestion service, builds programs in
5 0.7795881 628 high scalability-2009-06-13-Neo4j - a Graph Database that Kicks Buttox
Introduction: Update: Social networks in the database: using a graph database . A nice post on representing, traversing, and performing other common social network operations using a graph database. If you are Digg or LinkedIn you can build your own speedy graph database to represent your complex social network relationships. For those of more modest means Neo4j , a graph database, is a good alternative. A graph is a collection nodes (things) and edges (relationships) that connect pairs of nodes. Slap properties (key-value pairs) on nodes and relationships and you have a surprisingly powerful way to represent most anything you can think of. In a graph database "relationships are first-class citizens. They connect two nodes and both nodes and relationships can hold an arbitrary amount of key-value pairs. So you can look at a graph database as a key-value store, with full support for relationships." A graph looks something like: For more lovely examples take a look at the Graph Image Gal
6 0.72662985 631 high scalability-2009-06-15-Large-scale Graph Computing at Google
7 0.69626874 766 high scalability-2010-01-26-Product: HyperGraphDB - A Graph Database
8 0.68535966 1136 high scalability-2011-11-03-Paper: G2 : A Graph Processing System for Diagnosing Distributed Systems
9 0.63544536 805 high scalability-2010-04-06-Strategy: Make it Really Fast vs Do the Work Up Front
10 0.63461947 827 high scalability-2010-05-14-Hot Scalability Links for May 14, 2010
11 0.59659344 58 high scalability-2007-08-04-Product: Cacti
12 0.59038395 1088 high scalability-2011-07-27-Making Hadoop 1000x Faster for Graph Problems
13 0.58556741 155 high scalability-2007-11-15-Video: Dryad: A general-purpose distributed execution platform
14 0.57892525 722 high scalability-2009-10-15-Hot Scalability Links for Oct 15 2009
15 0.57500398 801 high scalability-2010-03-30-Running Large Graph Algorithms - Evaluation of Current State-of-the-Art and Lessons Learned
16 0.50664258 842 high scalability-2010-06-16-Hot Scalability Links for June 16, 2010
17 0.49585098 797 high scalability-2010-03-19-Hot Scalability Links for March 19, 2010
18 0.44319811 973 high scalability-2011-01-14-Stuff The Internet Says On Scalability For January 14, 2011
19 0.42794728 339 high scalability-2008-06-04-LinkedIn Architecture
20 0.42181465 542 high scalability-2009-03-17-IBM WebSphere eXtreme Scale (IMDG)
topicId topicWeight
[(2, 0.296), (30, 0.179), (61, 0.109), (79, 0.22)]
simIndex simValue blogId blogTitle
1 0.92580497 867 high scalability-2010-07-27-YeSQL: An Overview of the Various Query Semantics in the Post Only-SQL World
Introduction: The NoSQL movement faults the SQL query language as the source of many of the scalability issues that we face today with traditional database approach. I think that the main reason so many people have come to see SQL as the source of all evil is the fact that, traditionally, the query language was burned into the database implementation. So by saying NoSQL you basically say "No" to the traditional non-scalable RDBMS implementations. This view has brought on a flood of alternative query languages, each aiming to solve a different aspect that is missing in the traditional SQL query approach, such as a document model, or that provides a simpler approach, such as Key/Value query. Most of the people I speak with seem fairly confused on this subject, and tend to use query semantics and architecture interchangeably. In Part I of this post i tried to provide quick overview of what each query term stands for in the context of the NoSQL world . Part II illustrates those ide
2 0.91580033 464 high scalability-2008-12-13-Strategy: Facebook Tweaks to Handle 6 Time as Many Memcached Requests
Introduction: Our latest strategy is taken from a great post by Paul Saab of Facebook , detailing how with changes Facebook has made to memcached they have: ...been able to scale memcached to handle 200,000 UDP requests per second with an average latency of 173 microseconds. The total throughput achieved is 300,000 UDP requests/s, but the latency at that request rate is too high to be useful in our system. This is an amazing increase from 50,000 UDP requests/s using the stock version of Linux and memcached. To scale Facebook has hundreds of thousands of TCP connections open to their memcached processes. First, this is still amazing. It's not so long ago you could have never done this. Optimizing connection use was always a priority because the OS simply couldn't handle large numbers of connections or large numbers of threads or large numbers of CPUs. To get to this point is a big accomplishment. Still, at that scale there are problems that are often solved. Some of the problem Facebook faced a
3 0.91367394 917 high scalability-2010-10-08-4 Scalability Themes from Surgecon
Introduction: Robert Haas in his SURGE Recap of the Surge conference, reflected a bit, and came up with an interesting checklist of general themes from what he was seeing. I'm directly quoting his post, so please see the post for a full discussion. He uses this framework to think about the larger picture and where PostgreSQL stands in its progression. Make use of the academic literature . Inventing your own way to do something is fine, but at least consider the possibility that someone smarter than you has thought about this problem before. Failures are inevitable, so plan for them . Try to minimize the possibility of cascading failures, and plan in advance how you can operate in degraded mode if disaster (or the Slashdot effect) strikes. Disk technology matters . Drive firmware bugs are common and nightmarish, and you can expect very limited help from the manufacturer, especially if the drive is billed as consumer-grade rather than enterprise-grade. SSDs can save you a lot of m
4 0.90191019 831 high scalability-2010-05-26-End-To-End Performance Study of Cloud Services
Introduction: Cloud computing promises a number of advantages for the deployment of data-intensive applications. Most prominently, these include reducing cost with a pay-as-you-go pricing model and (virtually) unlimited throughput by adding servers if the workload increases. At the Systems Group , ETH Zurich, we did an extensive end-to-end performance study to compare the major cloud offerings regarding their ability to fulfill these promises and their implied cost. The focus of the work is on transaction processing (i.e., read and update work-loads), rather than analytics workloads. We used the TPC-W , a standardized benchmark simulating a Web-shop, as the baseline for our comparison. The TPC-W defines that users are simulated through emulated browsers (EB) and issue page requests, called web-interactions (WI), against the system. As a major modification to the benchmark, we constantly increase the load from 1 to 9000 simultaneous users to measure the scalability and cost variance of the syst
5 0.90035564 293 high scalability-2008-03-31-Read HighScalability on Your Mobile Phone Using WidSets Widgets
Introduction: Jean-Paul de Vooght of our Switzerland contingent created a nifty little WidSets widget that lets you better read HighScalability from your mobile phone. I thought untethered readers might like to give it a try. Thanks to Jean-Paul for making it available! WidSets is: a simple service that brings you information normally accessed via the Internet by sending it directly to your mobile phone . Using mini-applications called widgets, it sends you the latest updates to your favorite websites. The system uses RSS feeds to push information from these websites directly to your mobile phone the minute they’re updated .
6 0.89545727 252 high scalability-2008-02-18-limit on the number of databases open
7 0.89520693 312 high scalability-2008-04-30-Rather small site architecture.
8 0.89448905 890 high scalability-2010-09-01-Paper: The Case for Determinism in Database Systems
9 0.8938328 721 high scalability-2009-10-13-Why are Facebook, Digg, and Twitter so hard to scale?
10 0.89284652 862 high scalability-2010-07-20-Strategy: Consider When a Service Starts Billing in Your Algorithm Cost
12 0.87858582 336 high scalability-2008-05-31-Biggest Under Reported Story: Google's BigTable Costs 10 Times Less than Amazon's SimpleDB
13 0.8785522 526 high scalability-2009-03-05-Strategy: In Cloud Computing Systematically Drive Load to the CPU
14 0.87136614 1048 high scalability-2011-05-27-Stuff The Internet Says On Scalability For May 27, 2011
15 0.86701083 1266 high scalability-2012-06-18-Google on Latency Tolerant Systems: Making a Predictable Whole Out of Unpredictable Parts
16 0.86664581 687 high scalability-2009-08-24-How Google Serves Data from Multiple Datacenters
17 0.86661983 230 high scalability-2008-01-29-Speed up (Oracle) database code with result caching
18 0.86657524 601 high scalability-2009-05-17-Product: Hadoop
19 0.86652195 1018 high scalability-2011-04-07-Paper: A Co-Relational Model of Data for Large Shared Data Banks
20 0.86358595 533 high scalability-2009-03-11-The Implications of Punctuated Scalabilium for Website Architecture