Rasmus Pagh and Flemming Friche Rodler. Lossy dictionaries. In Proceedings of the 9th European Symposium on Algorithms (ESA '01), volume 2161 of Lecture Notes in Computer Science, pages 300--311, Berlin, 2001. Springer-Verlag. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Scaling Filename Queries in a Large-Scale Distributed File.. - Ledlie, Serban, Toncheva (2002) (Correct)
....and the bits option on. Similar highly compressed filtering mechanisms exist and would be interesting to try on the same problem. Lossy Dictionaries, for example, weigh each member of the set S, and uses a greedy algorithm to build a dictionary of maximum weight given constraints on space[15]. The dictionary consists of two tables of equal length. The keys in the set S are hashed to a cell value in one of the tables, and a union find data structure is used to solve collions in an optimal manner. To verify if an element belongs to the set S, at most two cells of the dictionary must be ....
Rasmus Pagh and Flemming Friche Rodler. Lossy dictionaries. In Algorithms -- ESA 2001.
Compression with Fast Random Access - Rodler Self-citation (Rodler) (Correct)
....by including a new section where experimental results are explained in terms of a simple model. Also, more detailed text and figures have been added. Chapter 5 is based on the technical report Lossy Dictionaries. The paper has been published as a technical report [65] and as conference paper [66]. 65] Rasmus Pagh and Flemming Friche Rodler. Lossy Dictionaries. Technical Report RS 01 33, BRICS, August 2001. 66] Rasmus Pagh and Flemming Friche Rodler. Lossy Dictionaries. In Proceedings of the 9th European Symposium on Algorithms (ESA 01) volume 2161 of Lecture notes in Computer ....
....text and figures have been added. Chapter 5 is based on the technical report Lossy Dictionaries. The paper has been published as a technical report [65] and as conference paper [66] 65] Rasmus Pagh and Flemming Friche Rodler. Lossy Dictionaries. Technical Report RS 01 33, BRICS, August 2001. [66] Rasmus Pagh and Flemming Friche Rodler. Lossy Dictionaries. In Proceedings of the 9th European Symposium on Algorithms (ESA 01) volume 2161 of Lecture notes in Computer Science, pages 300 311, Berlin, 2001. Springer Verlag. The technical report extends the conference paper by simplifying the ....
Rasmus Pagh and Flemming Friche Rodler. Lossy dictionaries. In Proceedings of the 9th European Symposium on Algorithms (ESA '01), volume 2161 of Lecture Notes in Computer Science, pages 300--311, Berlin, 2001. Springer-Verlag.
Cuckoo Hashing - Pagh, Rodler (2001) (3 citations) Self-citation (Pagh Rodler) (Correct)
....make Siegel s hash functions practical. Secondly, we lack a precise understanding of why the scheme exhibits low constant factors. In particular, the curve of Figure 7 needs to be explained. Another point to investigate is whether using more tables yields practical dictionaries. Experiments in [26] suggest that space utilization could be improved to more than 80 , but it remains to be seen how this would a#ect insertion performance. Acknowledgements. The authors would like to thank Andrei Broder, Peter Sanders and Berthold Vocking for useful comments and discussions on Cuckoo Hashing. ....
Rasmus Pagh and Flemming Friche Rodler. Lossy dictionaries. In Proceedings of the 9th European Symposium on Algorithms (ESA '01), volume 2161 of Lecture Notes in Computer Science, pages 300--311, Berlin, 2001. Springer-Verlag.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC