{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:24:59Z","timestamp":1759134299758},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,4,22]],"date-time":"2011-04-22T00:00:00Z","timestamp":1303430400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00778-011-0233-y","type":"journal-article","created":{"date-parts":[[2011,4,21]],"date-time":"2011-04-21T09:39:16Z","timestamp":1303378756000},"page":"25-50","source":"Crossref","is-referenced-by-count":7,"title":["Distributed similarity estimation using derived dimensions"],"prefix":"10.1007","volume":"21","author":[{"given":"Konstantinos","family":"Georgoulas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Kotidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,22]]},"reference":[{"key":"233_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: STOC (1996)","DOI":"10.1145\/237814.237823"},{"issue":"1","key":"233_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A. Andoni","year":"2008","unstructured":"Andoni A., Indyk P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"issue":"1","key":"233_CR3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/TPAMI.2007.1140","volume":"30","author":"V. Athitsos","year":"2008","unstructured":"Athitsos V., Alon J., Sclaroff S., Kollios G.: BoostMap: an embedding method for efficient nearest neighbor retrieval. IEEE Trans. Pattern Anal. Mach. Intell. 30(1), 89\u2013104 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"233_CR4","doi-asserted-by":"crossref","unstructured":"Athitsos, V., Potamias, M., Papapetrou, P., Kollios, G.: Nearest neighbor retrieval using distance-based hashing. In: ICDE, pp. 327\u2013336 (2008)","DOI":"10.1109\/ICDE.2008.4497441"},{"key":"233_CR5","doi-asserted-by":"crossref","unstructured":"Bawa, M., Condie, T., Ganesan, P.: Lsh Forest: self-tuning indexes for similarity search. In: WWW, pp. 651\u2013660 (2005)","DOI":"10.1145\/1060745.1060840"},{"key":"233_CR6","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.-P.: The pyramid-technique: towards breaking the curse of dimensionality. In: SIGMOD Conference, pp. 142\u2013153 (1998)","DOI":"10.1145\/276305.276318"},{"key":"233_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Similarity estimation techniques from rounding algorithms. In: STOC (2002)","DOI":"10.1145\/509907.509965"},{"issue":"3","key":"233_CR8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez E., Navarro G., Baeza-Yates R.A., Marroqu\u00edn J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"233_CR9","doi-asserted-by":"crossref","unstructured":"Chen, J., Kher, S., Somani, A.: Distributed fault detection of wireless sensor networks. In: DIWANS (2006)","DOI":"10.1145\/1160972.1160985"},{"key":"233_CR10","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: SCG (2004)","DOI":"10.1145\/997817.997857"},{"key":"233_CR11","doi-asserted-by":"crossref","unstructured":"Deligiannakis, A., Kotidis, Y., Roussopoulos, N.: Compressing historical information in sensor networks. In: ACM SIGMOD (2004)","DOI":"10.1145\/1007568.1007628"},{"key":"233_CR12","doi-asserted-by":"crossref","unstructured":"Deligiannakis, A., Kotidis, Y., Roussopoulos, N.: Hierarchical in-network data aggregation with quality guarantees. In: Proceedings of EDBT (2004)","DOI":"10.1007\/978-3-540-24741-8_38"},{"key":"233_CR13","doi-asserted-by":"crossref","unstructured":"Deligiannakis, A., Kotidis, Y., Vassalos, V., Stoumpos, V., Delis, A.: Another outlier bites the dust: computing meaningful aggregates in sensor networks. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.100"},{"issue":"2","key":"233_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.is.2008.06.002","volume":"34","author":"A. Dobra","year":"2009","unstructured":"Dobra A., Garofalakis M.N., Gehrke J., Rastogi R.: Multi-query optimization for sketch-based estimation. Inf. Syst. 34(2), 209\u2013230 (2009)","journal-title":"Inf. Syst."},{"key":"233_CR15","doi-asserted-by":"crossref","unstructured":"Dong, W., Wang, Z., Josephson, W., Charikar, M., Li, K.: Modeling LSH for performance tuning. In: CIKM, pp. 669\u2013678 (2008)","DOI":"10.1145\/1458082.1458172"},{"key":"233_CR16","doi-asserted-by":"crossref","unstructured":"Faloutsos, C. and Lin, K.-I.: FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: SIGMOD Conference, pp. 163\u2013174 (1995)","DOI":"10.1145\/568271.223812"},{"key":"233_CR17","doi-asserted-by":"crossref","unstructured":"Giatrakos, N., Kotidis, Y., Deligiannakis, A.: PAO: power-efficient attribution of outliers in wireless sensor networks. In: DMSN (2010)","DOI":"10.1145\/1858158.1858168"},{"key":"233_CR18","doi-asserted-by":"crossref","unstructured":"Giatrakos, N., Kotidis, Y., Deligiannakis, A., Vassalos, V., Theodoridis, Y.: TACO: tunable approximate computation of outliers in wireless sensor networks. In: SIGMOD (2010)","DOI":"10.1145\/1807167.1807199"},{"key":"233_CR19","unstructured":"Gilbert, A., Kotidis, Y., Muthukrishnan, S., Strauss, M.: QuickSAND: quick summary and analysis of network data. Technical report, DIMACS 2001-43, Dec (2001)"},{"key":"233_CR20","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Guha, S., Indyk, P., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Fast, small-space algorithms for approximate histogram maintenance. In: STOC, pp. 389\u2013398 (2002)","DOI":"10.1145\/509961.509966"},{"issue":"3","key":"233_CR21","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/TKDE.2003.1198389","volume":"15","author":"A.C. Gilbert","year":"2003","unstructured":"Gilbert A.C., Kotidis Y., Muthukrishnan S., Strauss M.: One-pass wavelet decompositions of data streams. IEEE Trans. Knowl. Data Eng. 15(3), 541\u2013554 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"233_CR22","doi-asserted-by":"crossref","unstructured":"Gionis, A., Gunopulos, D., Koudas, N.: Efficient and tunable similar set retrieval. In: SIGMOD (2001)","DOI":"10.1145\/375663.375689"},{"key":"233_CR23","doi-asserted-by":"crossref","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42(6) (1995)","DOI":"10.1145\/227683.227684"},{"issue":"1","key":"233_CR24","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/1132863.1132873","volume":"31","author":"S. Guha","year":"2006","unstructured":"Guha S., Koudas N., Shim K.: Approximation and streaming algorithms for histogram construction problems. ACM Trans. Database Syst. 31(1), 396\u2013438 (2006)","journal-title":"ACM Trans. Database Syst."},{"key":"233_CR25","doi-asserted-by":"crossref","unstructured":"Haghani, P., Michel, S., Aberer, K.: Distributed similarity search in high dimensions using locality sensitive hashing. In: EDBT, pp. 744\u2013755 (2009)","DOI":"10.1145\/1516360.1516446"},{"key":"233_CR26","doi-asserted-by":"crossref","unstructured":"Hua, Y., Xiao, B., Feng, D., Yu, B.: Bounded LSH for similarity search in peer-to-peer file systems. In: ICPP, pp. 644\u2013651 (2008)","DOI":"10.1109\/ICPP.2008.25"},{"key":"233_CR27","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC (1998)","DOI":"10.1145\/276698.276876"},{"key":"233_CR28","unstructured":"Jagadish, H.V., Ooi, B.C., and Vu, Q.H.: BATON: a balanced tree structure for peer-to-peer networks. In: VLDB, pp. 661\u2013672 (2005)"},{"key":"233_CR29","doi-asserted-by":"crossref","unstructured":"Jeffery, S., Alonso, G., Franklin, M.J., Hong, W., Widom, J.: Declarative support for sensor data cleaning. In: Pervasive (2006)","DOI":"10.1007\/11748625_6"},{"issue":"2","key":"233_CR30","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/69.991715","volume":"14","author":"C.T.A.J.M. Traina Jr.","year":"2002","unstructured":"Traina C.T.A.J.M. Jr., Faloutsos C., Seeger B.: Fast indexing and visualization of metric data sets using slim-trees. IEEE Trans. Knowl. Data Eng. 14(2), 244\u2013260 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"233_CR31","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.is.2004.09.003","volume":"31","author":"P. Kalnis","year":"2006","unstructured":"Kalnis P., Ng W.S., Ooi B.C., Tan K.-L.: Answering similarity queries in peer-to-peer networks. Inf. Syst. 31(1), 57\u201372 (2006)","journal-title":"Inf. Syst."},{"issue":"3","key":"233_CR32","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011669","volume":"3","author":"E.J. Keogh","year":"2001","unstructured":"Keogh E.J., Chakrabarti K., Pazzani M.J., Mehrotra S.: Dimensionality reduction for fast similarity search in large time series databases. Knowl. Inf. Syst. 3(3), 263\u2013286 (2001)","journal-title":"Knowl. Inf. Syst."},{"key":"233_CR33","doi-asserted-by":"crossref","unstructured":"Kim, J.W., Candan, K.S.: Skip-and-prune: cosine-based top-k query processing for efficient context-sensitive document retrieval. In SIGMOD Conference, pp. 115\u2013126 (2009)","DOI":"10.1145\/1559845.1559859"},{"key":"233_CR34","doi-asserted-by":"crossref","unstructured":"Kotidis, Y., Deligiannakis, A., Stoumpos, V., Vassalos, V., Delis, A.: Robust management of outliers in sensor network aggregate queries. In: MobiDE (2007)","DOI":"10.1145\/1254850.1254854"},{"key":"233_CR35","doi-asserted-by":"crossref","unstructured":"Koudas, N., Marathe, A., Srivastava, D.: Propagating updates in SPIDER. In: ICDE, pp. 1146\u20131153 (2007)","DOI":"10.1109\/ICDE.2007.368973"},{"key":"233_CR36","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe LSH: efficient indexing for high-dimensional similarity search. In: VLDB, pp. 950\u2013961 (2007)"},{"key":"233_CR37","doi-asserted-by":"crossref","unstructured":"Madden S., Franklin M.J., Hellerstein J.M., Hong W.: TAG: a tiny aggregation service for ad hoc sensor networks. In: OSDI Conference (2002)","DOI":"10.1145\/1060289.1060303"},{"key":"233_CR38","doi-asserted-by":"crossref","unstructured":"Ravichandran, D., Pantel, P., Hovy, E.: Randomized algorithms and NLP: using locality sensitive hash function for high speed noun clustering. In: ACL (2005)","DOI":"10.3115\/1219840.1219917"},{"issue":"1","key":"233_CR39","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s00778-008-0096-z","volume":"18","author":"D. Sacharidis","year":"2009","unstructured":"Sacharidis D., Deligiannakis A., Sellis T.K.: Hierarchically compressed wavelet synopses. VLDB J. 18(1), 203\u2013231 (2009)","journal-title":"VLDB J."},{"key":"233_CR40","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: SIGMOD Conference, pp. 563\u2013576 (2009)","DOI":"10.1145\/1559845.1559905"},{"key":"233_CR41","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. ACM Trans. Database Syst. 35(3), (2010)","DOI":"10.1145\/1806907.1806912"},{"key":"233_CR42","doi-asserted-by":"crossref","unstructured":"Vlachou, A., Doulkeridis, C., Kotidis, Y.: Peer-to-peer similarity search based on M-tree indexing. In: DASFAA (2), pp. 269\u2013275 (2010)","DOI":"10.1007\/978-3-642-12098-5_21"},{"key":"233_CR43","doi-asserted-by":"crossref","unstructured":"Vlachou, A., Doulkeridis, C., Kotidis, Y., Vazirgiannis, M.: SKYPEER: efficient subspace skyline computation over distributed data. In: Proceedings of ICDE (2007)","DOI":"10.1109\/ICDE.2007.367887"},{"key":"233_CR44","doi-asserted-by":"crossref","unstructured":"Xiao, X., Peng, W., Hung, C., Lee, W.: Using sensorranks for in-network detection of faulty readings in wireless sensor networks. In: MobiDE (2007)","DOI":"10.1145\/1254850.1254852"},{"key":"233_CR45","doi-asserted-by":"crossref","unstructured":"Xue, G., Jiang, Y., You, Y., Li, M.: A topology-aware hierarchical structured overlay network based on locality sensitive hashing scheme. In: UPGRADE (2007)","DOI":"10.1145\/1272980.1272985"},{"key":"233_CR46","unstructured":"Yu, C., Ooi, B.C., Tan, K.-L., Jagadish, H.V.: Indexing the Distance: An Efficient Method to KNN Processing. In: VLDB, pp. 421\u2013430 (2001)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0233-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-011-0233-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0233-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T05:47:32Z","timestamp":1560145652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-011-0233-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,22]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["233"],"URL":"https:\/\/doi.org\/10.1007\/s00778-011-0233-y","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,22]]}}}