ACM Home Page
Please provide us with feedback. Feedback
Multidimensional access methods
Full text PdfPdf (1.05 MB)
Source ACM Computing Surveys (CSUR) archive
Volume 30 ,  Issue 2  (June 1998) table of contents
Pages: 170 - 231  
Year of Publication: 1998
ISSN:0360-0300
Authors
Volker Gaede  Imperial College, London, UK
Oliver Günther  Humboldt-Univ. zu Berlin, Berlin, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 73,   Downloads (12 Months): 556,   Citation Count: 270
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/280277.280279
What is a DOI?

ABSTRACT

Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects that overlap a given search region). More than ten years of spatial database research have resulted in a great variety of multidimensional access methods to support such operations. We give an overview of that work. After a brief survey of spatial data management in general, we first present the class of point access methods, which are used to search sets of points in two or more dimensions. The second part of the paper is devoted to spatial access methods to handle extended objects, such as rectangles or polyhedra. We conclude with a discussion of theoretical and experimental results concerning the relative performance of various approaches.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ABEL, D. J. AND MARK, D.M. 1990. A comparative analysis of some two-dimensional orderings. Int. J. Geograph. Inf. Syst. 4, 1, 21-31.
 
2
ABEL, D. J. AND SMITH, J.L. 1983. A data structure and algorithm based on a linear key for a rectangle retrieval problem. Comput. Vis. 24, 1-13.
 
3
 
4
AREF, W. G. AND SAMET, H. 1994. The spatial filter revisited. In Proceedings of the Sixth International Symposium on Spatial Data Handling, 190-208.
 
5
BAYER, R. 1996. The universal B-tree for multidimensional indexing. Tech. Rep. I9639, Technische Universit~it Mfinchen, Munich, Germany. http://www.leo.org/pub/comp/doc/ techre po rts/tu m/info rm a tik/re port/ 1996/TUM- I9639.ps.gz.
 
6
BAYER, R. AND MCCREIGHT, E.M. 1972. Organization and maintenance of large ordered indices. Acta Inf. 1, 3, 173-189.
 
7
BAYER, R. AND SCHKOLNICK, M. 1977. Concurrency of operations on B-trees. Acta Inf. 9, 1-21.
 
8
 
9
BECKER, L. 1992. A new algorithm and a cost model for join processing with the grid file. Ph.D. thesis, Universit~it-Gesamthochschule Siegen, Germany.
10
 
11
12
 
13
BENTLEY, J. L. 1979. Multidimensional binary search in database applications. IEEE Trans. Softw. Eng. 4, 5, 333-340.
14
 
15
 
16
 
17
BRINKHOFF, T. 1994. Der spatial join in geodatenbanksystemen. Ph.D. Thesis, Ludwig- Maximilians-Universit~it Mfinchen. Germany (in German).
 
18
 
19
20
21
22
23
 
24
BURKHARD, W.A. 1983. Interpolation-based index maintenance. BIT 23, 274-294.
 
25
26
 
27
 
28
 
29
EGENHOFER, M. 1989. Spatial query languages. Ph.D. Thesis, University of Maine, Orono, ME.
 
30
 
31
EVANGELIDIS, G. 1994. The hBn-tree: A concurrent and recoverable multi-attribute index structure. Ph.D. Thesis, Northeastern University, Boston, MA.
 
32
33
34
 
35
 
36
37
 
38
39
40
 
41
FINKEL, R. AND BENTLEY, J. L. 1974. Quad trees: A data structure for retrieval of composite keys. Acta Inf. 4, 1, 1-9.
 
42
FLAJOLET, P. 1983. On the performance evaluation of extendible hashing and trie searching. Acta Inf. 20, 345-369.
 
43
44
 
45
 
46
47
 
48
49
50
 
