{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T04:20:43Z","timestamp":1743308443784},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,10,15]],"date-time":"2015-10-15T00:00:00Z","timestamp":1444867200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10115-015-0892-x","type":"journal-article","created":{"date-parts":[[2015,10,15]],"date-time":"2015-10-15T15:24:45Z","timestamp":1444922685000},"page":"649-678","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Continuous similarity search for evolving queries"],"prefix":"10.1007","volume":"48","author":[{"given":"Xiaoning","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuancong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdullah","family":"Al-Barakati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,15]]},"reference":[{"key":"892_CR1","doi-asserted-by":"crossref","unstructured":"Andoni A, Indyk P (2006) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Proceedings of the 47th annual IEEE symposium on foundations of computer science, FOCS \u201906, Washington, DC, USA. IEEE Computer Society, pp 459\u2013468","DOI":"10.1109\/FOCS.2006.49"},{"key":"892_CR2","volume-title":"Geometric algebra","author":"E Artin","year":"2011","unstructured":"Artin E (2011) Geometric algebra. Wiley, Hoboken"},{"key":"892_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo RJ, Ma Y, Srikant R (2007) Scaling up all pairs similarity search. In: Proceedings of the 16th international conference on World Wide Web, WWW \u201907, New York, NY, USA. ACM, pp 131\u2013140","DOI":"10.1145\/1242572.1242591"},{"key":"892_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C, Ooi BC, Plant C, Yan Y (2007) Efficiently processing continuous k-nn queries on data streams. In: Proceedings of the international conference on data engineering, ICDE \u201907, Washington, DC, USA. IEEE Computer Society, pp 156\u2013165","DOI":"10.1109\/ICDE.2007.367861"},{"key":"892_CR5","unstructured":"Broder A (1997) On the resemblance and containment of documents. In: Proceedings of the compression and complexity of sequences 1997, SEQUENCES \u201997, Washington, DC, USA. IEEE Computer Society, pp 21\u201329"},{"issue":"3","key":"892_CR6","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"AZ Broder","year":"2000","unstructured":"Broder AZ, Charikar M, Frieze AM, Mitzenmacher M (2000) Min-wise independent permutations. J Comput Syst Sci 60(3):630\u2013659","journal-title":"J Comput Syst Sci"},{"key":"892_CR7","doi-asserted-by":"crossref","unstructured":"Charikar MS (2002) Similarity estimation techniques from rounding algorithms. In: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, STOC \u201902, New York, NY, USA. ACM, pp 380\u2013388","DOI":"10.1145\/509907.509965"},{"key":"892_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhuri S, Ganti V, Kaushik R (2006) A primitive operator for similarity joins in data cleaning. In: Proceedings of the 22nd international conference on data engineering, ICDE \u201906, Washington, DC, USA. IEEE Computer Society, pp 5\u201315","DOI":"10.1109\/ICDE.2006.9"},{"key":"892_CR9","doi-asserted-by":"crossref","unstructured":"Cohen WW (1998) Integration of heterogeneous databases without common domains using queries based on textual similarity. In: Proceedings of the 1998 ACM SIGMOD international conference on management of data, SIGMOD \u201998, New York, NY, USA. ACM, pp 201\u2013212","DOI":"10.1145\/276304.276323"},{"issue":"1","key":"892_CR10","first-page":"57","volume":"10","author":"S Cost","year":"1993","unstructured":"Cost S, Salzberg S (1993) A weighted nearest neighbor algorithm for learning with symbolic features. Mach Learn 10(1):57\u201378","journal-title":"Mach Learn"},{"key":"892_CR11","doi-asserted-by":"crossref","unstructured":"Datar M, Muthukrishnan S (2002) Estimating rarity and similarity over data stream windows. In: Proceedings of the 10th annual European symposium on algorithms, ESA \u201902. Springer, London, pp 323\u2013334","DOI":"10.1007\/3-540-45749-6_31"},{"key":"892_CR12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0169-7161(82)02011-2","volume":"2","author":"L Devroye","year":"1982","unstructured":"Devroye L, Wagner TJ (1982) 8 nearest neighbor methods in discrimination. Handbook of statistics 2:193\u2013197","journal-title":"Handbook of statistics"},{"issue":"3\u20134","key":"892_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF00962238","volume":"3","author":"C Faloutsos","year":"1994","unstructured":"Faloutsos C, Barber R, Flickner M, Hafner J, Niblack W, Petkovic D, Equitz W (1994) Efficient and effective querying by image content. J Intell Inf Syst 3(3\u20134):231\u2013262","journal-title":"J Intell Inf Syst"},{"key":"892_CR14","unstructured":"Faloutsos C, Oard DW (1995) A survey of information retrieval and filtering methods. University of Maryland at College Park, College Park, MD, USA. Univ. of Maryland Institute for Advanced Computer Studies Report"},{"issue":"9","key":"892_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/2.410146","volume":"28","author":"M Flickner","year":"1995","unstructured":"Flickner M, Sawhney H, Niblack W, Ashley J, Huang Q, Dom B, Gorkani M, Hafner J, Lee D, Petkovic D, Steele D, Yanker P (1995) Query by image and video content: the qbic system. Computer 28(9):23\u201332","journal-title":"Computer"},{"key":"892_CR16","volume-title":"Vector quantization and signal compression","author":"A Gersho","year":"1991","unstructured":"Gersho A, Gray RM (1991) Vector quantization and signal compression. Kluwer Academic Publishers, Norwell"},{"key":"892_CR17","unstructured":"Gionis A, Indyk P, Motwani R (1999) Similarity search in high dimensions via hashing. In: Proceedings of the 25th international conference on very large data bases, VLDB \u201999, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc., pp 518\u2013529"},{"key":"892_CR18","unstructured":"Hastie T, Tibshirani R (1995) Discriminant adaptive nearest neighbor classification. In: Proceedings of the first international conference on knowledge discovery and data mining, KDD \u201995, Palo Alto, CA, USA. AAAI Press, pp 142\u2013149"},{"key":"892_CR19","doi-asserted-by":"crossref","unstructured":"Henzinger M (2006) Finding near-duplicate web pages: a large-scale evaluation of algorithms. In: Proceedings of the 29th annual international ACM SIGIR conference on research and development in information retrieval, SIGIR \u201906, New York, NY, USA. ACM, pp 284\u2013291","DOI":"10.1145\/1148170.1148222"},{"issue":"1","key":"892_CR20","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1006\/jagm.2000.1131","volume":"38","author":"P Indyk","year":"2001","unstructured":"Indyk P (2001) A small approximately min-wise independent family of hash functions. J Algorithms 38(1):84\u201390","journal-title":"J Algorithms"},{"key":"892_CR21","doi-asserted-by":"crossref","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on theory of computing, STOC \u201998, New York, NY, USA. ACM, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"key":"892_CR22","unstructured":"Koivune V, Kassam S (1995) Nearest neighbor filters for multivariate data. In: IEEE workshop on nonlinear signal and image processing, Washington, DC, USA. IEEE Computer Society, pp 734\u2013737"},{"issue":"4","key":"892_CR23","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TKDE.2002.1019221","volume":"14","author":"G Kollios","year":"2002","unstructured":"Kollios G, Tsotras VJ (2002) Hashing methods for temporal data. IEEE Trans Knowl Data Eng 14(4):902\u2013919","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"892_CR24","doi-asserted-by":"crossref","unstructured":"Kontaki M, Papadopoulos AN (2004) Efficient similarity search in streaming time sequences. In: Proceedings of the 16th international conference on scientific and statistical database management, SSDBM \u201904, Washington, DC, USA. IEEE Computer Society, pp 63\u201372","DOI":"10.1109\/SSDM.2004.1311194"},{"key":"892_CR25","doi-asserted-by":"crossref","unstructured":"Koudas N, Ooi BC, Tan K-L, Zhang R (2004) Approximate nn queries on streams with guaranteed error\/performance bounds. In: Proceedings of the thirtieth international conference on very large data bases, VLDB \u201904. VLDB Endowment, pp 804\u2013815","DOI":"10.1016\/B978-012088469-8.50071-1"},{"key":"892_CR26","doi-asserted-by":"crossref","unstructured":"Lian X, Chen L, Wang B (2007) Approximate similarity search over multiple stream time series. In: Proceedings of the 12th international conference on database systems for advanced applications, DASFAA\u201907. Springer, Berlin, pp 962\u2013968","DOI":"10.1007\/978-3-540-71703-4_86"},{"key":"892_CR27","doi-asserted-by":"crossref","unstructured":"Mouratidis K, Bakiras S, Papadias D (2006) Continuous monitoring of top-k queries over sliding windows. In: Proceedings of the 2006 ACM SIGMOD international conference on management of data, SIGMOD \u201906, New York, NY, USA. ACM, pp 635\u2013646","DOI":"10.1145\/1142473.1142544"},{"issue":"6","key":"892_CR28","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1109\/TKDE.2007.190617","volume":"19","author":"K Mouratidis","year":"2007","unstructured":"Mouratidis K, Papadias D (2007) Continuous nearest neighbor queries over sliding windows. IEEE Trans Knowl Data Eng 19(6):789\u2013803","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"11","key":"892_CR29","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1109\/TKDE.2005.172","volume":"17","author":"K Mouratidis","year":"2005","unstructured":"Mouratidis K, Papadias D, Bakiras S, Tao Y (2005) A threshold-based algorithm for continuous monitoring of k nearest neighbors. IEEE Trans Knowl Data Eng 17(11):1451\u20131464","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"892_CR30","doi-asserted-by":"crossref","unstructured":"Pan S, Zhu X (2012) Continuous top-k query for graph streams. In Proceedings of the 21st ACM international conference on information and knowledge management. CIKM \u201912, New York, NY, USA. ACM, pp 2659\u20132662","DOI":"10.1145\/2396761.2398717"},{"key":"892_CR31","doi-asserted-by":"crossref","unstructured":"Pentland A, Picard RW, Sclaroff S (1994) Photobook: content-based manipulation of image databases. In: Storage and retrieval for image and video databases, Bellingham, WA, USA. SPIE, pp 34\u201347","DOI":"10.1117\/12.171786"},{"issue":"1","key":"892_CR32","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s11280-012-0191-3","volume":"17","author":"W Rao","year":"2014","unstructured":"Rao W, Chen L, Chen S, Tarkoma S (2014) Evaluating continuous top-k queries over document streams. World Wide Web 17(1):59\u201383","journal-title":"World Wide Web"},{"key":"892_CR33","volume-title":"Introduction to modern information retrieval","author":"G Salton","year":"1986","unstructured":"Salton G, McGill MJ (1986) Introduction to modern information retrieval. McGraw-Hill Inc., New York"},{"key":"892_CR34","doi-asserted-by":"crossref","unstructured":"Sarawagi S, Kirpal A (2004) Efficient set joins on similarity predicates. In: Proceedings of the 2004 ACM SIGMOD international conference on management of data, SIGMOD \u201904, New York, NY, USA. ACM, pp 743\u2013754","DOI":"10.1145\/1007568.1007652"},{"key":"892_CR35","volume-title":"Image databases and multimedia search","year":"1998","unstructured":"Smeulders A, Jain R (eds) (1998) Image databases and multimedia search. World Scientific Publishing Co., Inc., River Edge"},{"issue":"11","key":"892_CR36","doi-asserted-by":"crossref","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun Y, Han J, Yan X, Yu PS, Wu T (2011) Pathsim: meta path-based top-k similarity search in heterogeneous information networks. Proc VLDB Endow 4(11):992\u20131003","journal-title":"Proc VLDB Endow"},{"key":"892_CR37","volume-title":"The state of record linkage and current research problems","author":"WE Winkler","year":"1999","unstructured":"Winkler WE (1999) The state of record linkage and current research problems. Statistical Research Division, US Census Bureau, Suitland"},{"key":"892_CR38","doi-asserted-by":"crossref","unstructured":"Xiao C, Wang W, Lin X, Yu JX (2008) Efficient similarity joins for near duplicate detection. In: Proceedings of the 17th international conference on World Wide Web, WWW \u201908, New York, NY, USA. ACM, pp 131\u2013140","DOI":"10.1145\/1367497.1367516"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0892-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0892-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0892-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T20:47:42Z","timestamp":1599684462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0892-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,15]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["892"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0892-x","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,15]]}}}