Abstract
Based on the fundamental regular grid spatial index, the paper analyzes its advantages and disadvantages, discusses the principles of algorithm improvement based on grid partition, and designs the steps of implementation for each searching algorithm for regional query applications. The time and space complexity of these algorithm improvements are analyzed, and their advantages and disadvantages are presented. Based on practical map data, these searching algorithms are programmed. Experimental results show that in region query, theory analyses accords with practical applications, and time complexity of every algorithm improvement does not exceed CKAO.
| Original language | English |
|---|---|
| Pages (from-to) | 140-144 |
| Number of pages | 5 |
| Journal | Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology |
| Volume | 24 |
| Issue number | 2 |
| Publication status | Published - Feb 2004 |
Keywords
- Complexity
- Geographic information system (GIS)
- Spatial index