2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) (2010)
Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
Kyriakos Mouratidis , School of Information Systems, Singapore Management University, 80 Stamford Road, Singapore 178902
Yimin Lin , School of Information Systems, Singapore Management University, 80 Stamford Road, Singapore 178902
Man Lung Yiu , Department of Computing, Hong Kong Polytechnic University, Hung Hom, China
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.
K. Mouratidis, M. L. Yiu and Y. Lin, "Preference queries in large multi-cost transportation networks," 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)(ICDE), Long Beach, CA, USA, 2010, pp. 533-544.