Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Databases and Information Systems
Efficient Collective Spatial Keyword Query Processing On Road Networks, Yunjun Gao, Jingwen Zhao, Baihua Zheng, Gang Chen
Efficient Collective Spatial Keyword Query Processing On Road Networks, Yunjun Gao, Jingwen Zhao, Baihua Zheng, Gang Chen
Research Collection School Of Computing and Information Systems
The collective spatial keyword query (CSKQ), an important variant of spatial keyword queries, aims to find a set of the objects that collectively cover users' queried keywords, and those objects are close to the query location and have small inter-object distances. Existing works only focus on the CSKQ problem in the Euclidean space, although we observe that, in many real-life applications, the closeness of two spatial objects is measured by their road network distance. Thus, existing methods cannot solve the problem of network-based CSKQ efficiently. In this paper, we study the problem of collective spatial keyword query processing on road …
An Air Index For Spatial Query Processing In Road Networks, Weiwei Sun, Chunan Chen, Baihua Zheng, Chong Chen, Peng Liu
An Air Index For Spatial Query Processing In Road Networks, Weiwei Sun, Chunan Chen, Baihua Zheng, Chong Chen, Peng Liu
Research Collection School Of Computing and Information Systems
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 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 network into a number of regions and then …
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Kyriakos MOURATIDIS
In this paper, we consider a new problem in the context of road network databases, named Resource Constrained Best Upgrade Plan computation (BUP, for short). Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. Given a source and a destination in G, and a budget (resource constraint) B, the BUP problem is to identify which upgradable edges should be upgraded so that the shortest path distance between source and …
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
In this paper, we consider a new problem in the context of road network databases, named Resource Constrained Best Upgrade Plan computation (BUP, for short). Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. Given a source and a destination in G, and a budget (resource constraint) B, the BUP problem is to identify which upgradable edges should be upgraded so that the shortest path distance between source and …