The Active Vertice method: A performant filtering approach to high-dimensional indexing

Data and Knowledge Engineering

Volumn 51, Issue 3, 2004, Pages 369-397

  Balko, Sören ^a   Schmitt, Ingo ^a   Saake, Gunter ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Approximation index; Hashing and indexing; High dimensional indexing; Nearest neighbor search; Storage and access

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATABASE SYSTEMS; NONBIBLIOGRAPHIC RETRIEVAL SYSTEMS; QUERY LANGUAGES; TREES (MATHEMATICS); VECTORS;

APPROXIMATION INDEXING; HASHING AND INDEXING; HIGH-DIMENSIONAL INDEXING; NEAREST NEIGBOR SEARCH; STORAGE AND ACCESS;

MULTIMEDIA SYSTEMS;

EID: 5144221763     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2004.06.002     Document Type: Article

References (47)

1. Goh S.-T., Tan K.-L. MOSAIC: a fast multi-feature image retrieval system. Data and Knowledge Engineering. 33(3):2000;219-239.
2. Ngu A.H.H., Sheng Q.Z., Huynh D.Q., Lei, R. Combining multi-visual features for efficient indexing in a large image database. The VLDB Journal. 9(4):2001;279-293.
3. Bayer R., McCreight E. Organization and maintenance of large ordered indexes. Acta Informatica. 1(3):1972;173-189.
4. +-tree: a dynamic index for multi-dimensional objects, in: P.M. Stocker, W. Kent (Eds.), Proc. of the 13th Int. Conf. on Very Large Data Bases, VLDB'87, Brighton, England, September 1-4, 1987, Morgan Kaufmann Publishers, Los Altos, CA, 1987, pp. 507-518.
5. N. Katayama, S. Satoh, The SR-tree: an index structure for high-dimensional nearest neighbor queries, in: Proc. Int. Conf. on Management of Data, vol. 26, no. 2, 1997, pp. 369-380.
6. S. Berchtold, D.A. Keim, H.-P. Kriegel, The X-tree: an index structure for high-dimensional data, in: VLDB, 1996, pp. 28-39.
7. D.A. White, R. Jain, Similarity indexing with the ss-tree, in: S.Y.W. Su (Ed.), Proceedings of the Twelfth International Conference on Data Engineering, February 26-March 1, 1996, New Orleans, Louisiana, IEEE Computer Society, 1996, pp. 516-523. ISBN 0-8186-7240-4.
8. R. Weber, H.-J. Schek, S. Blott, A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces, in: VLDB, 1998, pp. 194-205.
9. S. Berchtold, C. Böhm, D.A. Keim, H.-P. Kriegel, A cost model for nearest neighbor search in high-dimensional data space, in: Proc. of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS'97, Tuscon, Arizona, USA, ACM Press, New York, 1997, pp. 78-86.
10. S. Berchtold, C. Böhm, D. Keim, F. Krebs, H.-P. Kriegel, On optimizing nearest neighbor queries in high dimensional spaces, in: Database Theory - ICDT'01, Proc. of the 8th Int. Conf., London, January 2001, vol. 1973, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2001, pp. 435-449.
11. K. Beyer, J. Goldstein, R. Ramakrishnan, U. Shaft, When is nearest neighbor meaningful, in: ICDT, vol. 1540, Lecture Notes in Computer Science, 1999, pp. 217-235.
12. A. Hinneburg, D.A. Keim, Optimal grid-clustering: towards breaking the curse of dimensionality in high-dimensional clustering, in: M.P. Atkinson, M.E. Orlowska, P. Valduriez, S.B. Zdonik, M.L. Brodie (Eds.), Proc. of the 25th Int. Conf. on Very Large Data Bases, VLDB'99, Edinburgh, Scotland, UK, September 7-10, 1999, Morgan Kaufmann Publishers, 1999, pp. 506-517.
13. P. Indyk, High-Dimensional Computational Geometry, Dissertation, Stanford University, September 2000.
14. Niemann H., Goppert R. An efficient branch-and-bound nearest neighbour classifier. Pattern Recognition Letters. 7:1988;67-72.
15. G.R. Hjaltason, H. Samet, Ranking in spatial databases, in: M.J. Egenhofer, J.R. Herring (Eds.), Advances in Spatial Databases, 4th International Symposium, SSD'95, vol. 951, Lecture Notes in Computer Science, 1995, pp. 83-95.
16. N. Roussopoulos, S. Kelley, F. Vincent, Nearest neighbor queries, in: M.J. Carey, D. A. Schneider (Eds.), Proc. of the 1995 ACM SIGMOD Int. Conf. on Management of Data, San Jose, CA, ACM Press, 1995, pp. 71-79.
17. A. Guttman, R-trees: a dynamic index structure for spatial searching, in: Proc. Int. Conf. on Management of Data (SIGMOD'84), New York, 1984, pp. 47-57.
18. *-tree: an efficient and robust access method for points and rectangles, in: H. Garcia-Molina, H. Jagadish (Eds.), Proc. of the 1990 ACM SIGMOD Int. Conf. on Management of Data, Atlantic City, NJ, ACM Press, 1990, pp. 322-331.
19. Lin K.-I., Jagadish H.V., Faloutsos C. The TV-tree - an index structure for high-dimensional data. The VLDB Journal. 3(4):1994;517-549.
20. Berchtold S., Keim D.A., Kriegel H.-P., Seidl T. Indexing the solution space: a new technique for nearest neighbor search in high-dimensional space. IEEE Transactions on Knowledge and Data Engineering. 12(1):2000;45-57.
21. J. Goldstein, R. Ramakrishnan, Contrast plots and P-sphere trees: space vs. time in nearest neighbor searches, in: VLDB, 2000, pp. 429-440.
22. C. Yu, B.C. Ooi, K.-L. Tan, H. Jagadish, Indexing the distance: an efficient method to KNN processing, in: VLDB, 2001, pp. 421-430.
23. P. Ciaccia, M. Patella, P. Zezula, M-tree: An efficient access method for similarity search in metric spaces, in: VLDB, 1997, pp. 426-435.
24. R.F.S. Filho, A. Traina, Caetano Traina Jr., C. Faloutsos, Similarity search without tears: the OMNI-family of all-purpose access methods, in: ICDE, 2001, pp. 623-630.
25. Caetano Traina Jr., A. J. M. Traina, B. Seeger, C. Faloutsos, Slim-trees: high performance metric trees minimizing overlap between nodes, in: EDBT, vol. 1777, Lecture Notes in Computer Science, 2000, pp. 51-65.
26. I. Schmitt, Nearest neighbor search in high dimensional space by using convex hulls, Preprint 6, University of Magdeburg, 2001.
27. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, A.E. Abbadi, Vector approximation based indexing for non-uniform high dimensional data sets, in: Proc. of the 9th ACM CIKM Int. Conf. on Information and Knowledge Management, November 6-11, 2000, McLean, VA, USA, ACM Press, New York, 2000, pp. 202-209.
28. K. Chakrabarti, S. Mehrotra, Local dimensionality reduction: a new approach to indexing high dimensional spaces, in: A.E. Abbadi, M.L. Brodie, S. Chakravarthy, U. Dayal, N. Kamel, G. Schlageter, K.-Y. Whang (Eds.), Proc. of the 26th Int. Conf. on Very Large Data Bases, VLDB'00, Cairo, Egypt, September 10-14, 2000, Morgan Kaufmann Publishers, 2000, pp. 89-100.
29. A. Hinneburg, C.C. Aggarwal, D.A. Keim, What is the nearest neighbor in high dimensional spaces? in: A.E. Abbadi, M.L. Brodie, S. Chakravarthy, U. Dayal, N. Kamel, G. Schlageter, K.-Y. Whang (Eds.), VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, September 10-14, 2000, Cairo, Egypt, Morgan Kaufmann, 2000, pp. 506-515.
30. P. Wu, B. Manjunath, Adaptive nearest neighbor search for relevance feedback in large image databases, in: Proceedings ACM Multimedia 01, ACM Multimedia, ACM Press, Ottawa, Canada, 2001, pp. 89-97.
31. Cha G.-H., Zhu X., Petkovic D., Chung C.-W. An efficient indexing method for nearest neighbor searches in high-dimensional image databases. IEEE Transactions on Multimedia. 4(1):2002;76-87.
32. Cha G.-H., Chung C.-W. The GC-tree: a high-dimensional index structure for similarity search in image databases. IEEE Transactions on Multimedia. 4(2):2002;235-247.
33. Y. Sakurai, M. Yoshikawa, S. Uemura, H. Kojima, The A-tree: an index structure for high-dimensional spaces using relative approximation, in: VLDB, 2000, pp. 516-526.
34. S. Berchtold, C. Böhm, H. Jagadish, H.-P. Kriegel, J. Sander, Independent quantization: an index compression technique for high-dimensional data spaces, in: ICDE, 2000, pp. 577-588.
35. Samet H. The quadtree and related hierarchical data structures. ACM Computing Surveys. 16(2):1984;187-260.
36. S. Balko, Grundlagen, Entwicklung und Evaluierung einer effizienten Approximationstechnik für Nearest-Neighbor-Anfragen im hochdimensionalen Vektorraum, DISBIS - Dissertationen zu Datenbanken und Informationssystemen, Akademische Verlagsgesellschaft, Berlin, in press.
37. M. Ankerst, B. Braunmüller, H.-P. Kriegel, T. Seidl, Improving adaptable similarity query processing by using approximations, in: A. Gupta, O. Shmueli, J. Widom (Eds.), VLDB'98, Proceedings of 24th International Conference on Very Large Data Bases, August 24-27, 1998, New York City, New York, USA, Morgan Kaufmann, 1998, pp. 206-217. ISBN 1-55860-566-5.
38. T. Seidl, H.-P. Kriegel, Efficient user-adaptable similarity search in large multimedia databases, in: M. Jarke, M.J. Carey, K.R. Dittrich, F.H. Lochovsky, P. Loucopoulos, M. A. Jeusfeld (Eds.), VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece, Morgan Kaufmann, 1997, pp. 506-515. ISBN 1-55860-470-7.
39. Hart J.C. Distance to an ellipsoid. Heckbert P.S. Graphics Gems IV. 1994. 113-119 AP Professional, Boston. (Chapter II.1). ISBN 0-12-336155-9.
40. Press W.H., Teukolsky S.A., Vetterling, W.T., Flannery B.P. Numerical Recipes in C++, The Art of Scientific Computing. second ed. 2002;Cambridge University Press, Cambridge. ISBN 0-521-75033-4.
41. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;The MIT Press. ISBN 0-262-03141-8.
42. Kincaid D., Cheney W. Numerical Analysis - Mathematics of Scientific Computing. third ed. 2002;Brooks/Cole, Pacific Grove. ISBN 0-534-38905-8.
43. Acton F.S. Numerical Methods that Work. 1990;The Mathematical Association of America. ISBN 0-88385-450-3.
44. Swain M.J., Ballard D.H. Color indexing. International Journal of Computer Vision. 7(1):1991;11-32.
45. J.R. Smith, S.-F. Chang, Tools and techniques for color image retrieval, in: Symposium on Electronic Imaging: Science and Technology - Storage & Retrieval for Image and Video Databases IV (IS&T/SPIE), Proceedings, San Jose, CA, vol. 2670, 1996, pp. 426-437.
46. C. Faloutsos, K.-I. Lin, FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets, in: M. J. Carey, D. A. Schneider (Eds.), Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, CA, May 22-25, 1995, ACM Press, 1995, pp. 163-174.
47. Nievergelt J., Hinterberger H., Sevcik K.C. The grid file: an adaptable, symmetric multikey file structure. ACM Transactions on Database Systems (TODS). 9(1):1984;38-71.