<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/user/sb3000/algorithm"><title>BibSonomy publications for /user/sb3000/algorithm</title><link>http://www.bibsonomy.org/publrss/user/sb3000/algorithm</link><description>BibSonomy RSS Feed for /user/sb3000/algorithm</description><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2913bfd5965ad54bb09847d66765bcc04/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2168beddd70c4d1d484b147fec279abd9/sb3000"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2913bfd5965ad54bb09847d66765bcc04/sb3000"><title>Bigtable: A Distributed Storage System for Structured Data</title><link>http://www.bibsonomy.org/bibtex/2913bfd5965ad54bb09847d66765bcc04/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2007-02-21T11:39:06+01:00</dc:date><dc:subject>scalability google fault-tolerance performance distributed efficiency database algorithm </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Fay &lt;a href=&#034;http://www.bibsonomy.org/author/Chang&#034;&gt;Chang&lt;/a&gt;  und Jeffrey &lt;a href=&#034;http://www.bibsonomy.org/author/Dean&#034;&gt;Dean&lt;/a&gt;  und Sanjay &lt;a href=&#034;http://www.bibsonomy.org/author/Ghemawat&#034;&gt;Ghemawat&lt;/a&gt;  und Wilson C. &lt;a href=&#034;http://www.bibsonomy.org/author/Hsieh&#034;&gt;Hsieh&lt;/a&gt;  und Deborah A. &lt;a href=&#034;http://www.bibsonomy.org/author/Wallach&#034;&gt;Wallach&lt;/a&gt;  und Mike &lt;a href=&#034;http://www.bibsonomy.org/author/Burrows&#034;&gt;Burrows&lt;/a&gt;  und Tushar &lt;a href=&#034;http://www.bibsonomy.org/author/Chandra&#034;&gt;Chandra&lt;/a&gt;  und Andrew &lt;a href=&#034;http://www.bibsonomy.org/author/Fikes&#034;&gt;Fikes&lt;/a&gt;  und Robert E. &lt;a href=&#034;http://www.bibsonomy.org/author/Gruber&#034;&gt;Gruber&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;OSDI&#039;06: Seventh Symposium on Operating System Design and Implementation, Seattle, WA, November, 2006, &lt;/em&gt;&lt;em&gt;Seite205--218. &lt;/em&gt;(&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/scalability"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/google"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fault-tolerance"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/performance"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distributed"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/efficiency"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/database"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2168beddd70c4d1d484b147fec279abd9/sb3000"><title>Algorithm 97: Shortest path</title><link>http://www.bibsonomy.org/bibtex/2168beddd70c4d1d484b147fec279abd9/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-09-05T17:46:44+02:00</dc:date><dc:subject>graph algorithm </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Robert W. &lt;a href=&#034;http://www.bibsonomy.org/author/Floyd&#034;&gt;Floyd&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Communications of the ACM&lt;/em&gt;&lt;em&gt;5(6):345&lt;/em&gt;(&lt;em&gt;1962&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/></rdf:Bag></taxo:topics></item></rdf:RDF>