{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:18:08Z","timestamp":1740122288926,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,2,28]],"date-time":"2017-02-28T00:00:00Z","timestamp":1488240000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RE 266\/5-1"],"award-info":[{"award-number":["RE 266\/5-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001654","name":"German Academic Exchange Service London Office","doi-asserted-by":"publisher","award":["57055388"],"award-info":[{"award-number":["57055388"]}],"id":[{"id":"10.13039\/501100001654","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["HKU 711110"],"award-info":[{"award-number":["HKU 711110"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10707-017-0293-2","type":"journal-article","created":{"date-parts":[[2017,2,28]],"date-time":"2017-02-28T03:38:29Z","timestamp":1488253109000},"page":"797-827","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Uncertain Voronoi cell computation based on space decomposition"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2880-0299","authenticated-orcid":false,"given":"Klaus Arthur","family":"Schmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Zufle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Emrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reynold","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,28]]},"reference":[{"issue":"4","key":"293_CR1","first-page":"24","volume":"34","author":"CY Chow","year":"2009","unstructured":"Chow CY, Mokbel MF, Aref WG (2009) Casper*: query processing for location services without compromising privacy. ACM TODS 34(4):24","journal-title":"ACM TODS"},{"issue":"1","key":"293_CR2","doi-asserted-by":"crossref","first-page":"326","DOI":"10.14778\/1453856.1453895","volume":"1","author":"G Beskales","year":"2008","unstructured":"Beskales G, Soliman MA, IIyas IF (2008) Efficient search for the top-k probable nearest neighbors in uncertain databases. Proc VLDB Endowment 1(1):326\u2013339","journal-title":"Proc VLDB Endowment"},{"key":"293_CR3","doi-asserted-by":"crossref","unstructured":"Cheng R, Xie X, Yiu ML, Chen J, Sun L (2010) Uv-diagram: a voronoi diagram for uncertain data. In: ICDE, IEEE, pp 796\u2013807","DOI":"10.1109\/ICDE.2010.5447917"},{"key":"293_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.datak.2012.02.001","volume":"75","author":"ME Ali","year":"2012","unstructured":"Ali ME, Tanin E, Zhang R, Kotagiri R (2012) Probabilistic voronoi diagrams for probabilistic moving nearest neighbor queries. DKE 75:1\u201333","journal-title":"DKE"},{"key":"293_CR5","doi-asserted-by":"crossref","unstructured":"Bernecker T, Emrich T, Kriegel HP, Mamoulis N, Renz M, Z\u00fcfle A (2011) A novel probabilistic pruning approach to speed up similarity queries in uncertain databases. In: Proceedings of the 27th international conference on data engineering (ICDE). Hannover, pp 339\u2013350","DOI":"10.1109\/ICDE.2011.5767908"},{"key":"293_CR6","unstructured":"Zhang P, Cheng R, Mamoulis N, Renz M, Z\u00fcfle A, Tang Y, Emrich T (2013) Voronoi-based nearest neighbor search for multi-dimensional uncertain databases. In: Proceedings of the 29th International conference on data engineering (ICDE). Brisbane, pp 158\u2013169"},{"key":"293_CR7","doi-asserted-by":"crossref","unstructured":"Yuan J, Zheng Y, Zhang C, Xie W, Xie X, Sun G, Huang Y (2010) T-drive: Driving directions based on taxi trajectories. In: SIGSPATIAL, pp 99\u2013108","DOI":"10.1145\/1869790.1869807"},{"key":"293_CR8","doi-asserted-by":"crossref","unstructured":"Yuan J, Zheng Y, Xie X, Sun G (2011) Driving with knowledge from the physical world. In: SIGKDD, pp 316\u2013324","DOI":"10.1145\/2020408.2020462"},{"issue":"3","key":"293_CR9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.14778\/2732232.2732239","volume":"7","author":"J Niedermayer","year":"2013","unstructured":"Niedermayer J, Z\u00fcfle A, Emrich T, Renz M, Mamoulis N, Chen L, Kriegel HP (2013) Probabilistic nearest neighbor queries on uncertain moving object trajectories. Proc VLDB Endowment 7(3):205\u2013216","journal-title":"Proc VLDB Endowment"},{"key":"293_CR10","doi-asserted-by":"crossref","unstructured":"Emrich T, Kriegel HP, Kr\u00f6ger P, Renz M, Z\u00fcfle A (2009) Incremental reverse nearest neighbor ranking in vector spaces. In: Proceedings of the 11th International symposium on spatial and temporal databases (SSTD). Aalborg, pp 265\u2013282","DOI":"10.1007\/978-3-642-02982-0_18"},{"key":"293_CR11","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel HP, 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 (SIGMOD). Atlantic City, pp 322\u2013331","DOI":"10.1145\/93597.98741"},{"key":"293_CR12","doi-asserted-by":"crossref","unstructured":"Orenstein JA, Merrett TH (1984) A class of data structures for associative searching. In: ACM SIGACT-SIGMOD. ACM, pp 181\u2013190","DOI":"10.1145\/588011.588037"},{"key":"293_CR13","doi-asserted-by":"crossref","unstructured":"Schmid KA, Emrich T, Z\u00fcfle A, Renz M, Cheng R (2015) Approximate uv computation based on space decomposition. In: Proceedings of the 14th International symposium on spatial and temporal databases (SSTD). Hong Kong","DOI":"10.1007\/978-3-319-22363-6_6"},{"key":"293_CR14","doi-asserted-by":"crossref","unstructured":"Cheng R, Kalashnikov DV, Prabhakar S (2004) Querying imprecise data in moving object environments. In: IEEE Transactions on knowledge and data engineering","DOI":"10.1109\/TKDE.2004.46"},{"issue":"1","key":"293_CR15","doi-asserted-by":"crossref","first-page":"502","DOI":"10.14778\/1687627.1687685","volume":"2","author":"J Li","year":"2009","unstructured":"Li J, Saha B, Deshpande A (2009) A unified approach to ranking in probabilistic databases. Proc VLDB Endowment 2(1):502\u2013513","journal-title":"Proc VLDB Endowment"},{"issue":"9","key":"293_CR16","doi-asserted-by":"crossref","first-page":"1234","DOI":"10.1109\/TKDE.2010.78","volume":"22","author":"T Bernecker","year":"2010","unstructured":"Bernecker T, Kriegel HP, Mamoulis N, Renz M, Z\u00fcfle A (2010) Scalable probabilistic similarity ranking in uncertain databases. IEEE Trans Knowl Data Eng 22(9):1234\u20131246","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"293_CR17","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/TKDE.2009.108","volume":"22","author":"MA Cheema","year":"2010","unstructured":"Cheema MA, Lin X, Wang W, Zhang W, Pei J (2010) Probabilistic reverse nearest neighbor queries on uncertain data. IEEE Trans Knowl Data Eng 22 (4):550\u2013564","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"293_CR18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F Aurenhammer","year":"1991","unstructured":"Aurenhammer F (1991) Voronoi diagrams-a survey of a fundamental geometric data structure. ACM CSUR 23(3):345\u2013405","journal-title":"ACM CSUR"},{"issue":"1\u20132","key":"293_CR19","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.14778\/1920841.1920994","volume":"3","author":"M Sharifzadeh","year":"2010","unstructured":"Sharifzadeh M, Shahabi C (2010) Vor-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries. VLDB Endowment 3 (1\u20132):1231\u20131242","journal-title":"VLDB Endowment"},{"issue":"1","key":"293_CR20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00778-004-0146-0","volume":"15","author":"B Zheng","year":"2006","unstructured":"Zheng B, Xu J, Lee WC, Lee L (2006) Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services. VLDB J 15 (1):21\u201339","journal-title":"VLDB J"},{"issue":"1","key":"293_CR21","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.14778\/1453856.1453973","volume":"1","author":"S Nutanong","year":"2008","unstructured":"Nutanong S, Zhang R, Tanin E, Kulik L (2008) The v*-diagram: a query-dependent approach to moving knn queries. VLDB Endowment 1(1):1095\u20131106","journal-title":"VLDB Endowment"},{"issue":"1","key":"293_CR22","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s00778-007-0081-y","volume":"18","author":"M Sharifzadeh","year":"2009","unstructured":"Sharifzadeh M, Shahabi C (2009) Approximate voronoi cell computation on spatial data streams. VLDB J 18(1):57\u201375","journal-title":"VLDB J"},{"key":"293_CR23","doi-asserted-by":"crossref","unstructured":"Akdogan A, Demiryurek U, Banaei-Kashani F, Shahabi C (2010) Voronoi-based geospatial query processing with mapreduce. In: IEEE CloudCom. IEEE, pp 9\u201316","DOI":"10.1109\/CloudCom.2010.92"},{"key":"293_CR24","doi-asserted-by":"crossref","unstructured":"Kolahdouzan M, Shahabi C (2004) Voronoi-based k nearest neighbor search for spatial network databases. In: VLDB Endowment, VLDB Endowment, pp 840\u2013851","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"293_CR25","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: ACM SIGMOD, vol 24. ACM, pp 71\u201379","DOI":"10.1145\/223784.223794"},{"key":"293_CR26","doi-asserted-by":"crossref","unstructured":"Emrich T, Kriegel HP, Kr\u00f6ger P, Renz M, Z\u00fcfle A (2010) Boosting spatial pruning: on optimal pruning of MBRs. In: Proceedings of the ACM international conference on management of data (SIGMOD). Indianapolis, pp 39\u201350","DOI":"10.1145\/1807167.1807174"},{"key":"293_CR27","doi-asserted-by":"crossref","unstructured":"Hjaltason GR, Samet H (1995) Ranking in spatial databases. In: Proceedings of the 4th international symposium on large spatial databases (SSD). Portland, pp 83\u201395","DOI":"10.1007\/3-540-60159-7_6"},{"key":"293_CR28","doi-asserted-by":"crossref","unstructured":"S\u0307altenis S, Jensen CS, Leutenegger ST, Lopez MA (2000) Indexing the positions of continuously moving objects, vol 29. ACM","DOI":"10.1145\/342009.335427"},{"issue":"1","key":"293_CR29","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.14778\/1687627.1687762","volume":"2","author":"M Zhang","year":"2009","unstructured":"Zhang M, Chen S, Jensen CS, Ooi BC, Zhang Z (2009) Effectively indexing uncertain moving objects for predictive queries. Proc VLDB Endowment 2 (1):1198\u20131209","journal-title":"Proc VLDB Endowment"},{"key":"293_CR30","doi-asserted-by":"crossref","unstructured":"Emrich T, Kriegel HP, Mamoulis N, Renz M, Z\u00fcfle A (2012) Indexing uncertain spatio-temporal data. In: Proceedings of the 21st ACM conference on information and knowledge management (CIKM). Maui, pp 395\u2013404","DOI":"10.1145\/2396761.2396813"},{"issue":"3","key":"293_CR31","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1007\/s00778-008-0123-0","volume":"18","author":"X Lian","year":"2009","unstructured":"Lian X, Chen L (2009) Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data. VLDB J Int J Very Large Data Bases 18(3):787\u2013808","journal-title":"VLDB J Int J Very Large Data Bases"},{"key":"293_CR32","doi-asserted-by":"crossref","unstructured":"Emrich T, Graf F, Kriegel HP, Schubert M, Thoma M (2010) Optimizing all-nearest-neighbor queries with trigonometric pruning. In: Proceedings of the 22nd international conference on scientific and statistical database management (SSDBM). Heidelberg, pp 501\u2013518","DOI":"10.1007\/978-3-642-13818-8_35"},{"key":"293_CR33","doi-asserted-by":"crossref","unstructured":"Achtert E, Kriegel HP, Schubert E, Zimek A (2013) Interactive data mining with 3D-Parallel-Coordinate-Trees. In: Proceedings of the ACM international conference on management of data (SIGMOD). New York City, pp 1009\u20131012","DOI":"10.1145\/2463676.2463696"},{"issue":"4","key":"293_CR34","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00778-006-0004-3","volume":"16","author":"N Dalvi","year":"2007","unstructured":"Dalvi N, Suciu D (2007) Efficient query evaluation on probabilistic databases. VLDB J 16(4):523\u2013544","journal-title":"VLDB J"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-017-0293-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-017-0293-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-017-0293-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T01:02:20Z","timestamp":1568854940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-017-0293-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,28]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["293"],"URL":"https:\/\/doi.org\/10.1007\/s10707-017-0293-2","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2017,2,28]]}}}