Rate-distortion approach to databases: Storage and content-based retrieval

IEEE Transactions on Information Theory

Volumn 50, Issue 6, 2004, Pages 953-967

  Tuncel, Ertem ^a   Koulgi, Prashant ^b   Rose, Kenneth ^a  

^a University of California Riverside   (United States)

^b University of California   (United States)

Author keywords

Approximate similarity searching; Content based retrieval; Databases; Scalable coding; Successive refinability without rate loss; Wyner Ziv problem; Zero one distortion measures

Indexed keywords

CONTENT BASED RETRIEVAL; DATA COMPRESSION; DECODING; ENCODING (SYMBOLS); INDEXING (OF INFORMATION); MAGNETIC DISK STORAGE; MULTIMEDIA SYSTEMS;

APPROXIMATELY SIMILARITY SEARCHING; RATE-DISTORTION; SCALABLE CODING; ZERO-ONE DISTORTION MEASURES;

DATABASE SYSTEMS;

EID: 2942650789     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.828068     Document Type: Article

References (18)

1. S. Berchtold, D. Keim, and H. Kriegel, "The X-tree: An index structure for high-dimensional data," in Proc. Int. Conf. Very Large Data Bases, Bombay, India, pp. 28-39.
2. T. Berger, Rate Distortion Theory. A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
3. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When is "nearest neighbor" meaningful?," in Proc. Int. Conf. Database Theory, Jerusalem, Israel, Jan. 1999, pp. 217-225.
4. K. Chakrabarti and S. Mehrotra, "Local dimensionality reduction: A new approach to indexing high dimensional databases," in Proc. 26th Int. Conf. Very Large Databases, Cairo, Egypt, Sept. 2000, pp. 89-100.
5. I. Csiszár and J. Körmer, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1982.
6. W. H. R. Equitz and T. M. Cover, "Successive refinement of information," IEEE Trans. Inform. Theory, vol. 37, pp. 269-275, Mar. 1991.
7. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi, "Approximate nearest neighbor searching in multimedia databases," in Proc. 17th IEEE Int. Conf. Data Engineering, Heidelberg, Germany, Apr. 2001, pp. 503-511.
8. A. El Gamal and T. M. Cover, "Achievable rates for multiple descriptions," IEEE Trans. Inform. Theory, vol. IT-28, pp. 851-857, Nov. 1982.
9. A. Guttman, "R-trees: A dynamic index structure for spatial searching," in Proc. ACM SIGMOD Int. Conf. Management of Data, 1984, pp. 47-57.
10. K. V. R. Kanth, D. Agrawal, and A. K. Singh, "Dimensionality reduction for similarity searching dynamic databases," in Proc. ACM SIGMOD Int. Conf. Management of Data, Seattle, WA, June 1998, pp. 166-176.
11. T. Linder, R. Zamir, and K. Zeger, "On source coding with side-information-dependent distortion measures," IEEE Trans. Inform. Theory, vol. 46, pp. 2697-2704, Nov. 2000.
12. B. Rimoldi, "Successive refinement of information: Characterization of the achievable rates," IEEE Trans. Inform. Theory, vol. 40, pp. 253-259, Jan. 1994.
13. J. T. Robinson, "The kdb-tree: A search structure for large multi-dimensional dynamic indexes," in Proc. ACM SIGMOD Int. Conf. Management of Data, 1981, pp. 10-18.
14. E. Tuncel, H. Ferhatosmanoglu, and K. Rose, "VQ-index: An index structure for similarity searching in multimedia databases," in Proc. ACM Multimedia Conf., Juan Les Pins, France, Dec. 2002, pp. 543-552.
15. E. Tuncel and K. Rose, "Computation and analysis of the N-layer scalable rate distortion function," IEEE Trans. Inform. Theory, vol. 49, pp. 1218-1230, May 2003.
16. R. Weber and K. Bohm, "Trading quality for time with nearest-neighbor search," in Proc. Int. Conf. Extending Database Technology, Konstanz, Germany, Mar. 2000, pp. 21-35.
17. R. Weber, H. J. Schek, and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," in Proc. Int. Conf. Very Large Data Bases, New York, Aug. 1998, pp. 194-205.
18. A. D. Wyner and J. Ziv, "The rate distortion function for source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. IT-22, pp. 1-11, Jan. 1976.