{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T05:58:03Z","timestamp":1725343083732},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"10-11","license":[{"start":{"date-parts":[[2012,10,18]],"date-time":"2012-10-18T00:00:00Z","timestamp":1350518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s00607-012-0219-7","type":"journal-article","created":{"date-parts":[[2012,10,17]],"date-time":"2012-10-17T12:45:31Z","timestamp":1350477931000},"page":"949-976","source":"Crossref","is-referenced-by-count":21,"title":["Approximate algorithms for static and continuous range queries in mobile navigation"],"prefix":"10.1007","volume":"95","author":[{"given":"Haidar","family":"AL-Khalidi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Taniar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maytham","family":"Safar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,18]]},"reference":[{"key":"219_CR1","unstructured":"AL-Khalidi H, Abbas Z, Safar M (2012) Approximate range query processing in spatial network databases. Multimed Syst :1\u201311"},{"issue":"3","key":"219_CR2","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/s00454-009-9140-z","volume":"41","author":"S Arya","year":"2009","unstructured":"Arya S, Malamatos T, Mount D (2009) The effect of corners on the complexity of approximate range searching. Discrete Comput Geom 41(3):398\u2013443","journal-title":"Discrete Comput Geom"},{"key":"219_CR3","unstructured":"Arya S, Mount DM (1993) Approximate nearest neighbor queries in fixed dimensions. In: SODA \u201993: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, pp 271\u2013280. Society for Industrial and Applied Mathematics"},{"issue":"6","key":"219_CR4","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J ACM 45(6):891\u2013923","journal-title":"J ACM"},{"issue":"2","key":"219_CR5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0190(93)90222-U","volume":"45","author":"M Bern","year":"1993","unstructured":"Bern M (1993) Approximate closest-point queries in high dimensions. Inf Process Lett 45(2):95\u201399","journal-title":"Inf Process Lett"},{"issue":"2","key":"219_CR6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s11042-008-0226-z","volume":"41","author":"B Bustos","year":"2009","unstructured":"Bustos B, Navarro G (2009) Improving the space cost of k-nn search in metric spaces by using distance estimators. Multimed Tools Appl 41(2):215\u2013233","journal-title":"Multimed Tools Appl"},{"key":"219_CR7","doi-asserted-by":"crossref","unstructured":"Chow C-Y, Mokbel MF, Naps J, Nath S (2009) Approximate evaluation of range nearest neighbor queries with quality guarantee. In: SSTD \u201909: Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases, pp 283\u2013301. Springer","DOI":"10.1007\/978-3-642-02982-0_19"},{"key":"219_CR8","doi-asserted-by":"crossref","unstructured":"Corral A, Ca nadas J, Vassilakopoulos M (2002) Approximate algorithms for distance-based queries in high-dimensional data spaces using r-trees. In: ADBIS \u201902: Proceedings of the 6th East European Conference on Advances in Databases and Information Systems, pp 163\u2013176. Springer","DOI":"10.1007\/3-540-45710-0_14"},{"issue":"2","key":"219_CR9","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1093\/comjnl\/bxh060","volume":"48","author":"A Corral","year":"2005","unstructured":"Corral A, Vassilakopoulos M (2005) On approximate algorithms for distance-based queries using r-trees. Comput J 48(2):220\u2013238","journal-title":"Comput J"},{"issue":"4","key":"219_CR10","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.comgeo.2008.09.009","volume":"43","author":"GD Fonseca da","year":"2010","unstructured":"da Fonseca GD, Mount DM (2010) Approximate range searching: The absolute model. Comput Geom Theory Appl 43(4):434\u2013444","journal-title":"Comput Geom Theory Appl"},{"key":"219_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational geometry: algorithms and applications","author":"M Berg de","year":"2008","unstructured":"de Berg M, Cheong O, van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Berlin","edition":"3"},{"issue":"2","key":"219_CR12","first-page":"123","volume":"7","author":"N Ghadiri","year":"2011","unstructured":"Ghadiri N, Baraani-Dastjerdi A, Ghasem-Aghaee N, Nematbakhsh MA (2011) Optimizing the performance and robustness of type-2 fuzzy group nearest-neighbor queries. Mob Inf Syst 7(2):123\u2013145","journal-title":"Mob Inf Syst"},{"key":"219_CR13","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: SIGMOD \u201984: Proceedings of the 1984 ACM SIGMOD international conference on Management of data pages, ACM. pp 47\u201357","DOI":"10.1145\/602259.602266"},{"issue":"1","key":"219_CR14","first-page":"1","volume":"7","author":"F Morvan","year":"2011","unstructured":"Morvan F, Hameurlain A (2011) A mobile relational algebra. Mob Inf Syst 7(1):1\u201320","journal-title":"Mob Inf Syst"},{"key":"219_CR15","doi-asserted-by":"crossref","unstructured":"Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: VLDB \u20192003: Proceedings of the 29th international conference on Very large data bases, VLDB Endowment. pp 802\u2013813","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"219_CR16","volume-title":"Spatial databases: with application to GIS","author":"AV Philippe Rigaux","year":"2002","unstructured":"Philippe Rigaux AV, Scholl MO (2002) Spatial databases: with application to GIS. Morgan Kaufmann, Burlington"},{"issue":"1","key":"219_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1504\/IJWGS.2011.038386","volume":"7","author":"JM Rodriguez","year":"2011","unstructured":"Rodriguez JM, Zunino A, Campo M (2011) Introducing mobile devices into grid systems: a survey. Int J Web Grid Serv 7(1):1\u201340","journal-title":"Int J Web Grid Serv"},{"key":"219_CR18","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: SIGMOD \u201995: Proceedings of the 1995 ACM SIGMOD international conference on Management of data, ACM. pp 71\u201379","DOI":"10.1145\/223784.223794"},{"issue":"3","key":"219_CR19","first-page":"207","volume":"1","author":"M Safar","year":"2005","unstructured":"Safar M (2005) K nearest neighbor search in navigation systems. Mob Inf Syst 1(3):207\u2013224","journal-title":"Mob Inf Syst"},{"issue":"4","key":"219_CR20","first-page":"1","volume":"1","author":"M Safar","year":"2006","unstructured":"Safar M, Ebrahimi D (2006) Edar algorithm for continuous knn queries based on pine. IJITWE 1(4): 1\u201321","journal-title":"IJITWE"},{"key":"219_CR21","unstructured":"Sedighian KS, Sharifi M (2012) Coverage rate calculation in wireless sensor networks. Computing : 1\u201324"},{"key":"219_CR22","doi-asserted-by":"crossref","unstructured":"Sistla AP, Wolfson O, Chamberlain S, Dao S (1997) Modeling and querying moving objects. In: Proceedings of the thirteenth international conference on data engineering ICDE \u201997, pp 422\u2013432. IEEE Computer Society","DOI":"10.1109\/ICDE.1997.581973"},{"key":"219_CR23","doi-asserted-by":"crossref","unstructured":"Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: Proceedings of the 7th international symposium on advances in spatial and temporal databases SSTD \u201901, pp 79\u201396. Springer","DOI":"10.1007\/3-540-47724-1_5"},{"key":"219_CR24","doi-asserted-by":"crossref","DOI":"10.1002\/9780470391365","volume-title":"High performance parallel database processing and grid databases. Wiley Series on Parallel and Distributed Computing","author":"D Taniar","year":"2008","unstructured":"Taniar D, Leung CHC, Rahayu W, Goel S (2008) High performance parallel database processing and grid databases. Wiley Series on Parallel and Distributed Computing. Wiley, Hoboken"},{"key":"219_CR25","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: Proceedings of the 28th international conference on Very Large Data Bases, VLDB \u201902, pp 287\u2013298. VLDB Endowment","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"issue":"4","key":"219_CR26","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/j.jcss.2010.02.005","volume":"77","author":"K Xuan","year":"2011","unstructured":"Xuan K, Zhao G, Taniar D, Rahayu W, Safar M, Srinivasan B (2011) Voronoi-based range and continuous range query processing in mobile databases. J Comput Syst Sci 77(4):637\u2013651","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"219_CR27","doi-asserted-by":"crossref","first-page":"46","DOI":"10.4018\/jdwm.2011010103","volume":"7","author":"C Yildizli","year":"2011","unstructured":"Yildizli C, Pedersen Thomas B, Saygin Y, Savas E, Levi A (2011) Distributed privacy preserving clustering via homomorphic secret sharing and its application to (vertically) partitioned spatio-temporal data. Int J Data Warehouse Min 7(1):46\u201366","journal-title":"Int J Data Warehouse Min"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0219-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-012-0219-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0219-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T15:17:42Z","timestamp":1562253462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-012-0219-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,18]]},"references-count":27,"journal-issue":{"issue":"10-11","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["219"],"URL":"https:\/\/doi.org\/10.1007\/s00607-012-0219-7","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,18]]}}}