Recent developments in linear quadtree-based geographic information systems
Image and Vision Computing
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Multidimensional access methods
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
ACM Computing Surveys (CSUR)
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient Bulk-Loading of Gridfiles
IEEE Transactions on Knowledge and Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
An Evaluation of Generic Bulk Loading Techniques
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Similarity Search in Feature Spaces with the Q-Tree
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
A Framework for Index Bulk Loading and Dynamization
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Shuttle Radar Topography Mission Overview
AIPR '00 Proceedings of the 29th Applied Imagery Pattern Recognition Workshop
Parallel bulk-loading of spatial data
Parallel Computing - Special issue: High performance computing with geographical data
Bulk Operations for Space-Partitioning Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Approximation algorithms for array partitioning problems
Journal of Algorithms
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
Hi-index | 0.00 |
Digital elevation models (DEMs) constitute a valuable source of data for a number of geoscience-related applications. The Shuttle Radar Topography Mission (SRTM) collected and made available to the public the world's largest DEM (composed of billions of points) until that date. The SRTM DEM is stored on the NASA repository as a well-organized collection of flat files. The retrieval of this stored topographic information about a region of interest involves one selection of a proper list of files, their downloading, data filtering in the desired region, and their processing according to user needs. With the aim to provide an easier and faster access to this data by improving its further analysis and processing, we have indexed the SRTM DEM by means of a spatial indexing based on the kd-tree data structure, called the Q-tree. This paper is the first in a two-part series that describes the method followed to build an index on such huge amounts of data, minimizing the number of insert operations. We demonstrate that our method can build a very efficient space-partitioning index, with good performance in both point and range queries on the spatial data. To the best of our knowledge, this is the only successful spatial indexing proposal in the literature that deals with such a huge volume of data.