The SS+-tree: An improved index structure for similarity searches in a high-dimensional feature space

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 3022, Issue , 1997, Pages 110-120

  Kurniawati, R ^a   Jin, J S ^a   Shepherd, J A ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Enclosing boxes (MBR); Enclosing spheres; High dimensional indexing and retrieval; Multimedia databases; Similarity search

Indexed keywords

APPROXIMATION ALGORITHMS; DATABASE SYSTEMS; DIGITAL STORAGE; K-MEANS CLUSTERING; SPHERES; VIDEO RECORDING;

CLUSTERING PROPERTIES; ENCLOSING BOXES (MBR); EUCLIDEAN SPACES; HIGH-DIMENSIONAL; HIGH-DIMENSIONAL FEATURE SPACE; HIGH-DIMENSIONAL INDEXING; MULTIMEDIA DATABASE; SIMILARITY SEARCH;

TREES (MATHEMATICS);

EID: 85076094365     PISSN: 0277786X     EISSN: 1996756X     Source Type: Conference Proceeding    
DOI: 10.1117/12.263400     Document Type: Conference Paper

References (27)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching. 5th Ann. ACM-SIAM Symposium on Discrete Algorithms, pages 573-582, 1995. revised version.
2. F. Aurenhammer. Voronoi diagrams -A survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3):345-405, Sept. 1991.
3. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R∗tree: an efficient and robust access method for points and rectangles. ACM SIGMOD, pages 322-331, May 1990.
4. S. Berchtold, D. A. Keim, and D.-P. Kriegel. The X-tree: An index structure for high-dimensional data. In Proc. 2th Int. Conf. on Very Large Data Bases, Bombay, India, 1996. To appear.
5. J. G. Cleary. Analysis of an algorithm for finding nearest neighbors in Euclidean space. ACM Transactions on Mathematical Software, 5(2):183-192, June 1979.
6. D. Elzinga and D. Hearn. The minimum covering sphere problem. Management Science, 19(1):96-104, sep 1972.
7. D. J. Elzinga and D. W. Hearn. Geometrical solutions for some minimax location problems. Transportation Science, 6(4):379-394, 1972.
8. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Conf., pages 47-57, Boston, MA, June 1984. Also published in/as: UCB, Elec.Res.Lab, Res.R. No.M83-64, 1983, with Stonebraker, M. and reprinted in M. Stonebraker, Readings in Database Sys., Morgan Kaufmann, San Mateo, CA, 1988.
9. H. V. Jagadish. Indexing for retrieval by similarity. In V. Subrahmanian and S. Jajodia, editors, Multimedia Database Systems: Issues and Research Directions. Springer-Verlag, 1996.
10. J. Jin, L. S. Tiu, and S. W. S. Tam. Partial image retrieval in multimedia databases. In Proceedings of Image and Vision Computing New Zealand, pages 179-184, Christchurch, 1995. Industrial Research Ltd.
11. J. S. Jin, B. W. Lowther, D. J. Robertson, and M. E. Jefferies. Shape representation and pattern matching under the multi-channel theory. In Proceedings of The 3rd Pacific Rim International Conference on Artificial Intelligence, pages 970-975, Beijing, 1994.
12. I. Kamel and C. Faloutsos. On packing R-trees. Second Int. Conf. on Information and Knowledge Management (CIKM), Nov. 1993.
13. K.-I. Lin, H. V. Jagadish, and C. Faloutsos. The TV-tree: An index structure for high-dimensional data. VLDB Journal, 3(4):517-549, Oct. 1994.
14. J. B. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of the Berkeley Symposium on Mathematical Statistics and Probability, volume 1(5), pages 281-297, 1967.
15. N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems. SIAM Journal on Computing, 12:759-776, 1983.
16. M. Minsky and S. Papert. Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge, 1969.
17. W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, P. Yanker, C. Faloutsos, and G. Taubin. The QBIC project: Querying images by content using color, texture and shape. SPIE 1993 Intl. Symposium on Electronic Imaging: Science and Technology, Storage and Retrieval for Image and Video Databases, 1908:173-187, Feb. 1993. Also available as IBM Research Report RJ 9203 (81511), Feb. 1, 1993, Computer Science.
18. P. J. M. v. Oosterom. Reactive data structures for geographic information systems. Oxford University Press, New York, 1993.
19. B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer. Towards an analysis of range queries performance in spatial data structures. In Proc. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Sys., Washington, DC, May 1993.
20. A. Pentland, R. W. Picard, and S. Sclaroff. Photobook: Content-based manipulation of image databases. In SPIE Storage and Retrieval Image and Video Databases II, volume 2185, San Jose, Feb 1995. SPIE. Also in International Journal of Computer Vision, Fall 1995.
21. M. Schroeder. Fractals, Chaos, Power Laws: Minutes From an Infinite Paradise. W.H. Freeman and Company, New York, 1991.
22. T. Sellis, N. Roussopoulos, and C. Faloutsos. The Rtree: A dynamic index for multi-dimensional objects. In Proceedings of the 13th Conference on Very Large Databases, pages 507-518, Los Altos, CA, Sept. 1987. Morgan Kaufman. also available as SRC-TR-87-32, UMIACS-TR-87-3, CS-TR-1795.
23. M. Turk and A. Pentland. Eigenfaces for recognition. Journal of Cognitive Neuroscience, 3(1):71-86, 1991.
24. E. Welzl. Smallest enclosing disks (balls and ellipsoids) . In H. Maurer, editor, Proceedings of New Results and New Trends in Computer Science, pages 359-370. LNCS 555. Springer, June 1991.
25. D. A. White and R. Jam. Algorithms and strategies for similarity retrieval. Technical Report VCL-96-01, Visual Computing Laboratory, University of California, San Diego, 9500 Gilman Drive, Mail Code 0407, La Jolla, CA 92093-0407, July 1996.
26. D. A. White and R. Jam. Similarity indexing: Algorithms and performance. In Proceedings of the SPIE: Storage and Retrieval for Image and Video Databases IV, volume 2670, San Jose, CA, Feb. 1996.
27. D. A. White and R. Jam. Similarity indexing with the SS-tree. In Proc. 12th IEEE International Conference on Data Engineering, New Orleans, Louisiana, Feb. 1996.