article · 2003
Spatial query processing for sketch-based query using heuristics
Cited by 2Abstract and details only
Abstract
Sketching the spatial query is one of the leading spatial database query methods (Blaser (2000)) for searching similar configurations. However, when the sketched spatial scene is processed with ordinary query processing methods, it does not achieve the efficiency that is desired especially dealing with large datasets (N>1000). Therefore indexing and heuristics are proposed to be able to help in reducing the search space and enhance the search performance (Papadias and Mamoulis (1999)) for configuration similarity. The most prominent indexing method of spatial objects is the R-tree. With the indexed spatial objects, then heuristics can be applied to improve the searching efficiency i.e. reduce the searching cost and increase the number of solutions to the query. This paper aims to discuss the generic R-tree model, then discusses the heuristics that can be applied to utilize the data structure in the searching of configuration similarity in spatial query by sketch.
Cite this paper
Theng, L. B., & Chai, W. Y. (2003). Spatial query processing for sketch-based query using heuristics. https://doi.org/10.1109/icosp.2002.1179986
Theng, Lau Bee, and Wang Yin Chai. “Spatial query processing for sketch-based query using heuristics.” vol. 2, 2003, pp. 1120–23, https://doi.org/10.1109/icosp.2002.1179986.
Theng, Lau Bee, and Wang Yin Chai. 2003. “Spatial query processing for sketch-based query using heuristics.” https://doi.org/10.1109/icosp.2002.1179986.
Theng, L.B. and Chai, W.Y. (2003) ‘Spatial query processing for sketch-based query using heuristics’. Available at: https://doi.org/10.1109/icosp.2002.1179986.
@article{theng2003spatial,
title = {{Spatial query processing for sketch-based query using heuristics}},
author = {Theng, Lau Bee and Chai, Wang Yin},
volume = {2},
pages = {1120--1123},
year = {2003},
doi = {10.1109/icosp.2002.1179986}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
A solution of spatial query processing and query optimization for spatial databases
Yuan-jie, XIEKun-qing, MAXiu-jun et al. · 2004
Cited by 0
Scalable and efficient processing of top-k multiple-type integrated queries
Hyuk-Yoon Kwon, Kyu-Young Whang · World Wide Web · 2015
Cited by 4
Spatial View Materialization Technique by using R - Tree Reconstruction
Bo-Heung Jeong, Hae-Yeong Bae · KIPS Transactions on Computer and Communication Systems · 2001
Cited by 0
RETRACTED: Spatial Data Indexing and Query Processing in GeoCloud
Karthi Shankar, S. Prabu · Journal of Testing and Evaluation · 2019
Cited by 4Retracted
An Efficient Secondary Index for Spatial Data Based on LevelDB
Rui Xu, Zihao Liu, Huiqi Hu et al. · Lecture notes in computer science · 2020
Cited by 8
RESEARCH AND IMPLEMENTATION OF SPATIAL DATA INDEX OF THE GIS
Hong Zhi-quan · Computing Techniques for Geophysical and Geochemical Exploration · 2005
Cited by 0
Efficient query processing on large spatial databases: A performance study
George Roumelis, Michael Gr. Vassilakopoulos, Antonio Corral et al. · Journal of Systems and Software · 2017
Cited by 23Open access
SparkSQL+: Next-generation Query Planning over Spark
Binyang Dai, Qichen Wang, Ke Yi · ACM SIGMOD International Conference on Management of Data (SIGMOD) · 2023
Cited by 8Open access