Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, Jian Pei. Efficiently Computing Top-K Shortest Path Join. In Gustavo Alonso, Floris Geerts, Lucian Popa, Pablo Barceló, Jens Teubner, Martín Ugarte, Jan Van den Bussche, Jan Paredaens, editors, Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, Brussels, Belgium, March 23-27, 2015. pages 133-144, OpenProceedings.org, 2015. [doi]
@inproceedings{ChangLQYP15,
title = {Efficiently Computing Top-K Shortest Path Join},
author = {Lijun Chang and Xuemin Lin and Lu Qin and Jeffrey Xu Yu and Jian Pei},
year = {2015},
doi = {10.5441/002/edbt.2015.13},
url = {http://dx.doi.org/10.5441/002/edbt.2015.13},
researchr = {https://researchr.org/publication/ChangLQYP15},
cites = {0},
citedby = {0},
pages = {133-144},
booktitle = {Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, Brussels, Belgium, March 23-27, 2015},
editor = {Gustavo Alonso and Floris Geerts and Lucian Popa and Pablo Barceló and Jens Teubner and Martín Ugarte and Jan Van den Bussche and Jan Paredaens},
publisher = {OpenProceedings.org},
}