Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27396
Title: Preference queries in large multi-cost transportation networks
Authors: Mouratidis, K
Lin, Y
Yiu, ML 
Keywords: Query processing
Road traffic
Traffic engineering computing
Visual databases
Issue Date: 2010
Publisher: IEEE
Source: 2010 IEEE 26th International Conference on Data Engineering (ICDE), 1-6 March 2010, Long Beach, CA, p. 533-544 How to cite?
Abstract: 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.
URI: http://hdl.handle.net/10397/27396
ISBN: 978-1-4244-5445-7
978-1-4244-5444-0 (E-ISBN)
DOI: 10.1109/ICDE.2010.5447851
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

7
Citations as of Apr 30, 2016

WEB OF SCIENCETM
Citations

6
Last Week
0
Last month
Citations as of Aug 14, 2017

Page view(s)

28
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.