{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:03:02Z","timestamp":1743148982147,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029813"},{"type":"electronic","value":"9783642029820"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02982-0_17","type":"book-chapter","created":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T01:31:51Z","timestamp":1246239111000},"page":"247-264","source":"Crossref","is-referenced-by-count":25,"title":["Spatial Skyline Queries: An Efficient Geometric Algorithm"],"prefix":"10.1007","author":[{"given":"Wanbin","family":"Son","sequence":"first","affiliation":[]},{"given":"Mu-Woong","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[]},{"given":"Seung-won","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H.T. Kung","year":"1975","unstructured":"Kung, H.T., Luccio, F., Preparata, F.: On finding the maxima of a set of vectors. Journal of the Association for Computing Machinery\u00a022(4), 469\u2013476 (1975)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"17_CR2","unstructured":"B\u00f6rzs\u00f6nyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE 2001: Proc. of the 17th International Conference on Data Engineering, p. 421 (2001)"},{"key":"17_CR3","unstructured":"Tan, K., Eng, P., Ooi, B.C.: Efficient progressive skyline computation. In: VLDB 2001: Proc. of the 27th International Conference on Very Large Data Bases, pp. 301\u2013310 (2001)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: SIGMOD 2003: Proc. of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 467\u2013478 (2003)","DOI":"10.1145\/872757.872814"},{"key":"17_CR5","unstructured":"Chomicki, J., Godfery, P., Gryz, J., Liang, D.: Skyline with presorting. In: ICDE 2007: Proc. of the 23rd International Conference on Data Engineering (2007)"},{"key":"17_CR6","unstructured":"Sharifzadeh, M., Shahabi, C.: The spatial skyline queries. In: VLDB 2006: Proc. of the 32nd International Conference on Very Large Data Bases, pp. 751\u2013762 (2006)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: VLDB 2002: Proc. of the 28th International Conference on Very Large Data Bases, pp. 275\u2013286 (2002)","DOI":"10.1016\/B978-155860869-6\/50032-9"},{"key":"17_CR8","unstructured":"Godfrey, P., Shipley, R., Gryz, J.: Maximal vector computation in large data sets. In: VLDB 2005: Proc. of the 31st International Conference on Very Large Data Bases, pp. 229\u2013240 (2005)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/11687238_30","volume-title":"Advances in Database Technology - EDBT 2006","author":"C.Y. Chan","year":"2006","unstructured":"Chan, C.Y., Jagadish, H., Tan, K., Tung, A.K., Zhang, Z.: On high dimensional skylines. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., B\u00f6hm, K., Kemper, A., Grust, T., B\u00f6hm, C. (eds.) EDBT 2006. LNCS, vol.\u00a03896, pp. 478\u2013495. Springer, Heidelberg (2006)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Chan, C.Y., Jagadish, H., Tan, K.L., Tung, A.K., Zhang, Z.: Finding k-dominant skylines in high dimensional space. In: SIGMOD 2006: Proc. of the 2006 ACM SIGMOD International Conference on Management of Data (2006)","DOI":"10.1145\/1142473.1142530"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Lin, X., Yuan, Y., Zhang, Q., Zhang, Y.: Selecting stars: The k most representative skyline operator. In: ICDE 2007: Proc. of the 23rd International Conference on Data Engineering, pp. 86\u201395 (2007)","DOI":"10.1109\/ICDE.2007.367854"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD 1995: Proc. of the 1995 ACM SIGMOD international conference on Management of data, pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Keim, D.A., Kriegel, H.P.: A cost model for nearest neighbor search in high-dimensional data space. In: PODS 1997: Proc. of the 16th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pp. 78\u201386 (1997)","DOI":"10.1145\/263661.263671"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K.S. Beyer","year":"1998","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cnearest neighbor\u201d meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D. Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Transactions on Database Systems\u00a030(2), 529\u2013576 (2005)","journal-title":"ACM Transactions on Database Systems"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/11427865_10","volume-title":"Web and Wireless Geographical Information Systems","author":"X. Huang","year":"2005","unstructured":"Huang, X., Jensen, C.S.: In-route skyline querying for location-based services. In: Kwon, Y.-J., Bouju, A., Claramunt, C. (eds.) W2GIS 2004. LNCS, vol.\u00a03428, pp. 120\u2013135. Springer, Heidelberg (2005)"},{"key":"17_CR17","doi-asserted-by":"publisher","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.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"17_CR18","unstructured":"Qhull code for convex hull, delaunay triangulation, voronoi diagram, and halfspace intersection about a point. World Wide Web electronic publication (May 1995), http:\/\/www.qhull.org\/"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD 1990: Proc. of the 1990 ACM SIGMOD international conference on Management of data, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF01224932","volume":"34","author":"V. Klee","year":"1980","unstructured":"Klee, V.: On the complexity of d-dimensional Voronoi diagrams. Archiv der Mathematik\u00a034, 75\u201380 (1980)","journal-title":"Archiv der Mathematik"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: An optimal convex hull algorithm and new results on cuttings. In: Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., pp. 29\u201338 (1991)","DOI":"10.1109\/SFCS.1991.185345"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry. II. Discrete Comput. Geom.\u00a04, 387\u2013421 (1989)","journal-title":"II. Discrete Comput. Geom."},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF02574699","volume":"6","author":"R. Seidel","year":"1991","unstructured":"Seidel, R.: Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom.\u00a06, 423\u2013434 (1991)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02982-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:58:03Z","timestamp":1558396683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02982-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029813","9783642029820"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02982-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}