{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:58:45Z","timestamp":1648918725797},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,5,20]],"date-time":"2011-05-20T00:00:00Z","timestamp":1305849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10115-011-0413-5","type":"journal-article","created":{"date-parts":[[2011,5,19]],"date-time":"2011-05-19T02:15:55Z","timestamp":1305771355000},"page":"547-579","source":"Crossref","is-referenced-by-count":1,"title":["On processing continuous frequent K-N-match queries for dynamic data over networked data sources"],"prefix":"10.1007","volume":"31","author":[{"given":"Shih-Chuan","family":"Chiu","sequence":"first","affiliation":[]},{"given":"Jiun-Long","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Jen-He","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,20]]},"reference":[{"key":"413_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Yu PS (August 2000) The IGrid index: reversing the dimensionality curse for similarity indexing in high dimensional space. In: Proceedings of the ACM international conference on knowledge discovery and data mining, pp 119\u2013129","DOI":"10.1145\/347090.347116"},{"key":"413_CR2","unstructured":"Agrawal R, Lin K-I, Sawhney HS, Shim K (1995) Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In: Proceedings of the international conference on very large data bases, pp 490\u2013501"},{"key":"413_CR3","doi-asserted-by":"crossref","unstructured":"Babcock B, Olston C (June 2003) Distributed Top-K monitoring. In: Proceedings of the ACM international conference on management of data","DOI":"10.1145\/872757.872764"},{"key":"413_CR4","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM international conference on management of data, pp 322\u2013331","DOI":"10.1145\/93597.98741"},{"key":"413_CR5","unstructured":"Berchtold S, Keim DA, Kriegel H-P (1996) The X-Tree: an index structure for high-dimensional data. In: Proceedings of the international conference on very large data bases, pp 28\u201339"},{"key":"413_CR6","doi-asserted-by":"crossref","unstructured":"Bernecker T, Emrich T, Graf F, Kriegel H-P, Kr\u00f3ger P, Renz M, Schubert E, Zimek A (2010) Subspace similarity search: efficient k-NN queries in arbitrary subspaces. In: Proceedings of the international conference on scientific and statistical database management","DOI":"10.1007\/978-3-642-13818-8_38"},{"key":"413_CR7","doi-asserted-by":"crossref","unstructured":"Deng B, Jia Y, Yang S (June 2006) Supporting efficient distributed Top-k monitoring. In: Proceedings of the 7th international conference on Web-Age information management","DOI":"10.1007\/11775300_42"},{"key":"413_CR8","doi-asserted-by":"crossref","unstructured":"Gao L, Yao Z, Wang X (2002) Evaluating continuous nearest neighbor queries for streaming time series via pre-fetching. In: Proceedings of the ACM international conference on information and knowledge management, pp 485\u2013492","DOI":"10.1145\/584792.584872"},{"key":"413_CR9","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM international conference on management of data, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"issue":"6","key":"413_CR10","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1007\/s10115-003-0118-5","volume":"6","author":"KM Hammouda","year":"2004","unstructured":"Hammouda KM, Kamel MS (2004) Document similarity using a phrase indexing graph model. Knowl Inf Syst 6(6): 710\u2013727","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"413_CR11","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1998","unstructured":"Hjaltason GR, Samet H (1998) Distance browsing in spatial databases. ACM Trans Database Syst 24(2): 265\u2013318","journal-title":"ACM Trans Database Syst"},{"key":"413_CR12","doi-asserted-by":"crossref","unstructured":"Hu H, Xu J, Lee DL (2005) A generic framework for monitoring continuous spatial queries over moving objects. In: Proceedings of the ACM international conference on management of data, pp 479\u2013490","DOI":"10.1145\/1066157.1066212"},{"issue":"2","key":"413_CR13","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish HV, Ooi BC, Tan K-L, Yu C, Zhang R (2005) iDistance: an adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans Database Syst 30(2): 364\u2013397","journal-title":"ACM Trans Database Syst"},{"key":"413_CR14","doi-asserted-by":"crossref","unstructured":"Katayama N, Satoh S (1997) The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings of the ACM international conference on management of data, pp 369\u2013380","DOI":"10.1145\/253260.253347"},{"issue":"2","key":"413_CR15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10115-009-0237-8","volume":"24","author":"A Kelil","year":"2010","unstructured":"Kelil A, Wang S, Jiang Q, Brzezinski R (2010) A general measure of similarity for categorical sequences. Knowl Inf Syst 24(2): 197\u2013220","journal-title":"Knowl Inf Syst"},{"key":"413_CR16","unstructured":"Korn F, Sidiropoulos N, Faloutsos C, Siegel E, Protopapas Z (1996) Fast nearest neighbor serach in medical image databases. In: Proceedings of the international conference on very large data bases, pp 215\u2013226"},{"key":"413_CR17","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: Proceegings of the 30th internatvonal confeyence on very large data bases","DOI":"10.1016\/B978-012088469-8\/50071-1"},{"key":"413_CR18","unstructured":"Kriegel H-P, Kroger P, Schubert M, Zhu Z (July 2006) Efficient query processing in arbitrary subspaces using vector approximations. In: Proceedings of the international conference on scientific and statistical database management"},{"key":"413_CR19","doi-asserted-by":"crossref","unstructured":"Lian X, Chen L (April 2008) Similarity search in arbitrary subspaces under Lp-Norm. In: Proceedings of the IEEE international conference on data engineering","DOI":"10.1109\/ICDE.2008.4497440"},{"key":"413_CR20","doi-asserted-by":"crossref","unstructured":"Lin K-I, Jagadish HV, Faloutsos C (1994) The TV-tree: an index structure for high-dimensional data. VLDB J 3(4)","DOI":"10.1007\/BF01231606"},{"key":"413_CR21","doi-asserted-by":"crossref","unstructured":"Mouratidis K, Bakiras S, Papadias D (June 2006) Continuous monitoring of Top-k queries over sliding windows. In: Proceedings of 25th ACM international conference on management of data","DOI":"10.1145\/1142473.1142544"},{"key":"413_CR22","doi-asserted-by":"crossref","unstructured":"Nutanong S, Zhang R, Tanin E, Kulik L (2008) The V*Diagram: a querydependent approach to moving KNN queries. In: Proceedings of the 34th internatvonal conference on very large data bases","DOI":"10.14778\/1453856.1453973"},{"key":"413_CR23","doi-asserted-by":"crossref","unstructured":"Prabhakar S, Xia Y, Kalashnikov D, Aref WG, Hambrusch S (2002) Query indexing and velocity constrained indexing: scalable techniques for continuous queries on moving objects. IEEE Trans Comput 55","DOI":"10.1109\/TC.2002.1039840"},{"issue":"3","key":"413_CR24","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10115-009-0250-y","volume":"25","author":"X Quan","year":"2010","unstructured":"Quan X, Liu G, Lu Z, Ni X, Wenyin L (2010) Short text similarity based on probabilistic topics. Knowl Inf Syst 25(3): 473\u2013491","journal-title":"Knowl Inf Syst"},{"key":"413_CR25","doi-asserted-by":"crossref","unstructured":"Seidl T, Kriegel H-P (1998) Optimal multi-step K-nearest neighbor search. In: Proceedings of the ACM international conference on management of data, pp 154\u2013165","DOI":"10.1145\/276304.276319"},{"key":"413_CR26","unstructured":"Sellis T, Roussopoulos N, Faloutsos C (1987) The R+-tree: a dynamic index for multi-dimensional objects. In: Proceedings of the international conference on very large data bases, pp 507\u2013518"},{"key":"413_CR27","doi-asserted-by":"crossref","unstructured":"Shah S, Dharmarajan S, Ramamritham K (2003) An efficient and resilient approach to filtering and disseminating streaming data. In: Proceedings of the international conference on very large data bases","DOI":"10.1016\/B978-012722442-8\/50014-8"},{"key":"413_CR28","doi-asserted-by":"crossref","unstructured":"Silberstein A, Munagala K, Yang J (2006) Energy efficient monitoring of extreme values in sensor networks. In: Proceedings of the 26th ACM international conference on management of data, pp 169\u2013180","DOI":"10.1145\/1142473.1142493"},{"key":"413_CR29","doi-asserted-by":"crossref","unstructured":"Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: Proceedings of the international symposium on advances in spatial and temporal databases, pp 79\u201396","DOI":"10.1007\/3-540-47724-1_5"},{"key":"413_CR30","unstructured":"Tung AKH, Zhang R, Koudas N, Ooi BC (2006) Similarity search: a matching based approach. In: Proceedings of the international conference on very large data bases, pp 631\u2013642"},{"issue":"3","key":"413_CR31","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/TPDS.2008.95","volume":"20","author":"C Wang","year":"2009","unstructured":"Wang C, Zhou BB, Zomaya AY (2009) A decentralized method for scaling up genome similarity search services. IEEE Trans Parallel Distribut Syst 20(3): 303\u2013315","journal-title":"IEEE Trans Parallel Distribut Syst"},{"key":"413_CR32","unstructured":"Weber R, Schek H-J, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of the international conference on very large data bases, pp 194\u2013205"},{"key":"413_CR33","unstructured":"White DA, Jain R (1996) Similarity indexing with the SS-tree. In: Proceedings of the IEEE international conference on data engineering, pp 516\u2013523"},{"issue":"7","key":"413_CR34","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/TKDE.2007.1038","volume":"19","author":"J Xu","year":"2007","unstructured":"Xu J, Tang X, Lee W-C, Wu M (2007) Top-k monitoring in wireless sensor networks. IEEE Trans Knowl Data Eng 19(7): 962\u2013976","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"413_CR35","doi-asserted-by":"crossref","unstructured":"Yeo MH, Seong DO, Yoo JS (October 2008) PRIM: priority-based Top-k monitoring in wireless sensor networks. In: Proceedings of international symposium on computer science and its applications, pp 326\u2013331","DOI":"10.1109\/CSA.2008.20"},{"issue":"1","key":"413_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-008-0190-y","volume":"22","author":"M Zhang","year":"2010","unstructured":"Zhang M, Alhajj R (2010) Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space. Knowl Inf Syst 22(1): 1\u201326","journal-title":"Knowl Inf Syst"},{"key":"413_CR37","doi-asserted-by":"crossref","unstructured":"Zhou Y, Ooi BC, Tan K-L (2008) Disseminating streaming data in a dynamic environment: an adaptive and cost-based approach. VLDB J 17","DOI":"10.1007\/s00778-007-0077-7"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-011-0413-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-011-0413-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-011-0413-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T18:26:54Z","timestamp":1560191214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-011-0413-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,20]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["413"],"URL":"https:\/\/doi.org\/10.1007\/s10115-011-0413-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,20]]}}}