Abstract
In spatial databases search operations take an important role. These operations consist of the point query (find all objects that contain a given search point), the range query (find all objects that overlap a given search range) [GAE98] and the nearest neighbor query (find k objects (k >= 1) that are closest to a given object). They are very costly operations. Their performance is affected by both CPU-time and IO-cost. The long history of researches on spatial databases has resulted in many multidimensional access methods to efficiently support such operations. Each of them has strengths and deficiencies as well. This paper preliminary develops taxonomy for these multidimensional access methods and describes some prominent multidimensional access methods, which have been recently introduced as well as their comparative studies. Moreover, the important role of multidimensional access methods for supporting real-world applications in the next decade is also discussed.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 9th Interdisciplinary Information Management Talks - IDIMT 2001 |
| Publication status | Published - Sept 2001 |
Fields of science
- 102001 Artificial intelligence
- 102006 Computer supported cooperative work (CSCW)
- 102010 Database systems
- 102014 Information design
- 102015 Information systems
- 102016 IT security
- 102028 Knowledge engineering
- 102019 Machine learning
- 102022 Software development
- 102025 Distributed systems
- 502007 E-commerce
- 505002 Data protection
- 506002 E-government
- 509018 Knowledge management
- 202007 Computer integrated manufacturing (CIM)
- 102033 Data mining
- 102035 Data science
