{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T11:20:17Z","timestamp":1721388017059},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,7]]},"abstract":"<jats:p>\n            The widespread use of location-aware devices has led to countless location-based services in which a user query can be arbitrarily complex, i.e., one that embeds multiple spatial selection and join predicates. Amongst these predicates, the\n            <jats:italic>k<\/jats:italic>\n            -Nearest-Neighbor (\n            <jats:italic>k<\/jats:italic>\n            NN) predicate stands as one of the most important and widely used predicates. Unlike related research, this paper goes beyond the optimization of queries with single\n            <jats:italic>k<\/jats:italic>\n            NN predicates, and shows how queries with\n            <jats:italic>two k<\/jats:italic>\n            NN predicates can be optimized. In particular, the paper addresses the optimization of queries with: (i) two\n            <jats:italic>k<\/jats:italic>\n            NN-select predicates, (ii) two\n            <jats:italic>k<\/jats:italic>\n            NN-join predicates, and (iii) one\n            <jats:italic>k<\/jats:italic>\n            NN-join predicate and one\n            <jats:italic>k<\/jats:italic>\n            NN-select predicate. For each type of queries, conceptually correct query evaluation plans (QEPs) and new algorithms that optimize the query execution time are presented. Experimental results demonstrate that the proposed algorithms outperform the conceptually correct QEPs by orders of magnitude.\n          <\/jats:p>","DOI":"10.14778\/2350229.2350231","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1100-1111","source":"Crossref","is-referenced-by-count":11,"title":["Spatial queries with two kNN predicates"],"prefix":"10.14778","volume":"5","author":[{"given":"Ahmed M.","family":"Aly","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walid G.","family":"Aref","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mourad","family":"Ouzzani","sequence":"additional","affiliation":[{"name":"Qatar Computing Research Institute, Qatar"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,7]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"http:\/\/dna.fernuni-hagen.de\/secondo\/BerlinMOD\/BerlinMOD.html","author":"Berlinmod Secondo","year":"2011","unstructured":"Secondo Berlinmod . http:\/\/dna.fernuni-hagen.de\/secondo\/BerlinMOD\/BerlinMOD.html , 2011 . Secondo Berlinmod. http:\/\/dna.fernuni-hagen.de\/secondo\/BerlinMOD\/BerlinMOD.html, 2011."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0142-5"},{"key":"e_1_2_1_4_1","volume-title":"Database System Implementation","author":"Garcia-Molina H.","year":"2000","unstructured":"H. Garcia-Molina , J. D. Ullman , and J. Widom . Database System Implementation . Prentice-Hall , 2000 . H. Garcia-Molina, J. D. Ullman, and J. Widom. Database System Implementation. Prentice-Hall, 2000."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0185-7"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35973-1_1148"},{"issue":"3","key":"e_1_2_1_8_1","first-page":"3","article-title":"Place: A scalable location-aware database server for spatio-temporal data streams","volume":"28","author":"Mokbel M. F.","year":"2005","unstructured":"M. F. Mokbel and W. G. Aref . Place: A scalable location-aware database server for spatio-temporal data streams . IEEE Data Eng. Bull. , 28 ( 3 ): 3 -- 10 , 2005 . M. F. Mokbel and W. G. Aref. Place: A scalable location-aware database server for spatio-temporal data streams. IEEE Data Eng. Bull., 28(3):3--10, 2005.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007638"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190604"},{"key":"e_1_2_1_11_1","first-page":"43","volume-title":"VLDB","author":"Mouratidis K.","year":"2006","unstructured":"K. Mouratidis , M. L. Yiu , D. Papadias , and N. Mamoulis . Continuous nearest neighbor monitoring in road networks . In VLDB , pages 43 -- 54 , 2006 . K. Mouratidis, M. L. Yiu, D. Papadias, and N. Mamoulis. Continuous nearest neighbor monitoring in road networks. In VLDB, pages 43--54, 2006."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0163-0"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"e_1_2_1_14_1","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"Samet H.","year":"2006","unstructured":"H. Samet . Foundations of Multidimensional and Metric Data Structures . Morgan Kaufmann Publishers Inc ., 2006 . H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers Inc., 2006."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2006.11.011"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807330"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.113"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447873"},{"key":"e_1_2_1_20_1","first-page":"756","volume-title":"VLDB","author":"Xia C.","year":"2004","unstructured":"C. Xia , H. Lu , B. C. Ooi , and J. Hu . Gorder: An efficient method for KNN join processing . In VLDB , pages 756 -- 767 , 2004 . C. Xia, H. Lu, B. C. Ooi, and J. Hu. Gorder: An efficient method for KNN join processing. In VLDB, pages 756--767, 2004."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.128"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2350229.2350231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:24:58Z","timestamp":1672226698000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2350229.2350231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":20,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["10.14778\/2350229.2350231"],"URL":"https:\/\/doi.org\/10.14778\/2350229.2350231","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}