A survey of skyline query processing

C Kalyvas, T Tzouramanis - arxiv preprint arxiv:1704.01788, 2017 - arxiv.org
Living in the Information Age allows almost everyone have access to a large amount of
information and options to choose from in order to fulfill their needs. In many cases, the …

Personalized route recommendation using big trajectory data

J Dai, B Yang, C Guo, Z Ding - 2015 IEEE 31st international …, 2015 - ieeexplore.ieee.org
When planning routes, drivers usually consider a multitude of different travel costs, eg,
distances, travel times, and fuel consumption. Different drivers may choose different routes …

Towards mobility data science (vision paper)

M Mokbel, M Sakr, L **ong, A Züfle, J Almeida… - arxiv preprint arxiv …, 2023 - arxiv.org
Mobility data captures the locations of moving objects such as humans, animals, and cars.
With the availability of GPS-equipped mobile devices and other inexpensive location …

MWCRSF: Mobility-based weighted cluster routing scheme for FANETs

AM Khedr, A Salim, PR PV, W Osamy - Vehicular Communications, 2023 - Elsevier
Abstract Flying Ad-Hoc Network (FANET) formed by a swarm of Unmanned Aerial Vehicles
(UAVs) is currently a trending research topic because of its capability in performing complex …

Urban navigation beyond shortest route: The case of safe paths

E Galbrun, K Pelechrinis, E Terzi - Information Systems, 2016 - Elsevier
Advancements in mobile technology and computing have fostered the collection of a large
number of civic datasets that capture the pulse of urban life. Furthermore, the open …

Stochastic skyline route planning under time-varying uncertainty

B Yang, C Guo, CS Jensen, M Kaul… - 2014 IEEE 30th …, 2014 - ieeexplore.ieee.org
Different uses of a road network call for the consideration of different travel costs: in route
planning, travel time and distance are typically considered, and green house gas (GHG) …

Finding k-shortest paths with limited overlap

T Chondrogiannis, P Bouros, J Gamper, U Leser… - The VLDB Journal, 2020 - Springer
In this paper, we investigate the computation of alternative paths between two locations in a
road network. More specifically, we study the k-shortest paths with limited overlap (k SPwLO …

Efficient and privacy-preserving multi-party skyline queries over encrypted data

X Ding, Z Wang, P Zhou, KKR Choo… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
One existing challenge associated with large scale skyline queries on cloud services,
particularly when dealing with private information such as biomedical data, is supporting …

Toward personalized, context-aware routing

B Yang, C Guo, Y Ma, CS Jensen - The VLDB Journal, 2015 - Springer
A driver's choice of a route to a destination may depend on the route's length and travel time,
but a multitude of other, possibly hard-to-formalize aspects, may also factor into the driver's …

FHL-cube: multi-constraint shortest path querying with flexible combination of constraints

Z Liu, L Li, M Zhang, W Hua, X Zhou - Proceedings of the VLDB …, 2022 - dl.acm.org
Multi-Constraint Shortest Path (MCSP) generalizes the classic shortest path from single to
multiple criteria such that more personalized needs can be satisfied. However, MCSP query …