Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Skip_graph> ?p ?o }
Showing triples 1 to 36 of
36
with 100 triples per page.
- Skip_graph abstract "Skip graphs are a kind of distributed data structure based on skip lists. They were invented in 2003 by James Aspnes and Gauri Shah. They have the full functionality of a balanced tree in a distributed system. Skip graphs are mostly used in searching peer-to-peer networks. As they provide the ability to query by key ordering, they improve other search tools based on the hash table functionality only. In contrast to skip lists and other tree data structures, they are very resilient and can tolerate a large fraction of node failures. Also, constructing, inserting, searching and repairing a skip graph that was disturbed by failing nodes can be done by straightforward algorithms.".
- Skip_graph wikiPageID "31169226".
- Skip_graph wikiPageLength "10995".
- Skip_graph wikiPageOutDegree "22".
- Skip_graph wikiPageRevisionID "707919039".
- Skip_graph wikiPageWikiLink Adversary_model.
- Skip_graph wikiPageWikiLink Category:Graph_data_structures.
- Skip_graph wikiPageWikiLink Chord_(peer-to-peer).
- Skip_graph wikiPageWikiLink Data_structure.
- Skip_graph wikiPageWikiLink Distributed_computing.
- Skip_graph wikiPageWikiLink Distributed_hash_table.
- Skip_graph wikiPageWikiLink Doubly_linked_list.
- Skip_graph wikiPageWikiLink Expander_graph.
- Skip_graph wikiPageWikiLink Hash_table.
- Skip_graph wikiPageWikiLink Key_ordering.
- Skip_graph wikiPageWikiLink Peer-to-peer.
- Skip_graph wikiPageWikiLink Query.
- Skip_graph wikiPageWikiLink Search_tree.
- Skip_graph wikiPageWikiLink Self-balancing_binary_search_tree.
- Skip_graph wikiPageWikiLink Skip_list.
- Skip_graph wikiPageWikiLink Tapestry_(DHT).
- Skip_graph wikiPageWikiLink Tree_(data_structure).
- Skip_graph wikiPageWikiLink Vertex_(graph_theory).
- Skip_graph wikiPageWikiLinkText "Skip graph".
- Skip_graph wikiPageUsesTemplate Template:Reflist.
- Skip_graph subject Category:Graph_data_structures.
- Skip_graph hypernym Kind.
- Skip_graph type Object.
- Skip_graph type Structure.
- Skip_graph comment "Skip graphs are a kind of distributed data structure based on skip lists. They were invented in 2003 by James Aspnes and Gauri Shah. They have the full functionality of a balanced tree in a distributed system. Skip graphs are mostly used in searching peer-to-peer networks. As they provide the ability to query by key ordering, they improve other search tools based on the hash table functionality only.".
- Skip_graph label "Skip graph".
- Skip_graph sameAs Q7535755.
- Skip_graph sameAs m.0gh648m.
- Skip_graph sameAs Q7535755.
- Skip_graph wasDerivedFrom Skip_graph?oldid=707919039.
- Skip_graph isPrimaryTopicOf Skip_graph.