Vulnerabilities in similarity search based systems

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2002, Pages 110-117

  Tosun, Ali Şaman ^a   Ferhatosmanoglu, Hakan ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CRIME; INFORMATION RETRIEVAL SYSTEMS; MATHEMATICAL MODELS; MULTIMEDIA SYSTEMS; QUERY LANGUAGES; SECURITY OF DATA; SECURITY SYSTEMS;

SIMILARITY BASED QUERIES; SIMILARITY SEARCH;

ONLINE SEARCHING;

EID: 0038156434     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/584792.584813     Document Type: Conference Paper

References (23)

1. G. Ankerst, M. and Kastenmller, H. Kriegel, and T. Seidl. Nearest neighbor classification in 3d protein databases. In Proc. 7th Int. Conf. on Intelligent Systems for Molecular Biology (ISMB'99).
2. M. Ankerst, H. Kriegel, and T. Seidl. A multi-step approach for shape similarity in image databases. IEEE Transactions on Data Engineering (TKDE'98), 10(6), 1998.
3. S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching. In 5th Ann. ACM-SIAM Symposium on Discrete Algorithms, pages 573-582, 1994.
4. 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.
5. K. 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.
6. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful. In Int. Conf. on Database Theory, pages 217-225, Jerusalem, Israel, Jan. 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. P. Ciaccia and M. Patella. PAC nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In Proc. Int. Conf. Data Engineering, pages 244-255, San Diego, California, Mar. 2000.
9. W. Du and M. Atallah. Protocols for secure remote database access with approximate matching. In 7th ACM Conference of Computer and Communications Security (ACMCSS 2000). The First Workshop on Security and Privacy in E-commerce.
10. 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.
11. 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.
12. H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A. E. Abbadi, Constrained nearest neighbor queries, In Proc. of the 7th International Symposium on Spatial and Temporal Databases (SSTD), Los Angeles, CA, July 2001.
13. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. E. Abbadi. Vector approximation based indexing for non-uniform high dimensional data sets. In Proceedings of the 9th ACM Int. Conf. on Information and Knowledge Management, pages 202-209, McLean, Virginia, Nov. 2000.
14. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. E. Abbadi. Approximate nearest neighbor searching in multimedia databases. In Proc of 17th IEEE Int. Conf. on Data Engineering (ICDE), pages 503-511, Heidelberg, Germany, Apr. 2001.
15. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the course of dimensionality. In 30th ACM Symposium on Theory of Computing, pages 604-613, Dallas, Texas, May 1998.
16. T. Kahveci and A. Singh. An efficient index structure for string databases. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 351-360, Roma, Italy, Sept. 2001.
17. F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. Fast and efficient retrieval of medical tumor shapes. IEEE Transactions on Data Engineering (TKDE'98).
18. F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. 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.
19. G. Miklan and D. Suciu. Cryptographically enforced conditional access for xml. In WebDB, 2002.
20. N. Roussopoulos, S. Kelly, and F. Vincent. Nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 71-79, San Jose, California, May 1995.
21. V. Subrahmanian. Principles of Multimedia Database Systems. Morgan Kaufmann Publishers, Inc., San Francisco, California, 1999.
22. Y. Ting, M. Winslett, and K. Seamons. Automated trust negotiation over the internet. In 6th World Multiconference on Systemics, Cybernetics and Informatics, July 2002.
23. R. Weber and K. Bohm. Trading quality for time with nearest-neighbor search. In Proc. Int. Conf. on Extending Database Technology, pages 21-35, Konstanz, Germany, Mar. 2000.