Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
S3: similarity search in CAD database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Scalable access within the context of digital libraries
IEEE ADL '97 Proceedings of the IEEE international forum on Research and technology advances in digital libraries
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of multimedia database systems
Principles of multimedia database systems
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Vector approximation based indexing for non-uniform high dimensional data sets
Proceedings of the ninth international conference on Information and knowledge management
Fast and Effective Retrieval of Medical Tumor Shapes
IEEE Transactions on Knowledge and Data Engineering
A Multistep Approach for Shape Similarity Search in Image Databases
IEEE Transactions on Knowledge and Data Engineering
Approximate Nearest Neighbor Searching in Multimedia Databases
Proceedings of the 17th International Conference on Data Engineering
Nearest Neighbor Classification in 3D Protein Databases
Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology
Efficient Index Structures for String Databases
Proceedings of the 27th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Constrained Nearest Neighbor Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Learning similarity measures in non-orthogonal space
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Automated data discovery in similarity score queries
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
A similarity reinforcement algorithm for heterogeneous web pages
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Hi-index | 0.00 |
Similarity based queries are common in several modern database applications, such as multimedia, scientific, and biomedical databases. In most of these systems, database responds with the tuple with the closest match according to some metric. In this paper we investigate some important security issues related to similarity search in databases. We investigate the vulnerability of such systems against users who try to copy the database by sending automated queries. We analyze two models for similarity search, namely reply model and score model. Reply model responds with the tuple with best match and score model responds with only the score of similarity search. For these models we analyze possible ways of attacks and strategies that can be used to detect attacks. Our analysis shows that in score model it is much easier to plug the vulnerabilities than in reply model. Sophisticated attacks can easily be used in reply model and the database is limited in capability to prevent such attacks.