Sciweavers

83 search results - page 1 / 17
» List Update Algorithms for Data Compression
Sort
View
ALGORITHMICA
1998
75views more  ALGORITHMICA 1998»
13 years 4 months ago
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
Susanne Albers, Michael Mitzenmacher
DCC
2008
IEEE
14 years 4 months ago
List Update Algorithms for Data Compression
List update algorithms have been widely used as subroutines
Alejandro López-Ortiz, J. Ian Munro, Reza D...
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
14 years 6 months ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...
DAGSTUHL
1996
13 years 6 months ago
Self-Organizing Data Structures
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
Susanne Albers, Jeffery Westbrook
WWW
2008
ACM
14 years 5 months ago
Performance of compressed inverted list caching in search engines
Due to the rapid growth in the size of the web, web search engines are facing enormous performance challenges. The larger engines in particular have to be able to process tens of ...
Jiangong Zhang, Xiaohui Long, Torsten Suel