{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:44:51Z","timestamp":1725601491014},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229213"},{"type":"electronic","value":"9783642229220"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22922-0_19","type":"book-chapter","created":{"date-parts":[[2011,8,20]],"date-time":"2011-08-20T05:39:14Z","timestamp":1313818754000},"page":"313-329","source":"Crossref","is-referenced-by-count":3,"title":["MSSQ: Manhattan Spatial Skyline Queries"],"prefix":"10.1007","author":[{"given":"Wanbin","family":"Son","sequence":"first","affiliation":[]},{"given":"Seung-won","family":"Hwang","sequence":"additional","affiliation":[]},{"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"19_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.P.: 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":"19_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":"19_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":"19_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":"19_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":"19_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)"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1567274.1567276","volume":"34","author":"M. Sharifzadeh","year":"2009","unstructured":"Sharifzadeh, M., Shahabi, C., Kazemi, L.: Processing spatial skyline queries in both vector spaces and spatial network databases. ACM Transactions on Database Systems (TODS)\u00a034(3), 1\u201343 (2009)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-02982-0_17","volume-title":"Advances in Spatial and Temporal Databases","author":"W. Son","year":"2009","unstructured":"Son, W., Lee, M.W., Ahn, H.K., Hwang, S.w.: Spatial skyline queries: An efficient geometric algorithm. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD 2009. LNCS, vol.\u00a05644, pp. 247\u2013264. Springer, Heidelberg (2009)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Lee, M.W., Son, W., Ahn, H.K., Hwang, S.w.: Spatial skyline queries: exact and approximation algorithms. GeoInformatica, 1\u201333 (2010)","DOI":"10.1007\/s10707-010-0119-y"},{"key":"19_CR10","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":"19_CR11","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":"19_CR12","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":"19_CR13","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":"19_CR14","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":"19_CR15","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":"19_CR16","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":"19_CR17","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 nearest neighbor meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"issue":"2","key":"19_CR18","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":"19_CR19","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Erickson, J.: Geometric Range Searching and Its Relatives. Advances in Discrete and Computational Geometry, pp. 1\u201356 (1999)","DOI":"10.1090\/conm\/223\/03131"},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01762115","volume":"3","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: An algorithm for segment-dragging and its implementation. Algorithmica\u00a03(1), 205\u2013221 (1988)","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01758836","volume":"8","author":"J. Mitchell","year":"1992","unstructured":"Mitchell, J.: L 1 shortest paths among polygonal obstacles in the plane. Algorithmica\u00a08(1), 55\u201388 (1992)","journal-title":"Algorithmica"}],"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-22922-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T02:05:51Z","timestamp":1560477951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22922-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229213","9783642229220"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22922-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}