Advertisement

Constrained Nearest Neighbor Queries

  • Hakan Ferhatosmanoglu
  • Ioanna Stanoi
  • Divyakant Agrawal
  • Amr El Abbadi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2121)

Abstract

In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as nearest neighbor queries with range constraints. Although both nearest neighbor and range queries have been analyzed extensively in previous literature, the implications of constrained nearest neighbor queries have not been discussed. Due to their versatility, CNN queries are suitable to a wide range of applications from GIS systems to reverse nearest neighbor queries and multimedia applications. We develop methods for answering CNN queries with different properties and advantages. We prove the optimality (with respect to I/O cost) of one of the techniques proposed in this paper. The superiority of the proposed technique is shown by a performance analysis.

Keywords

Near Neighbor Convex Polygon Range Query Query Result Query Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BBC+98]
    P. Bernstein, M. Brodie, S. Ceri, D. DeWitt, M. Franklin, H. Garcia-Molina, J. Gray, J. Held, J. Hellerstein, H. Jagadish, M. Lesk, D. Maier, J. Naughton, H. Pirahesh, M. Stonebraker, and J. Ullman. The Asilomar report on database research. ACM Sigmod Record, 27(4), December 1998.Google Scholar
  2. [BBK98]
    S. Berchtold, C. Bohm, and H.-P. Kriegel. The Pyramid-Technique: Towards breaking the curse of dimensionality. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 142–153, Seattle, Washington, USA, June 1998.Google Scholar
  3. [BBKK97]
    S. Berchtold, C. Bohm, 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.Google Scholar
  4. [BKK96]
    S. Berchtold, D. A. Keim, and H. P. Kriegel. The x-tree: An index structure for high-dimensional data. In Proceedings of the 22nd International Conference on Very Large Databases (VLDB), pages 28–36, 1996.Google Scholar
  5. [BKSS90]
    N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger. The r*-tree: An efficient and robust access method for points and reactangles. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 322–331, May 1990.Google Scholar
  6. [CDN+97]
    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.Google Scholar
  7. [EKK00]
    M. Ester, J. Kohlhammer, and H. P. Kriegel. The dc-tree: a fully dynamic index structure for data warehouses. In Proceedings of the 16th International Conference on Data Engineering (ICDE), March 2000.Google Scholar
  8. [FAA99a]
    H. Ferhatosmanoglu, D. Agrawal, and A. El Abbadi. Clustering declus-tered data for efficient retrieval. In Proc. Conf. on Information and Knowledge Management, pages 343–350, Kansas City, Missouri, November 1999.Google Scholar
  9. [FAA99b]
    H. Ferhatosmanoglu, D. Agrawal, and A. El Abbadi. Concentric hyper-spaces and disk allocation for fast parallel range searching. In Proc. Int. Conf. Data Engineering, pages 608–615, Sydney, Australia, March 1999.Google Scholar
  10. [FTAA01]
    H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi. Approximate nearest neighbor searching in multimedia databases. In Proc of 17th IEEE Int. Conf. on Data Engineering (ICDE), pages 503–511, Heidelberg, Germany, April 2001.Google Scholar
  11. [FVFH96]
    J. D. Foley, A. Van Dam, S. K. Feiner, and J. F. Hughes. Computer Graphics: Principles and Practice. Addison Wesley, 1996.Google Scholar
  12. [GG98]
    V. Gaede and O. Gunther. Multidimensional access methods. ACM Computing Surveys, 30:170–231, 1998.CrossRefGoogle Scholar
  13. [GIM99]
    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, UK, September 1999.Google Scholar
  14. [Gut84]
    A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 47–57, June 1984.Google Scholar
  15. [HS95]
    G. R. Hjaltason and H. Samet. Ranking in spatial databases. In Proc. of 4th Int. Symp. on Large Spatial Databases, pages 83–95, Portland,ME, 1995.Google Scholar
  16. [HS99]
    G. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Transactions on Database Systems, 24(2):265–318, 1999.CrossRefGoogle Scholar
  17. [KF93]
    I. Kamel and C. Faloutsos. On packing r-trees. In Proceedings of the 2nd International Conference on Information and Knowledge Management (CIKM), pages 490–499, 1993.Google Scholar
  18. [KF94]
    I. Kamel and C. Faloutsos. Hilbert r-tree: An improved r-tree using fractals. In Proceedings of the International Conference on Very Large Databases, September 1994.Google Scholar
  19. [KM00]
    F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, Dallas, USA, May 2000.Google Scholar
  20. [LS90]
    D. B. Lomet and B. Salzberg. The hb-tree: A multi-attribute indexing method with good guaranteed performance. ACM Transactions on Database Systems, 15(4):625–658, December 1990.Google Scholar
  21. [Man00]
    B. S. Manjunath. Airphoto dataset. http://vivaldi.ece.ucsb.edu/Manjunath/research.htm, May 2000.
  22. [MM96]
    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.Google Scholar
  23. [NHK84]
    J. Nievergelt, H. Hinterberger, and K.C. Sevcik. The grid file: an adaptable, symmetric multikey file structure. ACM Transactions on Database Systems 9,1:38–71, March 1984.Google Scholar
  24. [PF99]
    G. Proietti and C. Faloutsos. I/o complexity for range queries on region data stored using an r-tree. In Proceedings of the International Conference on Data Engineering (ICDE), March 1999.Google Scholar
  25. [RKV95]
    N. Roussopoulos, S. Kelly, and F. Vincent. Nearest neighbor queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 71–79, May 1995.Google Scholar
  26. [Rob81]
    J. T. Robinson. The kdb-tree: A search structure for large multidimensional dynamic indexes. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 10–18, 1981.Google Scholar
  27. [SAA00]
    I. Stanoi, D. Agrawal, and A. El Abbadi. Reverse nearest neighbor queries for dynamic databases. In Proceedings of the ACM SIGMOD Workshop on Data Mining and Knowledge Discovery (DMKD), 2000.Google Scholar
  28. [Sam89]
    H. Samet. The Design and Analysis of Spatial Structures. Addison Wesley Publishing Company, Inc., Massachusetts, 1989.Google Scholar
  29. [SR87]
    T. Sellis and N. Roussopoulos. The r+-tree: A dynamic index for multidimensional objects. In Proceedings of the 13th International Conference on Very Large Databases (VLDB), pages 507–518, May 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Hakan Ferhatosmanoglu
    • 1
  • Ioanna Stanoi
    • 1
  • Divyakant Agrawal
    • 1
  • Amr El Abbadi
    • 1
  1. 1.Computer Science DepartmentUniversity of California at Santa BarbaraUSA

Personalised recommendations