Journal Article10.1109/TMC.2007.70791
Location-Based Spatial Query Processing with Data Sharing in Wireless Broadcast Environments
TL;DR: This paper presents a novel query processing technique based on peer-topeer sharing, which enables the processing of location-based spatial queries without delay at a mobile host by using query results cached in its neighboring mobile peers.
read more
Abstract: Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQs is of critical importance with the ever-increasing deployment and use of mobile technologies. We show that LBSQs have certain unique characteristics that traditional spatial query processing in centralized databases does not address. For example, a significant challenge is presented by wireless broadcasting environments, which have excellent scalability but often exhibit high-latency database access. In this paper, we present a novel query processing technique that, while maintaining high scalability and accuracy, manages to reduce the latency considerably in answering location-based spatial queries. Our approach is based on peer-topeer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers. We demonstrate the feasibility of our approach through a probabilistic analysis, and we illustrate the appeal of our technique through extensive simulation results.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Dynamic community-based cache for mobile search
Dimitrios Lymberopoulos,Emmanouil Koukoumidis,Jie Liu,Feng Zhao,Douglas C. Burger +4 more
- 24 Jan 2010
TL;DR: A community-based mobile search cache as mentioned in this paper provides various techniques for maximizing the number of query results served from a local query cache, thereby significantly limiting the need to connect to the Internet or cloud using 3G or other wireless links to service search queries.
67
The international journal of organizational innovation
Wei-Li Wu,Yi-Chih Lee,Hui-Shing Shu,Hung-Jung Chang,Jia-Jeng Hou,Szu-Ju Lin,Chun-Chen Huang,Kang-Ni Liu,Chien-Hsiung Lin,Ji-Shou Tseng,Kai-Ping Huang,Jane Tung,Mei-Ju Chou +12 more
- 01 Jan 2015
TL;DR: In this paper, the role of senior entrepreneurship in active ageing is explored from two prominent arguments: (1) as populations age, the number of older business founders will increase, and (2) on the promotion of entrepreneurship in older age segments as a prospective policy option.
54
Query Integrity Assurance of Location-Based Services Accessing Outsourced Spatial Databases
Wei-Shinn Ku,Ling Hu,Cyrus Shahabi,Haixun Wang +3 more
- 30 Jun 2009
TL;DR: A one-way spatial transformation method based on Hilbert curves is used, which encrypts the spatial data before outsourcing and hence ensures its privacy and also devise a technique for the client to audit the trustworthiness of the query results.
Towards Online Shortest Path Computation
TL;DR: This work develops a new framework called live traffic index (LTI), which enables drivers to quickly and effectively collect the live traffic information on the broadcasting channel and an impressive result is that the driver can compute/update their shortest path result by receiving only a small fraction of the index.
A query integrity assurance scheme for accessing outsourced spatial databases
TL;DR: A one-way spatial transformation method based on Hilbert curves is used, which encrypts the spatial data before outsourcing and, hence, ensures its privacy and a technique for the client to audit the trustworthiness of the query results.
31
References
R-trees: a dynamic index structure for spatial searching
Antonin Guttman
- 01 Jun 1984
TL;DR: A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
8K
•Book
Computational Geometry: Algorithms and Applications
Mark de Berg,Otfried Cheong,Marc van Kreveld,Mark H. Overmars +3 more
- 01 Jan 1997
TL;DR: In this article, an introduction to computational geometry focusing on algorithms is presented, which is related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.
5.8K
A performance comparison of multi-hop wireless ad hoc network routing protocols
J. Broch,David A. Maltz,David B. Johnson,Yih-Chun Hu,Jorjeta G. Jetcheva +4 more
- 25 Oct 1998
TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann,Hans-Peter Kriegel,Ralf Schneider,Bernhard Seeger +3 more
- 01 May 1990
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.
Applied Statistics and Probability for Engineers
TL;DR: A review of Improving Performance Through Statistical Thinking, by G. Britz, G., Emerling, D., Hare, L., Hoerl, R., Janis, S., and Shade, J. (2000).
1.9K