51
GAEDE, V. 1995a. Geometric information makes spatial query processing more efficient. In Proceedings of the Third ACM International Workshop on Advances in Geographic Information Systems (ACM-GIS'95) (Baltimore, MD) 45-52.
 
52
 
53
GAEDE, V. AND RIEKERT, W.-F. 1994. Spatial access methods and query processing in the object-oriented GIS GODOT. In Proceedings of the AGDM'94 Workshop (Delft, The Netherlands), Netherlands Geodetic Commission, 40-52.
 
54
55
 
56
 
57
 
58
 
59
GUNTHER, O. 1991. Evaluation of spatial access methods with oversize shelves. In Geographic Database Management Systems, G. Gambosi, M. Scholl, and H.-W. Six, Eds., Springer-Verlag, Berlin/Heidelberg/New York, 177-193.
 
60
 
61
62
 
63
GUNTHER, O. AND GAEDE, V. 1997. Oversize shelves: A storage management technique for large spatial data objects. Int. J. Geog. Inf. Syst. 11, 1, 5-32.
 
64
 
65
 
66
 
67
 
68
69
 
70
HELLERSTEIN, J. M., KOUTSOUPIAS, E., AND PAPAD- IMITRIOU, C.H. 1997. Towards a theory of indexability. In Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.
 
71
 
72
HENRICH, A. 1995. Adapting the transformation technique to maintain multidimensional nonpoint objects in k-d-tree based access structures. In Proceedings of the Third ACM International Workshop on Advances in Geographic Information Systems (ACM-GIS'95) (Baltimore, MD) ACM Press, New York.
 
73
 
74
HENRICH, A. AND SIX, H.-W. 1991. How to split buckets in spatial data structures. In Geographic Database Management Systems, G. Gambosi, M. Scholl, and H.-W. Six, Eds., Springer-Verlag, Berlin/Heidelberg/New York, 212-244.
 
75
 
76
77
 
78
 
79
80
 
81
 
82
HUTFLESZ, A., WIDMAYER, P., AND ZIMMERMANN, C. 1991. Global order makes spatial access faster. In Geographic Database Management Systems, G. Gambosi, M. Scholl, and H.-W. Six, Eds., Springer-Verlag, Berlin/Heidelberg/ New York, 161-176.
 
83
INFORMIX INC. 1997. The DataBlade architecture. URL http://www.informix.com.
84
 
85
 
86
87
88
 
89
 
90
KAMEL, I., KHALIL, M., AND KOURAMAJIAN, V. 1996. Bulk insertion in dynamic R-trees. In Proceedings of the Seventh International Symposium on Spatial Data Handling (Delft, The Netherlands), 3B.31-3B.42.
91
 
92
93
 
94
KLINGER, A. 1971. Pattern and search statistics. In Optimizing Methods in Statistics, S. Rustagi, Ed., 303-337.
 
95
KNOTT, G. 1975. Hashing functions. Comput. J. 18, 3, 265-278.
 
96
97
98
 
99
KRIEGEL, H.-P., HELP, P., HELP, S., SCHIWIETZ, M., AND SCHNEIDER, R. 1991. An access method based query processor for spatial database systems. In Geographic Database Management Systems, G. Gambosi, M. Scholl, and H.-W. Six, Eds., Springer-Verlag, Berlin/Heidelberg/New York, 273-292.
 
100
 
101
 
102
 
103
 
104
 
105
 
106
 
107
 
108
LARSON, P.A. 1980. Linear hashing with partial expansions. In Proceedings of the Sixth International Conference on Very Large Data Bases, 224-232.
109
 
110
 
111
LITWIN, W. 1980. Linear hashing: A new tool for file and table addressing. In Proceedings of the Sixth International Conference on Very Large Data Bases, 212-223.
112
113
 
114
 
115
116
117
 
118
Lu, H. AND OoI, B.-C. 1993. Spatial indexing: Past and future. IEEE Data Eng. Bull. 16, 3, 16-21.
 
119
MATSUYAMA, T., HAO, L. V., AND NAGAO, M. 1984. A file organization for geographic information systems based on spatial proximity. Int. J. Comput. Vis. Graph. Image Process. 26, 3, 303-318.
 
120
MORTON, G. 1966. A computer oriented geodetic data base and a new technique in file sequencing. IBM Ltd.
121
 
122
NEWELL, R. G. AND DOE, M. 1997. Discrete geometry with seamless topology in a GIS. URL http://www.smallworld-us.com.
 
123
 
124
 
125
 
126
 
127
NIEVERGELT, g. AND HINRICHS, K. 1987. Storage and access structures for geometric data bases. In Proceedings of the International Conference on Foundations of Data Organization, S. Ghosh, Y. Kambayashi, and K. Tanaka, Eds., Plenum, New York.
 
128
129
 
130
OHSAWA, Y. AND SAKAUCHI, M. 1983. BD-tree: A new n-dimensional data structure with efficient dynamic characteristics. In Proceedings of the Ninth World Computer Congress, IFIP 1983, 539-544.
 
131
 
132
 
133
OoI, B. C., MCDONELL, K. J., AND SACKS-DAVIS, R. 1987. Spatial kd-tree: An indexing mechanism for spatial databases. In Proceedings of the IEEE Computer Software and Applications Conference, 433-438.
 
134
 
135
OOSTEROM, P. 1990. Reactive data structures for geographic information systems. Ph.D. Thesis, University of Leiden, The Netherlands.
 
136
ORACLE INC. 1995. Oracle 7 multidimension: Advances in relational database technology for spatial data management. White paper.
 
137
ORENSTEIN, J. 1982. Multidimensional tries used for associative searching. Inf. Process. Lett. 14, 4, 150-157.
 
138
139
 
140
141
142
143
 
144
 
145
OTOO, E. J. 1985. Symmetric dynamic index maintenance scheme. In Proceedings of the International Conference on Foundations of Data Organization, Plenum, New York, 283- 296.{
146
147
148
 
149
 
150
 
151
152
153
154
 
155
 
156
PELOUX, J., REYNAL, G., AND SCHOLL, M. 1994. Evaluation of spatial indices implemented with the 02 DBMS. Ingdni~rie des Syst~mes d'Information 6.
 
157
 
158
159
 
160
 
161
ROUSSOPOULOS, N. AND LEIFKER, D. 1984. An introduction to PSQL: A pictorial structured query language. In Proceedings of the IEEE Workshop on Visual Languages.
162
 
163
SAGAN, H. 1994. Space-Filling Curves. Springer-Verlag, Berlin/Heidelberg/New York.
164
165
 
166
 
167
168
 
169
SCHIWIETZ, M. 1993. Speicherung und anfragebearbeitung komplexer geo-objekte. Ph.D. Thesis, Ludwig-Maximilians-Universit~it Mtinchen, Germany (in German).
 
170
 
171
 
172
 
173
 
174
 
175
 
176
 
177
 
178
 
179
SIEMENS NIXDORF INFORMATIONSSYSTEME AG 1997. URL http://www.sni.de.
 
180
 
181
 
182
SMITH, T. R. AND GAO, P. 1990. Experimental performance evaluations on spatial access methods. In Proceedings of the Fourth International Symposium on Spatial Data Handling (Zfirich), 991-1002.
 
183
 
184
STONEBRAKER, M., SELLIS, T., AND HANSON, E. 1986. An analysis of rule indexing implementations in data base systems. In Proceedings of the First International Conference on Expert Data Base Systems.
 
185
STUCKEY, P. 1997. Constraint search trees. In Proceedings of the International Conference on Logic Programming (CLP'97), L. Naish, Ed., MIT Press, Cambridge, MA.
 
186
 
187
TAMMINEN, M. 1982. The extendible cell method for closest point problems. BIT 22, 27-41.
 
188
TAMMINEN, M. 1983. Performance analysis of cell based geometric file organisations. Int. J. Cutup. Vis. Graph. Image Process. 24, 160- 181.
189
190
 
191
TROPF, H. AND HERZOG, H. 1981. Multidimensional range search in dynamically balanced trees. Angewandte Informatik 2, 71-77.
 
192
WHANG, K.-Y. AND KRISHNAMURTHY, R. 1985. Multilevel grid files. IBM Research Laboratory, Yorktown Heights, NY.
 
193
WHITE, M. 1981. N-trees: Large ordered indexes for multi-dimensional space. Tech. Rep., Application Mathematics Research Staff, Statistical Research Division, US Bureau of the Census.
 
194
WIDMAYER, P. 1991. Datenstrukturen ffir Geodatenbanken. In Entwicklungstendenzen bei Datenbank-Systemen, G. Vossen and K.-U. Witt, Eds., Oldenbourg-Verlag, Munich, Chapter 9, 317-361 (in German).

CITED BY  270

Collaborative Colleagues:
Volker Gaede: colleagues
Oliver Günther: colleagues