Sciweavers

105 search results - page 10 / 21
» Tree Structure Compression with RePair
Sort
View
DCC
2001
IEEE
15 years 9 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher
CSB
2002
IEEE
221views Bioinformatics» more  CSB 2002»
15 years 2 months ago
DNA Sequence Compression Using the Burrows-Wheeler Transform
-- We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns i...
Donald A. Adjeroh, Yong Zhang, Amar Mukherjee, Mat...
70
Voted
ICMCS
2005
IEEE
116views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Lossless image compression with tree coding of magnitude levels
With the rapid development of digital technology in consumer electronics, the demand to preserve raw image data for further editing or repeated compression is increasing. Traditio...
Hua Cai, Jiang Li
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
15 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 1 months ago
Oracle8i Index-Organized Table and Its Application to New Domains
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...
Jagannathan Srinivasan, Souripriya Das, Chuck Frei...