79 search results - page 2 / 16 » Biased Skip Lists |
SODA
2008
ACM
13 years 7 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
SPIRE
2005
Springer
13 years 11 months ago
2005
Springer
Large inverted indices are by now common in the construction of web-scale search engines. For faster access, inverted indices are indexed internally so that it is possible to skip...
WADS
1989
Springer
13 years 10 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
ICC
2007
IEEE
14 years 9 days ago
2007
IEEE
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
ECIR
2011
Springer
12 years 9 months ago
2011
Springer
In large web search engines the performance of Information Retrieval systems is a key issue. Block-based compression methods are often used to improve the search performance, but c...