Sciweavers

99 search results - page 13 / 20
» Compression, Indexing, and Retrieval for Massive String Data
Sort
View
IPL
2010
84views more  IPL 2010»
13 years 6 months ago
Wee LCP
We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the su...
Johannes Fischer
BMCBI
2007
128views more  BMCBI 2007»
13 years 8 months ago
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assess
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
Paolo Ferragina, Raffaele Giancarlo, Valentina Gre...
SPIRE
2010
Springer
13 years 6 months ago
Dual-Sorted Inverted Lists
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
Gonzalo Navarro, Simon J. Puglisi
MSS
2003
IEEE
108views Hardware» more  MSS 2003»
14 years 1 months ago
Effective Management of Hierarchical Storage Using Two Levels of Data Clustering
When data resides on tertiary storage, clustering is the key to achieving high retrieval performance. However, a straightforward approach to clustering massive amounts of data on ...
Ratko Orlandic
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 8 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu