Multi-source skyline query processing in road networks

Deng, Ke, Zhou, Xiaofeng and Shen, Heng Tao (2007). Multi-source skyline query processing in road networks. In: R. Chirkova, A. Dogac, T. Ozsu and T. Sellis, Data Engineering 2007 (ICDE 2007). IEEE 23rd International Conference on Data Engineering 2007 (ICDE 2007), Istanbul, Turkey, (796-805). 16-20 April 2007. doi:10.1109/ICDE.2007.367925

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
MIC12UQ138335.pdf Full text - not publicly available application/pdf 225.15KB 1

Author Deng, Ke
Zhou, Xiaofeng
Shen, Heng Tao
Title of paper Multi-source skyline query processing in road networks
Conference name IEEE 23rd International Conference on Data Engineering 2007 (ICDE 2007)
Conference location Istanbul, Turkey
Conference dates 16-20 April 2007
Proceedings title Data Engineering 2007 (ICDE 2007)   Check publisher's open access policy
Journal name Proceedings - International Conference on Data Engineering   Check publisher's open access policy
Place of Publication Los Alamitos, CA, United States
Publisher IEEE Computer Society
Publication Year 2007
Sub-type Fully published paper
DOI 10.1109/ICDE.2007.367925
ISBN 1424408032
ISSN 1084-4627
Editor R. Chirkova
A. Dogac
T. Ozsu
T. Sellis
Start page 796
End page 805
Total pages 10
Collection year 2008
Language eng
Abstract/Summary Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a single-source skyline query is to find hotels which are cheap and close to the beach (an absolute query), or close to a user-given location (a relatively query). A multi-source skyline query considers several query points at the same time (e.g., to find hotels which are cheap and close to the University, the Botanic Garden and the China Town). In this paper, we consider the problem of efficient multi-source skyline query processing in road networks. It is not only the first effort to consider multi-source skyline query in road networks but also the first effort to process the relative skyline queries where the network distance between two locations needs to be computed on-the-fly. Three different query processing algorithms are proposed and evaluated in this paper. The Lower Bound Constraint algorithm (LBC) is proven to be an instance optimal algorithm. Extensive experiments using large real road network datasets demonstrate that LBC is four times more efficient than a straightforward algorithm.
Subjects 280103 Information Storage, Retrieval and Management
759999 Other social development and community services
Keyword Multisource skyline query processing
Network distance
Road networks
Q-Index Code E1
Q-Index Status Confirmed Code
Institutional Status UQ

Version Filter Type
Citation counts: Scopus Citation Count Cited 75 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 13 May 2008, 16:18:35 EST by Donna Clark on behalf of School of Information Technol and Elec Engineering