Vector Approximation based Indexing for Non-uniform High Dimensional Data Sets

International Conference on Information and Knowledge Management, Proceedings

Volumn 2000-January, Issue , 2000, Pages 202-209

  Ferhatosmanoglu, Hakan ^a   Tuncel, Ertem ^a   Agrawal, Divyakant ^a   El Abbadi, Amr ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; INDEXING (OF INFORMATION); NEAREST NEIGHBOR SEARCH;

'CURRENT; DATA PARTITIONING; DATA SET; HIGH DIMENSIONAL DATA; MULTIMEDIA DATA; NON-UNIFORM; PERFORMANCE; REAL DATA SETS; SPACE PARTITIONING; VA-FILE;

VECTORS;

EID: 85139617617     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/354756.354820     Document Type: Conference Paper

References (24)

1. A. Acharya, M. Uysal, and J. Saltz. Active disks: Programming model, algorithms and evaluation. In ASPLOS-VIII, pages 81-91, September 1998.
2. S. Berchtold, C. Böhm, D. Keim, and H. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In Proc. ACM Symp. on Principles of Database Systems, pages 78-86, Tuscon, Arizona, June 1997.
3. S. Berchtold, D. A. Keim, and H. P. Kreigel. The X-tree: An index structure for high-dimensional data. In 22nd. Conference on Very Large Databases, pages 28-39, Bombay, India, 1996.
4. Kriegel H.-P. Berchtold S. S3: Similarity search in cad database systems. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 564-567, Tuscon, Arizona, 1997.
5. P. Bernstein, M. Brodie, S. Ceri, D. DeWitt, M. Franklin, H. Garcïa-Molïna, J. Gray, J. Held, J. Hellerstein, H. Jagadish, M. Lesk, D. Maier, J. Naughton, H. Pirahesh, M. Stonebraker, and J. Ullman. The Asïlomar report on database research. ACM Sigmod Record, 27(4), December 1998.
6. K. Chakrabartï and S. Mehrotra. The hybrid tree: An index structure for high dimensional feature spaces. In Proc. Int. Conf. Data Engineering, pages 440-447, Sydney, Australia, 1999.
7. X. Cheng, R. Dolin, M. Neary, S. Prabhakar, K. Ravikanth, D. Wu, D. Agrawal, A. El Abbadi, M. Freeston, A. Singh, T. Smith, and J. Su. Scalable access within the context of digital libraries. In IEEE Proceedings of the International Conference on Advances in Digital Libraries, ADL, pages 70-81, Washington, D.C., 1997.
8. Korn F ., Sidiropoulos N., Faloutsos C, Siegel E ., and Protopapas Z. Fast nearest neighbor search in medical image databases. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 215-226, Mumbai, India, 1996.
9. C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz. Efficient and effective querying by image content. Journal of Intelligent Information Systems, 3:231-262, 1994.
10. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data., pages 419-429, Minneapolis, May 1994.
11. V. Gaede and O. Gunther. Multidimensional access methods. ACM Computing Surveys, 30:170-231, 1998.
12. A. Gersho. Vector Quantization and Signal Compression. Kluwer Academic Publishers, Boston, MA, 1992.
13. A. Gionis, P. Indyk, and R. Motwani. Similarity searching in high dimensions via hashing. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 518-529, Edinburgh, Scotland, U K, September 1999.
14. H. Karhunen. Uber lineare methoden in der wahrscheinlich-keitsrechnung. Ann. Acad. Science Fenn, 1947.
15. Y. Linde, A. Buzo, and R. M. Gray. An algorithm for vector quantizer design. IEEE Transactions on Communications, 28:84-95, January 1980.
16. S. P. Lloyd. Least squares quantization in pcm. IEEE Transactions on Information Theory, 28:127-135, March 1982.
17. M. Loeve. Fonctions aléatoires de seconde ordre. Processus Stochastiques et Mouvement Brownien, 1948.
18. D. B. Lomet and B. Salzberg. The hb-tree: A multiattribute indexing method with good guaranteed performance. ACM Transactions on Database Systems, 15(4):625-658, December 1990.
19. J. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Math. Stat, and Prob, volume 1, pages 281-196, 1967.
20. B. S. Manjunath. Airphoto dataset. http://vivaldi.ece.ucsb.edu/Manjunath/research.htm, May 2000.
21. B. S. Manjunath and W. Y. Ma. Texture features for browsing and retrieval of image data. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(8):837-42, August 1996.
22. H. Samet. The Design and Analysis of Spatial Structures. Addison Wesley Publishing Company, Inc., Massachusetts, 1989.
23. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 194-205, New York City, New York, August 1998.
24. D. White and R. Jain. Similarity indexing with the SS-tree. In Proc. Int. Conf. Data Engineering, pages 516- 523, 1996.