DocumentCode :
3411413
Title :
Performace evaluation of furthest k neighbors queries in spatial databases
Author :
Hasan, Mohammed ; Alam, Mohammad Rafiqul ; Cheema, Muhammad Aamir
Author_Institution :
Dept. of Comput. Sci. & Eng., Indep. Univ., Dhaka, Bangladesh
fYear :
2013
fDate :
19-21 Dec. 2013
Firstpage :
23
Lastpage :
28
Abstract :
In this paper we have studied the performance of furthest k neighbors queries for continuous datasets. We compare our proposed efficient grid based algorithm with conceptual partitioning method the only method that can be used to compute furthest neighbor query. Experiments on the real datasets confirm the efficiency and scalability of our proposed algorithm.
Keywords :
data analysis; query processing; visual databases; conceptual partitioning method; continuous datasets; furthest k neighbors queries; grid based algorithm; performance evaluation; real datasets; spatial databases; Algorithm design and analysis; Cities and towns; Data structures; Monitoring; Nearest neighbor searches; Partitioning algorithms; Spatial databases; continuous monitoring; furthest k neighbors; furthest neighbor query; spatial database;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advances in Electrical Engineering (ICAEE), 2013 International Conference on
Conference_Location :
Dhaka
Print_ISBN :
978-1-4799-2463-9
Type :
conf
DOI :
10.1109/ICAEE.2013.6750298
Filename :
6750298
Link To Document :
بازگشت