IEEE Transactions on Knowledge and Data Engineering · 2012 · 35 citations · 40 references
EngineeringInformation ForensicsCrowdsourced Trace SimilarityMobile AnalyticsComputational Social ScienceInformation RetrievalData ScienceData MiningQuery ProcessorInternet Of ThingsOwn Smartlab TestbedData ManagementKnowledge DiscoveryMobile ComputingComputer ScienceCrowdsourcingDistributed Query ProcessingQuery OptimizationMobile Computing SystemRelational QueriesCrowd ComputingMobile SensingSocial ComputingBusinessHuman-computer InteractionBig DataQuery Trace Q
Smartphones are nowadays equipped with a number of sensors, such as WiFi, GPS, accelerometers, etc. This capability allows smartphone users to easily engage in crowdsourced computing services, which contribute to the solution of complex problems in a distributed manner. In this work, we leverage such a computing paradigm to solve efficiently the following problem: comparing a query trace Q against a crowd of traces generated and stored on distributed smartphones. Our proposed framework, coined SmartTrace <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">+</sup> , provides an effective solution without disclosing any part of the crowd traces to the query processor. SmartTrace <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">+</sup> , relies on an in-situ data storage model and intelligent top-K query processing algorithms that exploit distributed trajectory similarity measures, resilient to spatial and temporal noise, in order to derive the most relevant answers to Q. We evaluate our algorithms on both synthetic and real workloads. We describe our prototype system developed on the Android OS. The solution is deployed over our own SmartLab testbed of 25 smartphones. Our study reveals that computations over SmartTrace <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">+</sup> result in substantial energy conservation; in addition, results can be computed faster than competitive approaches.
40
Mining interesting locations and travel sequences from GPS trajectories
Yu Zheng, Lizhu Zhang, Xing Xie et al. · 2009 · 1.9K citations
Engineering, Location-aware Social Medium, Spatiotemporal Database +16
Robust and fast similarity search for moving object trajectories
Lei Chen, M. TAMER ÖZSU, Vincent Oria · 2005 · 1.3K citations
Jakob Eriksson, Lewis Girod, Bret Hull et al. · 2008 · 1.1K citations
Optimal aggregation algorithms for middleware
Ronald Fagin, Amnon Lotem, Moni Naor · 2001 · 1.1K citations