The Community for Technology Leaders
RSS Icon
Issue No.05 - May (2011 vol.23)
pp: 641-654
Lixing Wang , Hong Kong University of Science and Technology, Hong Kong
Yin Yang , Hong Kong University of Science and Technology, Hong Kong
Dimitris Papadias , Hong Kong University of Science and Technology, Hong Kong
Panagiotis Karras , National University of Singapore, Singapore
Multistep processing is commonly used for nearest neighbor (NN) and similarity search in applications involving high-dimensional data and/or costly distance computations. Today, many such applications require a proof of result correctness. In this setting, clients issue NN queries to a server that maintains a database signed by a trusted authority. The server returns the NN set along with supplementary information that permits result verification using the data set signature. An adaptation of the multistep NN algorithm incurs prohibitive network overhead due to the transmission of false hits, i.e., records that are not in the NN set, but are nevertheless necessary for its verification. In order to alleviate this problem, we present a novel technique that reduces the size of each false hit. Moreover, we generalize our solution for a distributed setting, where the database is horizontally partitioned over several servers. Finally, we demonstrate the effectiveness of the proposed solutions with real data sets of various dimensionalities.
Query authentication, multistep nearest neighbors, similarity search.
Lixing Wang, Yin Yang, Dimitris Papadias, Panagiotis Karras, "Authenticated Multistep Nearest Neighbor Search", IEEE Transactions on Knowledge & Data Engineering, vol.23, no. 5, pp. 641-654, May 2011, doi:10.1109/TKDE.2010.157
[1] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The ${\rm R}^{\ast}$ -Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD, 1990.
[2] K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When is "Nearest Neighbor" Meaningful?," Proc. Int'l Conf. Database Theory (ICDT '99), 1999.
[3] R. Bryan, "The Digital Revolution: The Millennial Change in Medical Imaging," Radiology, vol. 229, pp. 299-304, Nov. 2003.
[4] Y. Cai and R. Ng, "Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials," Proc. ACM SIGMOD, 2004.
[5] H. Ding, G. Trajcevski, P. Scheuermann, X. Wang, and E. Keogh, "Querying and Mining of Time Series Data: Experimental Comparison of Representations and Distance Measures," Proc. Int'l Conf. Very Large Data Base Endowment (VLDB '08), vol. 1, pp. 1542-1552, 2008.
[6] C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, "Fast Subsequence Matching in Time-Series Databases," Proc. ACM SIGMOD, 1994.
[7] G. Hjaltason and H. Samet, "Distance Browsing in Spatial Databases," Trans. Database Systems (TODS '99), vol. 24, no. 2, pp. 265-318, 1999.
[8] H. Jagadish, B. Ooi, K. Tan, C. Yu, and R. Zhang, "I-Distance: An Adaptive B+-Tree Based Indexing Method Nearest Neighbor Search," Trans. Database Systems (TODS '05), vol. 30, no. 2, pp. 364-397, 2005.
[9] H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. Springer, 2004.
[10] E.J. Keogh, C.A. Ratanamahatana, "Exact Indexing of Dynamic Time Warping," Knowledge and Information Systems, vol. 7, no. 3, pp. 358-386, 2005.
[11] F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas, "Fast Nearest Neighbor Search in Medical Image Databases," Proc. Int'l Conf. Very Large Data Base Endowment (VLDB '96), 1996.
[12] A. Kundu and E. Bertino, "Structural Signatures for Tree Data Structures," Proc. Int'l Conf. Very Large Data Base Endowment (VLDB '08), 2008.
[13] F. Li, M. Hadjieleftheriou, G. Kollios, and L. Reyzin, "Dynamic Authenticated Index Structures for Outsourced Databases," Proc. ACM SIGMOD, 2006.
[14] C. Martel, G. Nuckolls, P. Devanbu, M. Gertz, A. Kwong, and S. Stubblebine, "A General Model for Authenticated Data Structures," Algorithmica, vol. 39, no. 1, pp. 21-41, 2004.
[15] R. Merkle, "A Certified Digital Signature," Proc. CRYPTO, 1989.
[16] A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. CRC Press, 1996.
[17] H. Pang and K. Mouratidis, "Authenticating the Query Results of Text Search Engines," Proc. Int'l Conf. Very Large Data Base Endowment (VLDB '08), 2008.
[18] D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query Processing in Spatial Network Databases," Proc. Int'l Conf. Very Large Data Base Endowment (VLDB '03), 2003.
[19] T. Seidl and H.-P. Kriegel, "Optimal Multi-Step $k$ -Nearest Neighbor Search," Proc. ACM SIGMOD, 1998.
[20] R.T. Snodgrass, S.S. Yao, and C. Collberg, "Tamper Detection in Audit Logs," Proc. Int'l Conf. Very Large Data Base Endowment (VLDB '04), 2004.
[21] R. Tamassia and N. Triandopoulos, "Efficient Content Authentication over Distributed Hash Tables," Proc. Int'l Conf. Applied Cryptography and Network Security (ACNS '07), 2007.
[22] Y. Tao, K. Yi, C. Sheng, and P. Kalnis, "Quality and Efficiency in High Dimensional Nearest Neighbor Search," Proc. ACM SIGMOD, 2009.
[23] Y. Yang, S. Papadopoulos, D. Papadias, and G. Kollios, "Spatial Outsourcing for Location-Based Services," Proc. Int'l Conf. Data Eng. (ICDE '08), 2008.
[24] K. Yi, F. Li, M. Hadjieleftheriou, G. Kollios, and D. Srivastava, "Randomized Synopses for Query Assurance on Data Streams," Proc. Int'l Conf. Data Eng. (ICDE '08), 2008.
39 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool