"id" |"create_date" |"modified_date" |"depositor" |"title" |"date_uploaded" |"date_modified"|"state"|"proxy_depositor"|"on_behalf_of"|"arkivo_checksum"|"owner"|"alternate_title"|"award"|"includes"|"advisor" |"sponsor"|"center"|"year"|"funding"|"institute"|"orcid"|"committee"|"degree"|"department" |"school"|"defense_date"|"sdg"|"alternative_title"|"label"|"relative_path"|"import_url"|"resource_type"|"creator" |"contributor"|"description" |"abstract"|"keyword" |"keyword" |"keyword" |"license"|"rights_notes"|"rights_statement" |"access_right"|"publisher" |"date_created"|"subject"|"language"|"identifier" |"based_near"|"related_url"|"bibliographic_citation"|"source"|"version" |"permalink" "9z902z99z"|"2019-06-29T17:25:47.634+00:00"|"2024-03-12T20:40:42.083+00:00"|"depositor@wpi.edu"|"Mining Spatio-Temporal Reachable Regions over Massive Trajectory Data "|"2019-06-29T17:25:46.814+00:00"|"" |"" |"" |"" |"" |"" |"" |"" |"" |"Li, Yanhua"|"" |"" |"2017"|"" |"" |"" |"" |"MS" |"Data Science"|"" |"2017-04-18" |"" |"" |"" |"" |"" |"Thesis" |"Ding, Yichen"|"Li, Yanhua" |"Mining spatio-temporal reachable regions aims to find a set of road segments from massive trajectory data, that are reachable from a user-specified location and within a given temporal period. Accurately extracting such spatio-temporal reachable area is vital in many urban applications, e.g., (i) location-based recommendation, (ii) location-based advertising, and (iii) business coverage analysis. The traditional approach of answering such queries essentially performs a distance-based range query over the given road network, which have two main drawbacks: (i) it only works with the physical travel distances, where the users usually care more about dynamic traveling time, and (ii) it gives the same result regardless of the querying time, where the reachable area could vary significantly with different traffic conditions.Motivated by these observations, in this thesis, we propose a data- driven approach to formulate the problem as mining actual reachable region based on real historical trajectory dataset. The main challenge in our approach is the system efficiency, as verifying the reachability over the massive trajectories involves huge amount of disk I/Os. In this thesis, we develop two indexing structures: 1) spatio-temporal index (ST-Index) and 2) connection index (Con-Index) to reduce redundant trajectory data access operations. We also propose a novel query processing algorithm with: 1) maximum bounding region search, which directly extracts a small searching region from the index structure and 2) trace back search, which refines the search results from the previous step to find the final query result. Moreover, our system can also efficiently answer the spatio-temporal reachability query with multiple query locations by skipping the overlapped area search. We evaluate our system extensively using a large-scale real taxi trajectory data in Shenzhen, China, where results demonstrate that the proposed algorithms can reduce 50%-90% running time over baseline algorithms."|"" |"reachability query"|"spatio-temporal data management"|"trajectory query"|"" |"" |"http://rightsstatements.org/vocab/InC/1.0/"|"" |"Worcester Polytechnic Institute"|"2017-04-15" |"" |"English" |"etd-041517-165215"|"" |"" |"" |"" |"W/"6693b76114adc91548554c12099b023bdd3ad968""|"https://digital.wpi.edu/show/9z902z99z"