{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:12:34Z","timestamp":1725505954681},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785675"},{"type":"electronic","value":"9783540785682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78568-2_33","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T17:55:41Z","timestamp":1207072541000},"page":"440-451","source":"Crossref","is-referenced-by-count":0,"title":["Automated Data Discovery in Similarity Score Queries"],"prefix":"10.1007","author":[{"given":"Fatih","family":"Altiparmak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Saman","family":"Tosun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hakan","family":"Ferhatosmanoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmet","family":"Sacan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Ankerst, G., Kastenm\u00fcller, M., Kriegel, H., Seidl, T.: Nearest neighbor classification in 3d protein databases. In: Proc. 7th Int. Conf. on Intelligent Systems for Molecular Biology (ISMB 1999) (1999)"},{"key":"33_CR2","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching. In: 5th Ann. ACM-SIAM Symposium on Discrete Algorithms, pp. 573\u2013582 (1994)"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Bohm, C., Keim, D., Kriegel, H.: A cost model for nearest neighbor search in high-dimensional data space. In: Proc. ACM Symp. on Principles of Database Systems, Tuscon, Arizona, June 1997, pp. 78\u201386 (1997)","DOI":"10.1145\/263661.263671"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is nearest neighbor meaningful. In: Int. Conf. on Database Theory, Jerusalem, Israel, January 1999, pp. 217\u2013225 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"key":"33_CR5","unstructured":"BrightPlanet.com. The deep web: Surfacing hidden value (2000) Accessible at, http:\/\/brightplanet.com"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, X., Dolin, R., Neary, M., Prabhakar, S., Kanth, K.V.R., Wu, D., Agrawal, D., Abbadi, A.E., Freeston, M., Singh, A.K., Smith, T.R., Su, J.: Scalable access within the context of digital libraries. In: Advances in Digital Libraries, pp. 70\u201381 (1997)","DOI":"10.1109\/ADL.1997.601202"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M.: PAC nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In: Proc. Int. Conf. Data Engineering, San Diego, California, March 2000, pp. 244\u2013255 (2000)","DOI":"10.1109\/ICDE.2000.839417"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Du, W., Atallah, M.: 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 (2000)","DOI":"10.1007\/978-1-4615-1467-1_6"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Spatial and Temporal Databases","author":"H. Ferhatosmanoglu","year":"2001","unstructured":"Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., Abbadi, A.E.: Constrained nearest neighbor queries. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol.\u00a02121, Springer, Heidelberg (2001)"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., El Abbadi, A.: Vector approximation based indexing for non-uniform high dimensional data sets. In: Proceedings of the 9th ACM Int. Conf. on Information and Knowledge Management, McLean, Virginia, November 2000, pp. 202\u2013209 (2000)","DOI":"10.1145\/354756.354820"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., El Abbadi, A.: Approximate nearest neighbor searching in multimedia databases. In: Proc of 17th IEEE Int. Conf. on Data Engineering (ICDE), Heidelberg, Germany, April 2001, pp. 503\u2013511 (2001)","DOI":"10.1109\/ICDE.2001.914864"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: 30th ACM Symposium on Theory of Computing, Dallas, Texas, May 1998, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Ipeirotis, P.G., Gravano, L., Sahami, M.: Probe, count, and classify: Categorizing hidden web databases. In: SIGMOD Conference (2001)","DOI":"10.1145\/375663.375671"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Jacob, K.J., Shasha, D.: Fintime \u2013 a financial time series benchmark (March 2000), http:\/\/cs.nyu.edu\/cs\/faculty\/shasha\/fintime.html","DOI":"10.1145\/344816.344857"},{"key":"33_CR15","unstructured":"Kahveci, T., Singh, A.K.: Efficient index structures for string databases. The VLDB Journal, 351\u2013360 (2001)"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E., Protopapas, Z.: Fast and efficient retrieval of medical tumor shapes. IEEE Transactions on Data Engineering (TKDE 1998) (1998)","DOI":"10.1109\/69.738356"},{"key":"33_CR17","unstructured":"Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E., Protopapas, Z.: Fast nearest neighbor search in medical image databases. The VLDB Journal, 215\u2013226 (1996)"},{"key":"33_CR18","unstructured":"Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E., Protopapas, Z.: Fast nearest neighbor search in medical image databases. In: Proceedings of the Int. Conf. on Very Large Data Bases, Mumbai, India, pp. 215\u2013226 (1996)"},{"issue":"6","key":"33_CR19","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1109\/69.738356","volume":"10","author":"F. Korn","year":"1998","unstructured":"Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E., Protopapas, Z.: Fast and effective retrieval of medical tumor shapes. IEEE Trans. Knowl. Data Eng.\u00a010(6), 889\u2013904 (1998)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"33_CR20","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1145\/505282.505284","volume":"34","author":"W. Meng","year":"2002","unstructured":"Meng, W., Yu, C.T., Liu, K.-L.: Building efficient and effective metasearch engines. ACM Computing Surveys\u00a034(1), 48\u201389 (2002)","journal-title":"ACM Computing Surveys"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelly, S., Vincent, F.: Nearest neighbor queries. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, San Jose, California, May 1995, pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"key":"33_CR22","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1145\/584792.584813","volume-title":"CIKM","author":"A.S. Tosun","year":"2002","unstructured":"Tosun, A.S., Ferhatosmanoglu, H.: Vulnerabilities in similarity search based systems. In: CIKM, pp. 110\u2013117. ACM, New York (2002)"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Weber, R., Bohm, K.: Trading quality for time with nearest-neighbor search. In: Proc. Int. Conf. on Extending Database Technology, Konstanz, Germany, March 2000, pp. 21\u201335 (2000)","DOI":"10.1007\/3-540-46439-5_2"},{"issue":"1-3","key":"33_CR24","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/0010-4655(89)90282-8","volume":"57","author":"M.R. Whalley","year":"1990","unstructured":"Whalley, M.R.: The Durham-RAL high energy physics database - HEPDATA. Computer Physics Communications\u00a057(1-3), 536\u2013537 (1990)","journal-title":"Computer Physics Communications"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78568-2_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:13:22Z","timestamp":1619522002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78568-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785675","9783540785682"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78568-2_33","relation":{},"subject":[]}}