{"id":11931,"date":"2014-04-22T23:28:32","date_gmt":"2014-04-22T20:28:32","guid":{"rendered":"http:\/\/hgpu.org\/?p=11931"},"modified":"2014-04-22T23:28:32","modified_gmt":"2014-04-22T20:28:32","slug":"parallel-in-memory-distance-threshold-queries-on-trajectory-databases","status":"publish","type":"post","link":"https:\/\/hgpu.org\/?p=11931","title":{"rendered":"Parallel In-Memory Distance Threshold Queries on Trajectory Databases"},"content":{"rendered":"<p>Spatiotemporal databases are utilized in many applications to store the trajectories of moving objects. In this context, we focus on in-memory distance threshold queries that return all trajectories found within a distance d of a fixed or moving object over a time interval. We present performance results for a sequential query processing algorithm that uses an in-memory R-tree index, and we find that decreasing index resolution improves query response time. We then develop a simple multithreaded implementation and find that high parallel efficiency (78%-90%) can be achieved in a shared memory environment for a set of queries on a real-world dataset. Finally, we show that a GPGPU approach can achieve a speedup over 3.3 when compared to the multithreaded implementation. This speedup is obtained by abandoning the use of an index-tree altogether. This is an interesting result since index-trees have been the cornerstone of efficiently processing spatiotemporal queries.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Spatiotemporal databases are utilized in many applications to store the trajectories of moving objects. In this context, we focus on in-memory distance threshold queries that return all trajectories found within a distance d of a fixed or moving object over a time interval. We present performance results for a sequential query processing algorithm that uses [&hellip;]<\/p>\n","protected":false},"author":351,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[11,90,3],"tags":[1782,667,20,1793,1226],"class_list":["post-11931","post","type-post","status-publish","format-standard","hentry","category-computer-science","category-opencl","category-paper","tag-computer-science","tag-databases","tag-nvidia","tag-opencl","tag-tesla-c2075"],"views":1800,"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/11931","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/users\/351"}],"replies":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=11931"}],"version-history":[{"count":0,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/11931\/revisions"}],"wp:attachment":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=11931"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=11931"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=11931"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}