{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:58:27Z","timestamp":1742979507792,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030159955"},{"type":"electronic","value":"9783030159962"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-15996-2_15","type":"book-chapter","created":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T08:05:25Z","timestamp":1553501125000},"page":"202-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bigger Buffer k-d Trees on Multi-Many-Core Systems"],"prefix":"10.1007","author":[{"given":"Fabian","family":"Gieseke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cosmin Eugen","family":"Oancea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Mahabal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Igel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Heskes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,26]]},"reference":[{"issue":"9","key":"15_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J Bentley","year":"1975","unstructured":"Bentley, J.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Freund, Y.: Random projection trees and low dimensional manifolds. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 537\u2013546. ACM, New York (2008)","DOI":"10.1145\/1374376.1374452"},{"key":"15_CR4","unstructured":"Djorgovski, S.G., et al.: The catalina real-time transient survey. In: Monitoring Variable X-Ray Sources, The First Year of MAXI (2011)"},{"key":"15_CR5","unstructured":"Faraway, J., Mahabal, A., Sun, J., Wang, X., Yi, W., Zhang, L.: Modeling light curves for improved classification. eprint \n                      arXiv:1401.3211\n                      \n                     (2014)"},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J Friedman","year":"1977","unstructured":"Friedman, J., Bentley, J., Finkel, R.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3(3), 209\u2013226 (1977)","journal-title":"ACM Trans. Math. Softw."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Garcia, V., Debreuve, E., Nielsen, F., Barlaud, M.: K-nearest neighbor search: fast GPU-based implementations and application to high-dimensional feature matching. In: Proceedings of the 17th IEEE International Conference on Image Processing, pp. 3757\u20133760. IEEE (2010)","DOI":"10.1109\/ICIP.2010.5654017"},{"key":"15_CR8","unstructured":"Gieseke, F., Heinermann, J., Oancea, C., Igel, C.: Buffer k-d trees: processing massive nearest neighbor queries on GPUs. In: Proceedings of the 31st International Conference on Machine Learning. JMLR W&CP, vol. 32, pp. 172\u2013180 (2014)"},{"issue":"3","key":"15_CR9","first-page":"387","volume":"39","author":"AA Mahabal","year":"2011","unstructured":"Mahabal, A.A., et al.: Discovery, classification, and scientific exploration of transient events from the catalina real-time transient survey. Bull. Astronmical Soc. India 39(3), 387\u2013408 (2011)","journal-title":"Bull. Astronmical Soc. India"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jocs.2011.01.006","volume":"3","author":"N Nakasato","year":"2012","unstructured":"Nakasato, N.: Implementation of a parallel tree method on a GPU. J. Comput. Sci. 3(3), 132\u2013141 (2012)","journal-title":"J. Comput. Sci."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Pan, J., Manocha, D.: Fast GPU-based locality sensitive hashing for k-nearest neighbor computation. In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 211\u2013220. ACM (2011)","DOI":"10.1145\/2093973.2094002"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1093\/mnras\/sts017","volume":"428","author":"K Polsterer","year":"2013","unstructured":"Polsterer, K., Zinn, P., Gieseke, F.: Finding new high-redshift quasars by asking the neighbours. Monthly Not. R. Astron. Soc. 428(1), 226\u2013235 (2013)","journal-title":"Monthly Not. R. Astron. Soc."},{"key":"15_CR13","volume-title":"OpenCL in Action: How to Accelerate Graphics and Computation","author":"M Scarpino","year":"2012","unstructured":"Scarpino, M.: OpenCL in Action: How to Accelerate Graphics and Computation. Manning, New York (2012)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Sismanis, N., Pitsianis, N., Sun, X.: Parallel search of k-nearest neighbors with synchronous operations. In: IEEE Conference on High Performance Extreme Computing, pp. 1\u20136. IEEE (2012)","DOI":"10.1109\/HPEC.2012.6408667"},{"key":"15_CR15","volume-title":"Introduction to Data Mining","author":"PN Tan","year":"2005","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison-Wesley, Boston (2005)"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing for Computational Science \u2013 VECPAR 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15996-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:09:29Z","timestamp":1558343369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15996-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030159955","9783030159962"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15996-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VECPAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Vector and Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"S\u00e3o Pedro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vecpar2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vecpar2018.ncc.unesp.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}