Proceedings ArticleDOI
Mobile P2P queries over temporal data
Steven Mudda,Silvia Giordano +1 more
- pp 278-283
Reads0
Chats0
TLDR
This paper considers an environment where stationary objects generate temporal data and peers issue location-dependent range queries, and evaluates this framework by varying the constraints of range queries and measuring their effect on three metrics: percentage of queries satisfied, fraction of data received and query response time.Abstract:
In this paper we evaluate the performance a mobile P2P query processing framework, where peers issue location-dependent range queries and receive temporal data. We consider an environment where stationary objects generate temporal data and peers issue location-dependent range queries. We evaluate this framework by varying the constraints of range queries and measure their effect on three metrics: percentage of queries satisfied, fraction of data received and query response time. From our simulations, we make two key observations: the range query constraints have no impact on the performance metrics beyond a certain threshold and the temporal nature of data drastically limits the mobility benefits (traditionally exploited by mobile P2P query systems). We also present scenarios where a mobile P2P query processing framework can be used to satisfy location-dependent range queries.read more
Citations
More filters
Journal Article
MobiEyes: Distributed processing of continuously moving queries on moving objects in a mobile system
Bugra Gedik,Ling Liu +1 more
TL;DR: This paper introduces a set of optimization techniques, such as Lazy Query Propagation, Query Grouping, and Safe Periods, to constrict the amount of computations handled by the moving objects and to enhance the performance and system utilization of Mobieyes.
Proceedings Article
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
TL;DR: This year 455 research papers were submitted to SIGMOD for consideration, of which 431 were reviewed, and the tally of 65 accepted papers constitutes an acceptance ratio similar to recent years.
Journal ArticleDOI
BL0K: A New Stage of Privacy-Preserving Scope for Location-Based Services
TL;DR: Bloom Filter 0 Knowledge (BL0K) is proposed, which is novel phase privacy method that preserves the framework for location-based service (LBS) and combines a Bloom filter and the Zero knowledge protocol and is demonstrated to be decidedly better when compared to the referenced approaches using the privacy entropy metric.
Journal ArticleDOI
BLOT: A Novel Phase Privacy Preserving Framework for Location-Based Services
TL;DR: BLoom Filter Oblivious Transfer (BLOT) is proposed, a novel phase privacy preserving framework for LBS that combines a Bloom filter hash function and the oblivious transfer protocol that are shown to be useful in securing a user’s private information.
References
More filters
Proceedings ArticleDOI
The R*-tree: an efficient and robust access method for points and rectangles
TL;DR: The R*-tree is designed which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory which clearly outperforms the existing R-tree variants.
Recent Development and Applications of SUMO - Simulation of Urban MObility
TL;DR: The current state of the SUMO package, its major applications, both by research topic and by example, as well as future developments and extensions are described.
Book ChapterDOI
Continuous nearest neighbor search
TL;DR: This paper proposes techniques that solve the problem by performing a single query for the whole input segment, and proposes analytical models for the expected size of the output, as well as the cost of query processing, and extend out techniques to several variations of the problem.
Proceedings ArticleDOI
Location-based spatial queries
TL;DR: This paper proposes an approach that enables mobile clients to determine the validity of previous queries based on their current locations, and focuses on two of the most common spatial query types, namely nearest neighbor and window queries, define the validity region in each case and propose the corresponding query processing algorithms.