Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Skip_graph> ?p ?o. }
Showing items 1 to 20 of
20
with 100 items per page.
- Skip_graph abstract "Skip graphs are a kind of distributed data structure based on skip lists. 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 fails. Also, constructing, inserting, searching and repairing a skip graph that was disturbed by failing nodes can be done by simple and straightforward algorithms.".
- Skip_graph wikiPageID "31169226".
- Skip_graph wikiPageRevisionID "560126892".
- Skip_graph hasPhotoCollection Skip_graph.
- Skip_graph subject Category:Graph_data_structures.
- Skip_graph type Abstraction100002137.
- Skip_graph type Arrangement105726596.
- Skip_graph type Cognition100023271.
- Skip_graph type DataStructure105728493.
- Skip_graph type GraphDataStructures.
- Skip_graph type PsychologicalFeature100023100.
- Skip_graph type Structure105726345.
- Skip_graph comment "Skip graphs are a kind of distributed data structure based on skip lists. 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 fails.".
- Skip_graph label "Skip graph".
- Skip_graph sameAs m.0gh648m.
- Skip_graph sameAs Q7535755.
- Skip_graph sameAs Q7535755.
- Skip_graph sameAs Skip_graph.
- Skip_graph wasDerivedFrom Skip_graph?oldid=560126892.
- Skip_graph isPrimaryTopicOf Skip_graph.