-
1
-
-
0036026076
-
BoxTrees and R-trees with near-optimal query time
-
AGARWAL, P. K., DE BERG, M., GUDMUNDSSON, J., HAMMAR, M., AND HAVERKORT, H. J. 2002. BoxTrees and R-trees with near-optimal query time. Discr. Comput. Geom. 28, 3, 291-312.
-
(2002)
Discr. Comput. Geom
, vol.28
, Issue.3
, pp. 291-312
-
-
AGARWAL, P.K.1
DE BERG, M.2
GUDMUNDSSON, J.3
HAMMAR, M.4
HAVERKORT, H.J.5
-
2
-
-
79951550660
-
A framework for index bulk loading and dynamlzation
-
AGARWAL, P. K., ARGE, L., PROCOPIUC, O., AND VITTER, J. S. 2001. A framework for index bulk loading and dynamlzation. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), 115-127.
-
(2001)
Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP)
, pp. 115-127
-
-
AGARWAL, P.K.1
ARGE, L.2
PROCOPIUC, O.3
VITTER, J.S.4
-
3
-
-
4344672356
-
I/O-Efficient dynamic planar point location
-
ARGE, L., AND VAHRENHOLD, J. 2004. I/O-Efficient dynamic planar point location. Comput. Geom. Theory Appl. 29, 2, 147-162.
-
(2004)
Comput. Geom. Theory Appl
, vol.29
, Issue.2
, pp. 147-162
-
-
ARGE, L.1
VAHRENHOLD, J.2
-
4
-
-
0141686142
-
Efficient bulk operations on dynamic R-trees
-
ARGE, L., HINRICHS, K. H., VAHRENHOLD, J., AND VITTER, J. S. 2002a. Efficient bulk operations on dynamic R-trees. Algorithmica 33, 1, 104-128.
-
(2002)
Algorithmica
, vol.33
, Issue.1
, pp. 104-128
-
-
ARGE, L.1
HINRICHS, K.H.2
VAHRENHOLD, J.3
VITTER, J.S.4
-
5
-
-
84938098892
-
Implementing I/O-efficient data structures using TPIE
-
ARGE, L., PROCOPIUC, O., AND VITTER, J. S. 2002b. Implementing I/O-efficient data structures using TPIE. In Proceedings of the European Symposium on Algorithms (ESA), 88-100.
-
(2002)
Proceedings of the European Symposium on Algorithms (ESA)
, pp. 88-100
-
-
ARGE, L.1
PROCOPIUC, O.2
VITTER, J.S.3
-
6
-
-
0015489880
-
Organization and maintenance of large ordered indexes
-
BAYER, R., AND MCCREIGHT, E. 1972. Organization and maintenance of large ordered indexes. Acta Inf. 1, 173-189.
-
(1972)
Acta Inf
, vol.1
, pp. 173-189
-
-
BAYER, R.1
MCCREIGHT, E.2
-
7
-
-
0025447750
-
The R*-tree: An efficient and robust access method for points and rectangles
-
BECKMANN, N., KRIEGEL, H.-P, SCHNEIDER, R., AND SEEGER, B. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 322-331.
-
(1990)
Proceedings of the ACM SIGMOD International Conference on Management of Data
, pp. 322-331
-
-
BECKMANN, N.1
KRIEGEL, H.-P.2
SCHNEIDER, R.3
SEEGER, B.4
-
8
-
-
84890541133
-
Improving the query performance of high-dimensional index structures by bulk load operations
-
Proceedings of the Conference on Extending Database Technology, Springer
-
BERCHTOLD, S., BÖHM, C., AND KRIEGEL, H.-P. 1998. Improving the query performance of high-dimensional index structures by bulk load operations. In Proceedings of the Conference on Extending Database Technology. Lecture Notes in Computer Science, vol. 1377. Springer, 216-230.
-
(1998)
Lecture Notes in Computer Science
, vol.1377
, pp. 216-230
-
-
BERCHTOLD, S.1
BÖHM, C.2
KRIEGEL, H.-P.3
-
9
-
-
0037853259
-
LR-Tree: A logarithmic decomposable spatial index method
-
BOZANIS, P., NANOPOULOS, A., AND MANOLOPOULOS, Y. 2003. LR-Tree: A logarithmic decomposable spatial index method. The Comput. J. 46, 3, 319-331.
-
(2003)
The Comput. J
, vol.46
, Issue.3
, pp. 319-331
-
-
BOZANIS, P.1
NANOPOULOS, A.2
MANOLOPOULOS, Y.3
-
11
-
-
0018480749
-
The ubiquitous B-tree
-
COMER, D. 1979. The ubiquitous B-tree. ACM Comput. Surv. 11, 2, 121-137.
-
(1979)
ACM Comput. Surv
, vol.11
, Issue.2
, pp. 121-137
-
-
COMER, D.1
-
12
-
-
0002099785
-
Client-Server Paradise
-
DËWITT, D. J., KABRA, N., LUO, J., PATEL, J. M., AND YU, J.-B. 1994. Client-Server Paradise. In Proceedings of the International Conference on Very Large Databases, 558-569.
-
(1994)
Proceedings of the International Conference on Very Large Databases
, pp. 558-569
-
-
DËWITT, D.J.1
KABRA, N.2
LUO, J.3
PATEL, J.M.4
YU, J.-B.5
-
13
-
-
0032083561
-
Multidimensional access methods
-
GAEDE, V., AND GÜNTHER, O. 1998. Multidimensional access methods. ACM Comput. Surv. 30, 2, 170-231.
-
(1998)
ACM Comput. Surv
, vol.30
, Issue.2
, pp. 170-231
-
-
GAEDE, V.1
GÜNTHER, O.2
-
14
-
-
84980369271
-
A greedy algorithm, for bulk loading R-trees
-
GARCÍA, Y. J., LÓPEZ, M. A., AND LEUTENEGGER, S. T. 1998. A greedy algorithm, for bulk loading R-trees. In Proceedings of the 6th ACM Symposium on Advances in Geographic Information Systems (GIS), 163-164.
-
(1998)
Proceedings of the 6th ACM Symposium on Advances in Geographic Information Systems (GIS)
, pp. 163-164
-
-
GARCÍA, Y.J.1
LÓPEZ, M.A.2
LEUTENEGGER, S.T.3
-
16
-
-
0036355688
-
Box-Trees for collision checking in industrial installations
-
HAVERKORT, H. J., DE BERG, M., AND GUDMUNDSSON, J. 2002. Box-Trees for collision checking in industrial installations. In Proceedings of the ACM Symposium on Computational Geometry, 53-62.
-
(2002)
Proceedings of the ACM Symposium on Computational Geometry
, pp. 53-62
-
-
HAVERKORT, H.J.1
DE BERG, M.2
GUDMUNDSSON, J.3
-
19
-
-
84947262282
-
Optimal dynamic range searching in non-replicating index structures
-
Proceedings of the International Conference on Database Theory, Springer
-
KANTH, K. V. R., AND SINGH, A. K. 1999. Optimal dynamic range searching in non-replicating index structures. In Proceedings of the International Conference on Database Theory. Lecture Notes in Computer Science, vol. 154. Springer, 257-276.
-
(1999)
Lecture Notes in Computer Science
, vol.154
, pp. 257-276
-
-
KANTH, K.V.R.1
SINGH, A.K.2
-
20
-
-
0030696457
-
STR: A simple and efficient algorithm for R-tree packing
-
LEUTENEGGER, S. T., LÓPEZ, M. A., AND EDGINGTON, J. 1996. STR: A simple and efficient algorithm for R-tree packing. In Proceedings of the IEEE International Conference on Data Engineering, 497-506.
-
(1996)
Proceedings of the IEEE International Conference on Data Engineering
, pp. 497-506
-
-
LEUTENEGGER, S.T.1
LÓPEZ, M.A.2
EDGINGTON, J.3
-
21
-
-
26444599328
-
-
Springer
-
MANOLOPOULOS, Y., NANOPOULOS, A., PAPADOPOULOS, A. N., AND THEODORIDIS, Y. 2005. R-Trees: Theory and Applications. Springer.
-
(2005)
R-Trees: Theory and Applications
-
-
MANOLOPOULOS, Y.1
NANOPOULOS, A.2
PAPADOPOULOS, A.N.3
THEODORIDIS, Y.4
-
22
-
-
33244479711
-
BKD-Tree: A dynamic scalable KD-Tree
-
PROCOPIUC, O., AGARWAL, P. K., ARGE, L., AND VITTER, J. S. 2003. BKD-Tree: A dynamic scalable KD-Tree. In Proceedings of the International Symposium on Spatial and Temporal Databases.
-
(2003)
Proceedings of the International Symposium on Spatial and Temporal Databases
-
-
PROCOPIUC, O.1
AGARWAL, P.K.2
ARGE, L.3
VITTER, J.S.4
-
25
-
-
0000561280
-
The R+-Tree: A dynamic index for multi-dimensional objects
-
SELLIS, T., ROUSSOPOULOS, N., AND FALOUTSOS, C 1987. The R+-Tree: A dynamic index for multi-dimensional objects. In Proceedings of the International Conference on Very Large Databases, 507-518.
-
(1987)
Proceedings of the International Conference on Very Large Databases
, pp. 507-518
-
-
SELLIS, T.1
ROUSSOPOULOS, N.2
FALOUTSOS, C.3
|