Preference queries in large multi-cost transportation networks

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 533-544

  Mouratidis, Kyriakos ^a   Lin, Yimin ^a   Yiu, Man Lung ^b  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

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;

MOTOR TRANSPORTATION; ROADS AND STREETS;

COSTS;

EID: 77952758249     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447851     Document Type: Conference Paper

References (31)

1. D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query processing in spatial network databases," in VLDB, 2003, pp. 802-813.
2. M. L. Yiu and N. Mamoulis, "Clustering objects on a spatial network," in SIGMOD, 2004, pp. 443-454.
3. S. Börzsönyi, D. Kossmann, and K. Stocker, "The skyline operator," in ICDE, 2001, pp. 421-430.
4. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," J. Comput. Syst. Sci., vol. 66, no. 4, pp. 614-656, 2003.
5. K.-L. Tan, P.-K. Eng, and B. C. Ooi, "Efficient progressive skyline computation," in VLDB, 2001, pp. 301-310.
6. J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, "Skyline with presorting: Theory and optimizations," in IIS, 2005, pp. 595-604.
7. P. Godfrey, R. Shipley, and J. Gryz, "Maximal vector computation in large data sets," in VLDB, 2005, pp. 229-240.
8. I. Bartolini, P. Ciaccia, and M. Patella, "Efficient sort-based skyline evaluation," ACM Trans. Database Syst., vol. 33, no. 4, pp. 1-49, 2008.
9. D. Kossmann, F. Ramsak, and S. Rost, "Shooting stars in the sky: An online algorithm for skyline queries," in VLDB, 2002, pp. 275-286.
10. D. Papadias, Y. Tao, G. Fu, and B. Seeger, "Progressive skyline computation in database systems," ACM Trans. Database Syst., vol. 30, no. 1, pp. 41-82, 2005.
11. A. Guttman, "R-trees: A dynamic index structure for spatial searching," in SIGMOD, 1984, pp. 47-57.
12. W.-T. Balke, U. Güntzer, and J. X. Zheng, "Efficient distributed skylining for web information systems," in EDBT, 2004, pp. 256-273.
13. Y. Tao, V. Hristidis, D. Papadias, and Y. Papakonstantinou, "Branch-and-bound processing of ranked queries," Information Systems, vol. 32, no. 3, pp. 424-445, 2007.
14. E. W. Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
15. P. Hart, N. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100-107, 1968.
16. H.-P. Kriegel, P. Kröger, M. Renz, and T. Schmidt, "Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks," in SSDBM, 2008, pp. 150-167.
17. S. Jung and S. Pramanik, "An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps," IEEE TKDE, vol. 14, no. 5, pp. 1029-1046, 2002.
18. H. Samet, J. Sankaranarayanan, and H. Alborzi, "Scalable Network Distance Browsing in Spatial Databases," in SIGMOD, 2008, pp. 43-54.
19. H. Hu, D. L. Lee, and V. C. S. Lee, "Distance Indexing on Road Networks," in VLDB, 2006, pp. 894-905.
20. K. Deng, X. Zhou, and H. T. Shen, "Multi-source skyline query processing in road networks," in ICDE, 2007, pp. 796-805.
21. M. Sharifzadeh and C. Shahabi, "The spatial skyline queries," in VLDB, 2006, pp. 751-762.
22. P. Hansen, "Bicriterion path problems," in Multiple criteria decision making: theory and applications. Lecture notes in Economics and Mathematical Systems, 1980, pp. 109-127.
23. E. Q. V. Martins, "On a multicriteria shortest path problem," European Journal of Operational Research, vol. 16, no. 2, pp. 236-245, 1984.
24. A. J. V. Skriver and K. A. Andersen, "A label correcting approach for solving bicriterion shortest-path problems," Computers & OR, vol. 27, no. 6, pp. 507-524, 2000.
25. M. I. Henig, "The shortest path problem with two objective functions," European Journal of Operational Research, vol. 25, no. 2, pp. 281-291, 1986.
26. J. Brumbaugh-Smith and D. Shier, "An empirical investigation of some bicriterion shortest path algorithms," European Journal of Operational Research, vol. 43, no. 2, pp. 216-224, 1989.
27. B. S. Stewart and C. C. White, III, "Multiobjective a*," J. ACM, vol. 38, no. 4, pp. 775-814, 1991.
28. L. Mandow and J.-L. P. de-la Cruz, "A new approach to multiobjective a* search," in IJCAI, 2005, pp. 218-223.
29. T. Brinkhoff, "A framework for generating network-based moving objects," GeoInformatica, vol. 6, no. 2, pp. 153-180, 2002.
30. E. Kanoulas, Y. Du, T. Xia, and D. Zhang, "Finding fastest paths on a road network with speed patterns," in ICDE, 2006, p. 10.
31. B. Ding, J. X. Yu, and L. Qin, "Finding time-dependent shortest paths over large graphs," in EDBT, 2008, pp. 205-216.