{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T14:10:26Z","timestamp":1771510226981,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,12,4]],"date-time":"2010-12-04T00:00:00Z","timestamp":1291420800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10707-010-0119-y","type":"journal-article","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T10:21:53Z","timestamp":1291371713000},"page":"665-697","source":"Crossref","is-referenced-by-count":13,"title":["Spatial skyline queries: exact and approximation algorithms"],"prefix":"10.1007","volume":"15","author":[{"given":"Mu-Woong","family":"Lee","sequence":"first","affiliation":[]},{"given":"Wanbin","family":"Son","sequence":"additional","affiliation":[]},{"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[]},{"given":"Seung-won","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,4]]},"reference":[{"issue":"4","key":"119_CR1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"HT Kung","year":"1975","unstructured":"Kung HT, Luccio F, Preparata FP (1975) On finding the maxima of a set of vectors. J ACM 22(4):469\u2013476","journal-title":"J ACM"},{"key":"119_CR2","unstructured":"B\u00f6rzs\u00f6nyi S, Kossmann D, Stocker K (2001) The skyline operator. In: ICDE \u201901: Proceedings of the 17th international conference on data engineering. Washington, DC, USA. IEEE Computer Society, New York, pp 421\u2013430"},{"key":"119_CR3","unstructured":"Tan K-L, Eng P-K, Ooi BC (2001) Efficient progressive skyline computation. In: VLDB \u201901: Proceedings of the 27th international conference on very large data bases. San Francisco, CA, USA. Morgan Kaufmann, San Mateo, pp 301\u2013310"},{"key":"119_CR4","doi-asserted-by":"crossref","unstructured":"Papadias D, Tao Y, Fu G, Seeger B (2003) An optimal and progressive algorithm for skyline queries. In: SIGMOD \u201903: Proceedings of the 2003 ACM SIGMOD international conference on management of data. New York, NY, USA. ACM, New York, pp 467\u2013478","DOI":"10.1145\/872757.872814"},{"key":"119_CR5","first-page":"717","volume-title":"ICDE \u201903: Proceedings of the 19th international conference on data engineering","author":"J Chomicki","year":"2003","unstructured":"Chomicki J, Godfery P, Gryz J, Liang D (2003) Skyline with presorting. In: ICDE \u201903: Proceedings of the 19th international conference on data engineering. IEEE Computer Society, New York, pp 717\u2013816"},{"key":"119_CR6","unstructured":"Sharifzadeh M, Shahabi C (2006) The spatial skyline queries. In: VLDB \u201906: Proceedings of the 32nd international conference on very large data bases. VLDB Endowment, pp 751\u2013762"},{"issue":"3","key":"119_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1567274.1567276","volume":"34","author":"M Sharifzadeh","year":"2009","unstructured":"Sharifzadeh M, Shahabi C, Kazemi L (2009) Processing spatial skyline queries in both vector spaces and spatial network databases. ACM Trans Database Syst 34(3):1\u201345","journal-title":"ACM Trans Database Syst"},{"key":"119_CR8","doi-asserted-by":"crossref","unstructured":"Lin X, Yuan Y, Zhang Q, Zhang Y (2007) Selecting stars: the k most representative skyline operator. In: ICDE \u201907: Proceedings of the 23rd international conference on data engineering, pp 86\u201395","DOI":"10.1109\/ICDE.2007.367854"},{"key":"119_CR9","unstructured":"Kossmann D, Ramsak F, Rost S (2002) Shooting stars in the sky: an online algorithm for skyline queries. In: VLDB \u201902: Proceedings of the 28th international conference on very large data bases. VLDB Endowment, pp 275\u2013286"},{"key":"119_CR10","unstructured":"Godfrey P, Shipley R, Gryz J (2005) Maximal vector computation in large data sets. In VLDB \u201905: Proceedings of the 31st international conference on very large data bases. VLDB Endowment, pp 229\u2013240"},{"key":"119_CR11","doi-asserted-by":"crossref","unstructured":"Chan CY, Jagadish HV, Tan K-L, Tung AKH, Zhang Z (2006) On high dimensional skylines. In: EDBT \u201906: Proceedings of the 10th international conference on extending database technology, pp 478\u2013495","DOI":"10.1007\/11687238_30"},{"key":"119_CR12","unstructured":"Chan C-Y, Jagadish HV, Tan K-L, Tung AKH, Zhang Z (2006) Finding k-dominant skylines in high dimensional space. In: SIGMOD \u201906: Proceedings of the 2006 ACM SIGMOD international conference on management of data. New York, NY, USA. ACM, New York, pp 503\u2013514"},{"issue":"12","key":"119_CR13","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1109\/TKDE.2006.185","volume":"18","author":"Z Huang","year":"2006","unstructured":"Huang Z, Lu H, Ooi BC, Tung AKH (2006) Continuous skyline queries for moving objects. IEEE Trans Knowl Data Eng 18(12):1645\u20131658","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"119_CR14","unstructured":"Lee M-W, Hwang S-w (2009) Continuous skylining on volatile moving data. In: ICDE \u201909: Proceedings of the 2009 IEEE international conference on data engineering. Washington, DC, USA. IEEE Computer Society, New York, pp 1568\u20131575"},{"issue":"2","key":"119_CR15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/568271.223794","volume":"24","author":"N Roussopoulos","year":"1995","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. SIGMOD Rec 24(2):71\u201379","journal-title":"SIGMOD Rec"},{"key":"119_CR16","doi-asserted-by":"crossref","unstructured":"Berchtold S, B\u00f6hm C, Keim DA, Kriegel H-P (1997) A cost model for nearest neighbor search in high-dimensional data space. In: PODS \u201997: Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems. New York, NY, USA. ACM, New York, pp 78\u201386","DOI":"10.1145\/263661.263671"},{"key":"119_CR17","unstructured":"Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is \u201cnearest neighbor\u201d meaningful? In: ICDT \u201999: Proceedings of the 7th international conference on database theory. London, UK. Springer, Berlin, pp 217\u2013235"},{"key":"119_CR18","doi-asserted-by":"crossref","unstructured":"Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: SSTD \u201901: Proceedings of the 7th international symposium on advances in spatial and temporal databases. London, UK. Springer, Berlin, pp 79\u201396","DOI":"10.1007\/3-540-47724-1_5"},{"key":"119_CR19","doi-asserted-by":"crossref","unstructured":"Benetis R, Jensen CS, Karciauskas G, Saltenis S (2002) Nearest neighbor and reverse nearest neighbor queries for moving objects. In: IDEAS \u201902: Proceedings of the 2002 international symposium on database engineering & applications. Washington, DC, USA. IEEE Computer Society, New York, pp 44\u201353","DOI":"10.1109\/IDEAS.2002.1029655"},{"key":"119_CR20","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: VLDB \u201902: Proceedings of the 28th international conference on very large data bases. VLDB Endowment, pp 287\u2013298","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"issue":"2","key":"119_CR21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1023403908170","volume":"7","author":"K Raptopoulou","year":"2003","unstructured":"Raptopoulou K, Papadopoulos AN, Manolopoulos Y (2003) Fast nearest-neighbor query processing in moving-object databases. Geoinformatica 7(2):113\u2013137","journal-title":"Geoinformatica"},{"issue":"2","key":"119_CR22","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias D, Tao Y, Mouratidis K, Hui CK (2005) Aggregate nearest neighbor queries in spatial databases. ACM Trans Database Syst 30(2):529\u2013576","journal-title":"ACM Trans Database Syst"},{"key":"119_CR23","unstructured":"Huang X, Jensen CS (2004) In-route skyline querying for location-based services. In: Proceedings of the international workshop on web and wireless geographical information systems (W2GIS), pp 120\u2013135"},{"key":"119_CR24","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\u00a0Berg M, Cheong O, van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Berlin","edition":"3"},{"issue":"4","key":"119_CR25","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1145\/322092.322095","volume":"25","author":"JL Bentley","year":"1978","unstructured":"Bentley JL, Kung HT, Schkolnick M, Thompson CD (1978) On the average number of maxima in a set of vectors and applications. J ACM 25(4):536\u2013543","journal-title":"J ACM"},{"key":"119_CR26","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1996","unstructured":"Rockafellar RT (1996) Convex analysis. Princeton University Press, Princeton"},{"key":"119_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on discrete geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek J (2002) Lectures on discrete geometry. Springer, Berlin"},{"key":"119_CR28","unstructured":"Barber B (1995) Qhull code for convex hull, delaunay triangulation, voronoi diagram, and halfspace intersection about a point. http:\/\/www.qhull.org\/"},{"issue":"2","key":"119_CR29","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N Beckmann","year":"1990","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. SIGMOD Rec 19(2):322\u2013331","journal-title":"SIGMOD Rec"},{"key":"119_CR30","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01224932","volume":"34","author":"V Klee","year":"1980","unstructured":"Klee V (1980) On the complexity of d-dimensional Voronoi diagrams. Arch Math 34:75\u201380","journal-title":"Arch Math"},{"key":"119_CR31","unstructured":"Chazelle B (1991) An optimal convex hull algorithm and new results on cuttings (extended abstract). In: SFCS \u201991: Proceedings of the 32nd annual symposium on foundations of computer science. Washington, DC, USA. IEEE Computer Society, New York, pp 29\u201338"},{"issue":"5","key":"119_CR32","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"KL Clarkson","year":"1989","unstructured":"Clarkson KL, Shor PW (1989) Applications of random sampling in computational geometry, II. Discrete Comput Geom 4(5):387\u2013421","journal-title":"Discrete Comput Geom"},{"issue":"5","key":"119_CR33","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF02574699","volume":"6","author":"R Seidel","year":"1991","unstructured":"Seidel R (1991) Small-dimensional linear programming and convex hulls made easy. Discrete Comput Geom 6(5):423\u2013434","journal-title":"Discrete Comput Geom"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-010-0119-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-010-0119-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-010-0119-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T19:32:40Z","timestamp":1559849560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-010-0119-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,4]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["119"],"URL":"https:\/\/doi.org\/10.1007\/s10707-010-0119-y","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,4]]}}}