Results 1 - 10 of 246

Query processing using distance oracles for spatial networks

by Jagan Sankaranarayanan, Hanan Samet - Best Papers of ICDE 2009 Special Issue
"... Abstract—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding shortest paths and finding nearest neighbors. The challenge here is that the efficient execution of spatial oper ..."
Abstract - Cited by 10 (3 self) - Add to MetaCart
Abstract—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding shortest paths and finding nearest neighbors. The challenge here is that the efficient execution of spatial

Privacy Protected Query Processing on Spatial Networks

by Wei-shinn Ku, Roger Zimmermann, Wen-chih Peng, Sushama Shroff
"... With the proliferation of mobile devices (e.g., PDAs, cell phones, etc.), location-based services have become more and more popular in recent years. However, users have to reveal their location information to access location-based services with existing service infrastructures. It is possible that a ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
that adversaries could collect the location information, which in turn invades user’s privacy. There are existing solutions for query processing on spatial networks and mobile user privacy protection in Euclidean space. However there is no solution for solving queries on spatial networks with privacy protection

An Air Index for Spatial Query Processing in Road Networks

by Weiwei Sun, Chunan Chen, Baihua Zheng, Chong Chen, Peng Liu, Weiwei Sun, Chunan Chen, Baihua Zheng, Chong Chen, Peng Liu
"... Abstract—Spatial queries such as range query and kNN query in road networks have received a growing number of attention in real life. Considering the large population of the users and the high overhead of network distance computation, it is extremely important to guarantee the efficiency and scalabi ..."
Abstract - Add to MetaCart
and scalability of query processing. Motivated by the scalable and secure properties of wireless broadcast model, this paper presents an air index called Network Partition Index (NPI) to support efficient spatial query processing in road networks via wireless broadcast. The main idea is to partition the road

Continuous Detour Queries in Spatial Networks

by Sarana Nutanong, Egemen Tanin, Jie Shao, Rui Zhang, Kotagiri Ramamohanarao
"... We study the problem of finding the shortest route between two locations that includes a stopover of a given type. An example scenario of this problem is given as follows: “On the way to Bob’s place, Alice searches for a nearby take-away Italian restaurant to buy a pizza. ” Assuming that Alice is i ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
is interested in minimizing the total trip distance, this scenario can be modelled as a query where the current Alice’s location (start) and Bob’s place (destination) function as query points. Based on these two query points, we find the minimum detour object (MDO), i.e., a stopover that minimizes the sum

Distance Based Skyline Query Processing for Mobile Based Applications

by R. Sampath
"... Abstract — Query processing for location based services increased more attention due to the consideration of spatial and non spatial attributes of objects. The previous focus is based on the solving point or line based skyline queries where the query location is a static location point or a line seg ..."
Abstract - Add to MetaCart
segment. Because of the security issues and the accuracy of localization devices the input from received from the user is of spatial range. Here the new issue rises that how to process the distance based skyline queries. Index based and non index based are the two algorithms used to handle queries

Anonymous Query Processing in Road Networks

by Kyriakos Mouratidis, Man Lung Yiu , 2010
"... The increasing availability of location-aware mobile devices has given rise to a flurry of location-based services (LBS). Due to the nature of spatial queries, an LBS needs the user position in order to process her requests. On the other hand, revealing exact user locations to a (potentially untrust ..."
Abstract - Cited by 11 (4 self) - Add to MetaCart
The increasing availability of location-aware mobile devices has given rise to a flurry of location-based services (LBS). Due to the nature of spatial queries, an LBS needs the user position in order to process her requests. On the other hand, revealing exact user locations to a (potentially

Optimal Location Queries in Road Network Databases

by Xiaokui Xiao, Bin Yao, Feifei Li
"... Abstract — Optimal location (OL) queries are a type of spatial queries particularly useful for the strategic planning of resources. Given a set of existing facilities and a set of clients, an OL query asks for a location to build a new facility that optimizes a certain cost metric (defined based on ..."
Abstract - Cited by 15 (1 self) - Add to MetaCart
Abstract — Optimal location (OL) queries are a type of spatial queries particularly useful for the strategic planning of resources. Given a set of existing facilities and a set of clients, an OL query asks for a location to build a new facility that optimizes a certain cost metric (defined based

Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation

by Ning Jing, Yun-wu Huang, Elke A. Rundensteiner - IEEE Transactions on Knowledge and Data Engineering , 1998
"... Abstract—Efficient path computation is essential for applications such as intelligent transportation systems (ITS) and network routing. In ITS navigation systems, many path requests can be submitted over the same, typically huge, transportation network within a small time window. While path precompu ..."
Abstract - Cited by 86 (2 self) - Add to MetaCart
precomputation (path view) would provide an efficient path query response, it raises three problems which must be addressed: 1) precomputed paths exceed the current computer main memory capacity for large networks; 2) disk-based solutions are too inefficient to meet the stringent requirements of these target

Anonymous Processing of Query in Road Networks

by Svits–mahabubnagar A. P, B. J. Sunil, Svits–mahabubnagar A. P, C. Srinivas, Svits–mahabubnagar A. P
"... Abstract—The increasing availability of locationaware mobile deviceshas given rise to a flurry of location-based services (LBS). Due to thenature of spatial queries, an LBS needs the user position in order to processthe requests. On the other hand, revealing exact user locations to (potentially untr ..."
Abstract - Add to MetaCart
to the users is defined according tonetwork distance (e.g., driving time through the roads of a city). In thispaper, we propose a framework for anonymous query processing in roadnetworks. We design location obfuscation techniques that (i) provideanonymous LBS access to the users, and (ii) allow efficient

Distance indexing on road networks

by Haibo Hu, Dik Lun Lee, Victor C. S. Lee - In PVLDB , 2006
"... The processing of kNN and continuous kNN queries on spa-tial network databases (SNDB) has been intensively studied recently. However, there is a lack of systematic study on the computation of network distances, which is the most funda-mental difference between a road network and a Euclidean space. S ..."
Abstract - Cited by 29 (0 self) - Add to MetaCart
The processing of kNN and continuous kNN queries on spa-tial network databases (SNDB) has been intensively studied recently. However, there is a lack of systematic study on the computation of network distances, which is the most funda-mental difference between a road network and a Euclidean space
Results 1 - 10 of 246