| Alternate document: Details An Experimental Study of an Opportunistic Index (01) Paolo Ferragina, Giovanni Manzini |
Paolo Ferragina, et al.  Home/Search
Context Related
| imc.pi.cnr.it/%7Emanzini/t...tr0004.pdf 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: ucsb.edu/~tamer/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The size of electronic data is currently growing at a faster rate than computer memory and disk storage capacities. For this reason compression appears always as an attractive choice, if not mandatory. However space overhead is not the only resource to be optimized when managing large data collections; in fact data turn out to be useful only when properly indexed to support search operations that e#ciently extract the user-requested information. (Update)
Context of citations to this paper: More
...Text indexing has been studied extensively in both structured and unstructured databases. Suffix arrays and compressed suffix arrays [16], based on Patricia tries, provide partial match searching rather than path navigation. Several data and query models for structured data...
Cited by: More
Resolution Cannot Polynomially Simulate Compressed-BFS - Motter, Roy, Markov (2003) (Correct)
A Fast Index for Semistructured Data - Cooper, Sample, Franklin.. (2001) (Correct)
Similar documents (at the sentence level):
61.3%: An Experimental Study of an Opportunistic Index - Ferragina, Manzini (2001) (Correct)
Active bibliography (related documents): More All
0.5: Opportunistic Data Structures with Applications - Ferragina, Manzini (2000) (Correct)
0.4: String Processing Algorithms - Inenaga (2003) (Correct)
0.3: Suffix Arrays: What Are They Good for? - Puglisi, Smyth, al. (2006) (Correct)
Similar documents based on text: More All
0.6: Some remarks on the Shannon capacity of odd cycles - Codenotti, Gerace, Resta (Correct)
0.6: An Analysis of the Burrows-Wheeler Transform - Manzini (1999) (Correct)
0.5: Hardness Results and Spectral Techniques for.. - Codenotti, Gerace, Vigna (1998) (Correct)
BibTeX entry: (Update)
P. Ferragina and G. Manzini. An experimental study of a compressed index. In Proc. ACM-SIAM SODA, 2001. http://citeseer.ist.psu.edu/ferragina01experimental.html More
@article{ ferragina01experimental,
author = "Paolo Ferragina and Giovanni Manzini",
title = "An experimental study of a compressed index",
journal = "Information Sciences",
volume = "135",
number = "1-2",
pages = "13-28",
year = "2001",
url = "citeseer.ist.psu.edu/ferragina01experimental.html" }
Citations (may not include all citations):344 Arithmetic coding for data compression (context) - Witten, Neal et al. - 1987
280 Managing Gigabytes: Compressing and Indexing Documents and I.. - Witten, Mo et al. - 1999
250 volume 3 of The Art of Computer Programming (context) - Knuth, Searching - 1998
143 A block sorting lossless data compression algorithm - Burrows, Wheeler - 1994
118 GLIMPSE: A tool to search through entire file systems - Manber, Wu - 1994
61 Let sleeping files lie: Pattern matching in Z-compressed fil.. - Amir, Benson et al. - 1996
49 Fast algorithms for sorting and searching strings - Bentley, Sedgewick - 1997
45 String matching in Lempel-Ziv compressed strings - Farach, Thorup - 1998
34 Opportunistic data structures with applications - Ferragina, Manzini - 2000
34 arrays: a new method for on-line string searches (context) - Manber, Myers - 1993
18 Text compression using antidictionaries - Crochemore, Mignosi et al. - 1999
16 Compressed text databases with e#cient query algorithms base.. (context) - Sadakane - 2000
14 Fast searching on compressed text allowing errors (context) - Moura, Navarro et al. - 1998
14 Indexing compressed text - Moura, Navarro et al. - 1997
12 arrays and su#x trees with applications to text indexing and.. (context) - Grossi, Vitter - 2000
12 The Burrows-Wheeler transform for block sorting text compres.. (context) - Fenwick - 1996
7 The bzip2 home page (context) - Seward - 1997
6 Information Retrieval: Data Structures and Algorithms (context) - Gonnet, Baeza-Yates et al. - 1992
6 A locally adaptive compression scheme (context) - Bentley, Sleator et al. - 1986
6 Block addressing indices for approximate text retrieval (context) - Baeza-Yates, Navarro - 2000
4 Compact su#x array (context) - Makinen - 2000
3 National Institute of Standards (context) - Harman, Proc et al. - 1992
http://corpus.canterbury.ac.nz
Documents on the same site (http://www.cs.ucsb.edu/~tamer/research.html): More
A Compression Algorithm for DNA Sequences and Its Applications in.. - Chen (1999) (Correct)
The BT-Tree: A Branched and Temporal Access Method - Jiang, Salzberg, Lomet (1999) (Correct)
Indexing the Distance: An Efficient Method to KNN Processing - Yu, Ooi, Tan, Jagadish (2001) (Correct)
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