Paolo Ferragina, Giovanni Manzini  Home/Search
Context Related
| butirro.di.unipi.it/FMinde...focs00.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: butirro.di.unipi.it/...Abs_focs00 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we address the issue of compressing and indexing data. We devise a data structure whose space occupancy is a function of the entropy of the underlying data set. We call the data structure opportunistic since its space occupancy is decreased when the input is compressible and this space reduction is achieved at no significant slowdown in the query performance. More precisely, its space occupancy is optimal in an information-content sense because a text T [1, u] is stored using O(H... (Update)
Cited by: More
Rapid Homology Search with Two-Stage Extension and Daughter Seeds - Ma (2005) (Correct)
Suffix Arrays: What Are They Good for? - Puglisi, Smyth, al. (2006) (Correct)
Rapid Homology Search with Neighbor Seeds - Csürös, Ma (2005) (Correct)
Similar documents (at the sentence level):
21.8%: Opportunistic Data Structures with Applications - Ferragina, Manzini (2000) (Correct)
Active bibliography (related documents): More All
1.1: On Compressing and Indexing Data - Ferragina, Manzini (Correct)
0.4: Indexing Compressed Text - He (2003) (Correct)
0.4: An Experimental Study of an Opportunistic Index - Ferragina, Manzini (2001) (Correct)
Similar documents based on text: More All
0.8: Compressed Text Databases with Efficient Query Algorithms based.. - Sadakane (2000) (Correct)
0.6: Algorithms on Strings Based on the Compressed Suffix Arrays - Sadakane (Correct)
0.4: Compressed Suffix Arrays and Suffix Trees with Applications.. - Grossi, Vitter (2000) (Correct)
Related documents from co-citation: More All
15: An experimental study of an opportunistic index - Ferragina, Manzini - 2001
15: Compressed text databases with ecient query algorithms based on the compressed s.. (context) - Sadakane - 2000
15: A block-sorting lossless data compression algorithm - Burrows, Wheeler - 1994
BibTeX entry: (Update)
P. Ferragina and G. Manzini. Opportunistic Data Structures with Applications. Technical Report TR00-03, Dipartimento di Informatica, Universita di Pisa, March 2000. http://citeseer.ist.psu.edu/article/ferragina00opportunistic.html More
@inproceedings{ ferragina00opportunistic,
author = "Paolo Ferragina and Giovanni Manzini",
title = "Opportunistic Data Structures with Applications",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "390--398",
year = "2000",
url = "citeseer.ist.psu.edu/article/ferragina00opportunistic.html" }
Citations (may not include all citations):280 Managing Gigabytes: Compressing and Indexing Documents and I.. - Witten, Moffat et al. - 1999
250 volume 3 of The Art of Computer Programming (context) - Knuth, Searching - 1998
172 A space-economical suffix tree construction algorithm (context) - McCreight - 1976
143 A block sorting lossless data compression algorithm - Burrows, Wheeler - 1994
118 GLIMPSE: A tool to search through entire file systems - Manber, Wu
112 Suffix arrays: a new method for on-line string searches (context) - Manber, Myers - 1993
78 Programming Pearls (context) - Bentley - 1989
61 Let sleeping files lie: Pattern matching in Z-compressed fil.. - Amir, Benson et al. - 1996
61 AGREP - A fast approximate patternmatching tool - Wu, Manber
45 String matching in Lempel-Ziv compressed strings - Farach, Thorup - 1998
38 Efficient two-dimensional compressed matching (context) - Amir, Benson - 1992
28 tree: A new data structure for string search in external mem.. (context) - Ferragina, Grossi et al. - 1999
27 Optimal prediction for prefetching in the worst case - Krishnan, Vitter - 1998
24 Adding compression to block addressing inverted indexes - Navarro, de Moura et al. - 2000
19 Worst-case optimal insertion and deletion methods for decomp.. (context) - Overmars, van Leeuwen - 1981
13 Lempel-Ziv parsing and sublinear-size index structures for s.. - Karkkainen, Ukkonen - 1996
12 An analysis of the Burrows-Wheeler transform - Manzini - 1999
10 Optimal dynamization of decomposable searching problems (context) - Mehlhorn, Overmars - 1981
9 Block addressing indices for approximate text retrieval - Baeza-Yates, Navarro - 2000
9 Using difficulty of prediction to decrease computation: Fast.. - Chen, Reif - 1993
8 Sorting and searching revisited (context) - Andersson - 1996
8 Compressed suffix arrays and suffix trees with applications .. - Grossi, Vitter - 2000
6 A locally adaptive compression scheme (context) - Bentley, Sleator et al. - 1986
5 Succinct data structures (context) - Munro - 1999
5 Multimethod dispatching: A geometric approach with applicati.. - Ferragina, Muthukrishnan et al. - 1999
4 A modified Burrows-Wheeler transformation for case-insensiti.. - Sadakane - 1999
3 extended abstract (context) - Karlin, Phillips et al. - 1992
2 Lempel-Zip index for q- grams (context) - Karkkainen, Sutinen - 1996
The graph only includes citing articles where the year of publication is known.
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