Constrained nearest neighbor queries?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2121, Issue , 2001, Pages 257-276

  Ferhatosmanoglu, Hakan ^a   Stanoi, Ioanna ^a   Agrawal, Divyakant ^a   El Abbadi, Amr ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NEAREST NEIGHBOR SEARCH;

GIS SYSTEMS; MULTIMEDIA APPLICATIONS; NEAREST NEIGHBOR QUERIES; NEAREST NEIGHBORS; PERFORMANCE ANALYSIS; RANGE CONSTRAINTS; RANGE QUERY; REVERSE NEAREST NEIGHBOR QUERIES;

QUERY PROCESSING;

EID: 84944033220     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47724-1_14     Document Type: Conference Paper

References (29)

1. P. Bernstein, M. Brodie, S. Ceri, D. DeWitt, M. Franklin, H. GarciaMolina, 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.
2. 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.
3. 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. onPrinciples of Database Systems, pages 78–86, Tuscon, Arizona, June 1997.
4. S. Berchtold, D. A. Keim, and H. P. Kriegel. The x-tree: An index structure for high-dimensional data. In Proceedings of the 22nd InternationalConference on Very Large Databases (VLDB), pages 28–36, 1996.
5. 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 ofData, pages 322–331, May 1990.
6. 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 Proceedingsof the International Conference on Advances in Digital Libraries, ADL, pages 70–81, Washington, D.C., 1997.
7. 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.
8. H. Ferhatosmanoglu, D. Agrawal, and A. El Abbadi. Clustering declustered data for efficient retrieval. In Proc. Conf. on Information and Knowledge Management, pages 343–350, Kansas City, Missouri, November 1999.
9. H. Ferhatosmanoglu, D. Agrawal, and A. El Abbadi. Concentric hyperspaces and disk allocation for fast parallel range searching. In Proc. Int.Conf. Data Engineering, pages 608–615, Sydney, Australia, March 1999.
10. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi. Approximate nearest neighbor searching in multimedia databases. In Proc of 17thIEEE Int. Conf. on Data Engineering (ICDE), pages 503–511, Heidelberg, Germany, April 2001.
11. J. D. Foley, A. Van Dam, S. K. Feiner, and J. F. Hughes. ComputerGraphics: Principles and Practice. Addison Wesley, 1996.
12. V. Gaede and O. Gunther. Multidimensional access methods. ACM Computing Surveys, 30:170–231, 1998.
13. A. Gionis, P. Indyk, and R. Motwani. Similarity searching in high dimensions via hashing. In Proceedings of the Int. Conf. on Very Large DataBases, pages 518–529, Edinburgh, Scotland, UK, September 1999.
14. 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.
15. 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.
16. G. Hjaltason and H. Samet. Distance browsing in spatial databases. ACMTransactions on Database Systems, 24(2):265–318, 1999.
17. I. Kamel and C. Faloutsos. On packing r-trees. In Proceedings of the2nd International Conference on Information and Knowledge Management(CIKM), pages 490–499, 1993.
18. I. Kamel and C. Faloutsos. Hilbert r-tree: An improved r-tree using fractals. In Proceedings of the International Conference on Very LargeDatabases, September 1994.
19. F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management ofData, Dallas, USA, May 2000.
20. D. B. Lomet and B. Salzberg. The hb-tree: A multi-attribute indexing method with good guaranteed performance. ACM Transactions onDatabase Systems, 15(4):625–658, December 1990.
21. B. S. Manjunath. Airphoto dataset. http://vivaldi.ece.ucsb.edu/Manjunath/research.htm, May 2000.
22. B. S. Manjunath and W. Y. Ma. Texture features for browsing and retrieval of image data. IEEE Transactions on Pattern Analysis and MachineIntelligence, 18(8):837–42, August 1996.
23. J. Nievergelt, H. Hinterberger, and K.C. Sevcik . The grid file: an adaptable, symmetric multikey file structure. ACM Transactions on Database Systems9, 1:38–71, March 1984.
24. G. Proietti and C. Faloutsos. I/o complexity for range queries on region data stored using an r-tree. In Proceedings of the International Conferenceon Data Engineering (ICDE), March 1999.
25. 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.
26. J. T. Robinson. The kdb-tree: A search structure for large multidimensional dynamic indexes. In Proc. ACM SIGMOD Int. Conf. onManagement of Data, pages 10–18, 1981.
27. I. Stanoi, D. Agrawal, and A. El Abbadi. Reverse nearest neighbor queries for dynamic databases. In Proceedings of the ACM SIGMOD Workshopon Data Mining and Knowledge Discovery (DMKD), 2000.
28. H. Samet. The Design and Analysis of Spatial Structures. Addison Wesley Publishing Company, Inc., Massachusetts, 1989.
29. T. Sellis and N. Roussopoulos. The r+-tree: A dynamic index for multidimensional objects. In Proceedings of the 13th International Conference onVery Large Databases (VLDB), pages 507–518, May 1987.