Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7535755> ?p ?o }
Showing triples 1 to 21 of
21
with 100 triples per page.
- Q7535755 subject Q8498905.
- Q7535755 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.".
- Q7535755 wikiPageWikiLink Q1076368.
- Q7535755 wikiPageWikiLink Q1304193.
- Q7535755 wikiPageWikiLink Q161410.
- Q7535755 wikiPageWikiLink Q175263.
- Q7535755 wikiPageWikiLink Q180634.
- Q7535755 wikiPageWikiLink Q2005893.
- Q7535755 wikiPageWikiLink Q207440.
- Q7535755 wikiPageWikiLink Q223655.
- Q7535755 wikiPageWikiLink Q245955.
- Q7535755 wikiPageWikiLink Q3515447.
- Q7535755 wikiPageWikiLink Q4686702.
- Q7535755 wikiPageWikiLink Q5300179.
- Q7535755 wikiPageWikiLink Q621673.
- Q7535755 wikiPageWikiLink Q7385.
- Q7535755 wikiPageWikiLink Q776602.
- Q7535755 wikiPageWikiLink Q8498905.
- Q7535755 wikiPageWikiLink Q863506.
- Q7535755 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.".
- Q7535755 label "Skip graph".