Sciweavers

1567 search results - page 34 / 314
» Compressing Relations and Indexes
Sort
View
ACSC
2005
IEEE
14 years 2 months ago
Fractal Image Compression on a Pseudo Spiral Architecture
Fractal image compression is a relatively recent image compression method which exploits similarities in different parts of the image. The basic idea is to represent an image by f...
Huaqing Wang, Meiqing Wang, Tom Hintz, Xiangjian H...
WISE
2002
Springer
14 years 1 months ago
Cluster-Based Delta Compression of a Collection of Files
Delta compression techniques are commonly used to succinctly represent an updated version of a file with respect to an earlier one. In this paper, we study the use of delta compr...
Zan Ouyang, Nasir D. Memon, Torsten Suel, Dimitre ...
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 9 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
CIE
2009
Springer
14 years 3 months ago
Equivalence Relations on Classes of Computable Structures
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
Ekaterina B. Fokina, Sy-David Friedman
VLDB
1993
ACM
138views Database» more  VLDB 1993»
14 years 1 months ago
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
Justin Zobel, Alistair Moffat, Ron Sacks-Davis