A map has to be designed to show the directions and the objects present in a specific area. So, it is necessary to visit each and every points of that area. For that a Space Filling Curve can be used. SFC can visit all the points present in a multi-dimensional data base. A spatial query can select geographical features based on location or spatial relationship, and a Nearest Neighbor search can be used to find the
nearest object of a query object.
%0 Journal Article
%1 noauthororeditor
%A Panda, Swapna
%A Mishra, Sasmita
%A Mishra, Sarojananda
%D 2016
%J International Journal of Computer Science, Engineering and Information Technology (IJCSEIT)
%K Hilbert Space curves filling k-nearest neighbor query space spatial
%N 2
%P 01-09
%R 10.5121/ijcseit.2016.6201
%T STUDY AND ANALYSIS OF MULTIDIMENSIONAL HILBERT SPACE FILLING
CURVE AND ITS APPLICATIONS – A SURVEY
%U http://aircconline.com/ijcseit/V6N2/6216ijcseit01.pdf
%V 6
%X A map has to be designed to show the directions and the objects present in a specific area. So, it is necessary to visit each and every points of that area. For that a Space Filling Curve can be used. SFC can visit all the points present in a multi-dimensional data base. A spatial query can select geographical features based on location or spatial relationship, and a Nearest Neighbor search can be used to find the
nearest object of a query object.
@article{noauthororeditor,
abstract = {A map has to be designed to show the directions and the objects present in a specific area. So, it is necessary to visit each and every points of that area. For that a Space Filling Curve can be used. SFC can visit all the points present in a multi-dimensional data base. A spatial query can select geographical features based on location or spatial relationship, and a Nearest Neighbor search can be used to find the
nearest object of a query object. },
added-at = {2019-06-27T11:47:00.000+0200},
author = {Panda, Swapna and Mishra, Sasmita and Mishra, Sarojananda},
biburl = {https://www.bibsonomy.org/bibtex/23ff78473132ef983dc2a37d40982fc04/ijcseit},
doi = {10.5121/ijcseit.2016.6201},
interhash = {e67e50b7f062f99ec773e69476c1088c},
intrahash = {3ff78473132ef983dc2a37d40982fc04},
issn = {ISSN: 2231 - 3117 [Online] ; 2231 - 3605 [Print]},
journal = {International Journal of Computer Science, Engineering and Information Technology (IJCSEIT)},
keywords = {Hilbert Space curves filling k-nearest neighbor query space spatial},
language = {English},
month = apr,
number = 2,
pages = {01-09},
timestamp = {2019-06-27T11:47:00.000+0200},
title = {STUDY AND ANALYSIS OF MULTIDIMENSIONAL HILBERT SPACE FILLING
CURVE AND ITS APPLICATIONS – A SURVEY},
url = {http://aircconline.com/ijcseit/V6N2/6216ijcseit01.pdf},
volume = 6,
year = 2016
}