Materialization-based query processing algorithms on road networks

Ahreum Lee; Ahreum Kim; Jaewoo Chang

doi:10.1109/CIT.2008.4594658

Materialization-based query processing algorithms on road networks

Ahreum Lee^*
, Ahreum Kim
, Jaewoo Chang

^*Corresponding author for this work

Jeonbuk National University

Research output: Contribution to conference › Conference paper › peer-review

Abstract

In practice, objects, likes cars and people with mobile phones, can usually move on road networks. In this paper, we propose new materialization-based query processing algorithms for typical spatial queries in spatial network databases (SNDB), such as range search and k nearest neighbors (k-NN) search. Our query processing algorithms can reduce the computation time of network distance between a pair of nodes and the number of disk I/Os required for accessing nodes by using the shortest network distances of all the nodes on spatial networks. Thus, our query processing algorithms improve the existing efficient k-NN (INE) and range search (RNE) algorithms proposed by Papadias et al. [1]. It is shown that our range query processing algorithm achieves about up to one of magnitude better performance than the RNE and our k-NN query processing algorithm achieves about up to 150% performance improvements over INE.

Original language	English
Title of host publication	Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008
Pages	107-112
Number of pages	6
DOIs	https://doi.org/10.1109/CIT.2008.4594658
State	Published - 2008
Event	2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008 - Sydney, NSW, Australia Duration: 2008.07.8 → 2008.07.11

Publication series

Name	Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008

Conference

Conference	2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008
Country/Territory	Australia
City	Sydney, NSW
Period	08.07.8 → 08.07.11

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 11 Sustainable Cities and Communities

Quacquarelli Symonds(QS) Subject Topics

Computer Science & Information Systems
Data Science

Access to Document

10.1109/CIT.2008.4594658

Cite this

Lee, A., Kim, A., & Chang, J. (2008). Materialization-based query processing algorithms on road networks. In Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008 (pp. 107-112). Article 4594658 (Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008). https://doi.org/10.1109/CIT.2008.4594658

@inproceedings{742063bd76284ea9b5e67dce615c8e2d,

title = "Materialization-based query processing algorithms on road networks",

abstract = "In practice, objects, likes cars and people with mobile phones, can usually move on road networks. In this paper, we propose new materialization-based query processing algorithms for typical spatial queries in spatial network databases (SNDB), such as range search and k nearest neighbors (k-NN) search. Our query processing algorithms can reduce the computation time of network distance between a pair of nodes and the number of disk I/Os required for accessing nodes by using the shortest network distances of all the nodes on spatial networks. Thus, our query processing algorithms improve the existing efficient k-NN (INE) and range search (RNE) algorithms proposed by Papadias et al. [1]. It is shown that our range query processing algorithm achieves about up to one of magnitude better performance than the RNE and our k-NN query processing algorithm achieves about up to 150\% performance improvements over INE.",

author = "Ahreum Lee and Ahreum Kim and Jaewoo Chang",

year = "2008",

doi = "10.1109/CIT.2008.4594658",

language = "English",

isbn = "9781424423583",

series = "Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008",

pages = "107--112",

booktitle = "Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008",

note = "2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008 ; Conference date: 08-07-2008 Through 11-07-2008",

}

Lee, A, Kim, A & Chang, J 2008, Materialization-based query processing algorithms on road networks. in Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008., 4594658, Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008, pp. 107-112, 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008, Sydney, NSW, Australia, 08.07.8. https://doi.org/10.1109/CIT.2008.4594658

Materialization-based query processing algorithms on road networks. / Lee, Ahreum; Kim, Ahreum; Chang, Jaewoo.
Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008. 2008. p. 107-112 4594658 (Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008).

Research output: Contribution to conference › Conference paper › peer-review

TY - GEN

T1 - Materialization-based query processing algorithms on road networks

AU - Lee, Ahreum

AU - Kim, Ahreum

AU - Chang, Jaewoo

PY - 2008

Y1 - 2008

N2 - In practice, objects, likes cars and people with mobile phones, can usually move on road networks. In this paper, we propose new materialization-based query processing algorithms for typical spatial queries in spatial network databases (SNDB), such as range search and k nearest neighbors (k-NN) search. Our query processing algorithms can reduce the computation time of network distance between a pair of nodes and the number of disk I/Os required for accessing nodes by using the shortest network distances of all the nodes on spatial networks. Thus, our query processing algorithms improve the existing efficient k-NN (INE) and range search (RNE) algorithms proposed by Papadias et al. [1]. It is shown that our range query processing algorithm achieves about up to one of magnitude better performance than the RNE and our k-NN query processing algorithm achieves about up to 150% performance improvements over INE.

AB - In practice, objects, likes cars and people with mobile phones, can usually move on road networks. In this paper, we propose new materialization-based query processing algorithms for typical spatial queries in spatial network databases (SNDB), such as range search and k nearest neighbors (k-NN) search. Our query processing algorithms can reduce the computation time of network distance between a pair of nodes and the number of disk I/Os required for accessing nodes by using the shortest network distances of all the nodes on spatial networks. Thus, our query processing algorithms improve the existing efficient k-NN (INE) and range search (RNE) algorithms proposed by Papadias et al. [1]. It is shown that our range query processing algorithm achieves about up to one of magnitude better performance than the RNE and our k-NN query processing algorithm achieves about up to 150% performance improvements over INE.

UR - https://www.scopus.com/pages/publications/51849165037

U2 - 10.1109/CIT.2008.4594658

DO - 10.1109/CIT.2008.4594658

M3 - Conference paper

AN - SCOPUS:51849165037

SN - 9781424423583

T3 - Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008

SP - 107

EP - 112

BT - Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008

T2 - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008

Y2 - 8 July 2008 through 11 July 2008

ER -

Materialization-based query processing algorithms on road networks

Abstract

Publication series

Conference

UN SDGs

Quacquarelli Symonds(QS) Subject Topics

Access to Document

Other files and links

Fingerprint

Cite this