Optimal-Location-Selection Query Processing in Spatial Databases

This paper introduces and solves a novel type of spatial queries, namely, Optimal-Location-Selection (OLS) search, which has many applications in real life. Given a data object set D_A, a target object set D_B, a spatial region R, and a critical distance d_c in a multidimensional space, an OLS query...

Full description

Saved in:
Bibliographic Details
Main Authors: GAO, Yunjun, ZHENG, Baihua, CHEN, Gencai, LI, Qing
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2009
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/790
https://ink.library.smu.edu.sg/context/sis_research/article/1789/viewcontent/Optimal_Location_Selection_Query_Processing_in_Spatial_Databases_av.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-1789
record_format dspace
spelling sg-smu-ink.sis_research-17892020-01-14T01:29:52Z Optimal-Location-Selection Query Processing in Spatial Databases GAO, Yunjun ZHENG, Baihua CHEN, Gencai LI, Qing This paper introduces and solves a novel type of spatial queries, namely, Optimal-Location-Selection (OLS) search, which has many applications in real life. Given a data object set D_A, a target object set D_B, a spatial region R, and a critical distance d_c in a multidimensional space, an OLS query retrieves those target objects in D_B that are outside R but have maximal optimality. Here, the optimality of a target object b \in D_B located outside R is defined as the number of the data objects from D_A that are inside R and meanwhile have their distances to b not exceeding d_c. When there is a tie, the accumulated distance from the data objects to b serves as the tie breaker, and the one with smaller distance has the better optimality. In this paper, we present the optimality metric, formalize the OLS query, and propose several algorithms for processing OLS queries efficiently. A comprehensive experimental evaluation has been conducted using both real and synthetic data sets to demonstrate the efficiency and effectiveness of the proposed algorithms. 2009-08-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/790 info:doi/10.1109/TKDE.2009.81 https://ink.library.smu.edu.sg/context/sis_research/article/1789/viewcontent/Optimal_Location_Selection_Query_Processing_in_Spatial_Databases_av.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Query processing optimal-location-selection spatial database algorithm Databases and Information Systems Numerical Analysis and Scientific Computing
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Query processing
optimal-location-selection
spatial database
algorithm
Databases and Information Systems
Numerical Analysis and Scientific Computing
spellingShingle Query processing
optimal-location-selection
spatial database
algorithm
Databases and Information Systems
Numerical Analysis and Scientific Computing
GAO, Yunjun
ZHENG, Baihua
CHEN, Gencai
LI, Qing
Optimal-Location-Selection Query Processing in Spatial Databases
description This paper introduces and solves a novel type of spatial queries, namely, Optimal-Location-Selection (OLS) search, which has many applications in real life. Given a data object set D_A, a target object set D_B, a spatial region R, and a critical distance d_c in a multidimensional space, an OLS query retrieves those target objects in D_B that are outside R but have maximal optimality. Here, the optimality of a target object b \in D_B located outside R is defined as the number of the data objects from D_A that are inside R and meanwhile have their distances to b not exceeding d_c. When there is a tie, the accumulated distance from the data objects to b serves as the tie breaker, and the one with smaller distance has the better optimality. In this paper, we present the optimality metric, formalize the OLS query, and propose several algorithms for processing OLS queries efficiently. A comprehensive experimental evaluation has been conducted using both real and synthetic data sets to demonstrate the efficiency and effectiveness of the proposed algorithms.
format text
author GAO, Yunjun
ZHENG, Baihua
CHEN, Gencai
LI, Qing
author_facet GAO, Yunjun
ZHENG, Baihua
CHEN, Gencai
LI, Qing
author_sort GAO, Yunjun
title Optimal-Location-Selection Query Processing in Spatial Databases
title_short Optimal-Location-Selection Query Processing in Spatial Databases
title_full Optimal-Location-Selection Query Processing in Spatial Databases
title_fullStr Optimal-Location-Selection Query Processing in Spatial Databases
title_full_unstemmed Optimal-Location-Selection Query Processing in Spatial Databases
title_sort optimal-location-selection query processing in spatial databases
publisher Institutional Knowledge at Singapore Management University
publishDate 2009
url https://ink.library.smu.edu.sg/sis_research/790
https://ink.library.smu.edu.sg/context/sis_research/article/1789/viewcontent/Optimal_Location_Selection_Query_Processing_in_Spatial_Databases_av.pdf
_version_ 1770570715946287104