Preference Queries in Large Multi-Cost Transportation Networks

Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, however, there may exist multiple cost types involved in transportation decision making. For example, the different costs of...

Full description

Saved in:
Bibliographic Details
Main Authors: MOURATIDIS, Kyriakos, LIN, Yimin, YIU, Man Lung
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2010
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/506
https://ink.library.smu.edu.sg/context/sis_research/article/1505/viewcontent/ICDE10_full_MCN.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-1505
record_format dspace
spelling sg-smu-ink.sis_research-15052016-05-03T03:01:43Z Preference Queries in Large Multi-Cost Transportation Networks MOURATIDIS, Kyriakos LIN, Yimin YIU, Man Lung Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, however, there may exist multiple cost types involved in transportation decision making. For example, the different costs of a road segment could be its Euclidean length, the driving time, the walking time, possible toll fee, etc. The relative significance of these cost types may vary from user to user. In this paper we consider such multi-cost transportation networks (MCN), where each edge (road segment) is associated with multiple cost values. We formulate skyline and top-k queries in MCNs and design algorithms for their efficient processing. Our solutions have two important properties in preference-based querying; the skyline methods are progressive and the top-k ones are incremental. The performance of our techniques is evaluated with experiments on a real road network. 2010-03-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/506 info:doi/10.1109/ICDE.2010.5447851 https://ink.library.smu.edu.sg/context/sis_research/article/1505/viewcontent/ICDE10_full_MCN.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Cost values Euclidean Preference queries Preference-based Real road networks Real world situations Road segments Spatial network database Top-k query Transportation decision making Transportation network Databases and Information Systems Numerical Analysis and Scientific Computing
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Cost values
Euclidean
Preference queries
Preference-based
Real road networks
Real world situations
Road segments
Spatial network database
Top-k query
Transportation decision making
Transportation network
Databases and Information Systems
Numerical Analysis and Scientific Computing
spellingShingle Cost values
Euclidean
Preference queries
Preference-based
Real road networks
Real world situations
Road segments
Spatial network database
Top-k query
Transportation decision making
Transportation network
Databases and Information Systems
Numerical Analysis and Scientific Computing
MOURATIDIS, Kyriakos
LIN, Yimin
YIU, Man Lung
Preference Queries in Large Multi-Cost Transportation Networks
description Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, however, there may exist multiple cost types involved in transportation decision making. For example, the different costs of a road segment could be its Euclidean length, the driving time, the walking time, possible toll fee, etc. The relative significance of these cost types may vary from user to user. In this paper we consider such multi-cost transportation networks (MCN), where each edge (road segment) is associated with multiple cost values. We formulate skyline and top-k queries in MCNs and design algorithms for their efficient processing. Our solutions have two important properties in preference-based querying; the skyline methods are progressive and the top-k ones are incremental. The performance of our techniques is evaluated with experiments on a real road network.
format text
author MOURATIDIS, Kyriakos
LIN, Yimin
YIU, Man Lung
author_facet MOURATIDIS, Kyriakos
LIN, Yimin
YIU, Man Lung
author_sort MOURATIDIS, Kyriakos
title Preference Queries in Large Multi-Cost Transportation Networks
title_short Preference Queries in Large Multi-Cost Transportation Networks
title_full Preference Queries in Large Multi-Cost Transportation Networks
title_fullStr Preference Queries in Large Multi-Cost Transportation Networks
title_full_unstemmed Preference Queries in Large Multi-Cost Transportation Networks
title_sort preference queries in large multi-cost transportation networks
publisher Institutional Knowledge at Singapore Management University
publishDate 2010
url https://ink.library.smu.edu.sg/sis_research/506
https://ink.library.smu.edu.sg/context/sis_research/article/1505/viewcontent/ICDE10_full_MCN.pdf
_version_ 1770570444800262144