-
1
-
-
0025447750
-
The R*-tree: An efficient and robust access method for points and rectangles
-
N. Beckmann, H. Kriegel, R. Schneider, B. Seeger, The R*-tree: An efficient and robust access method for points and rectangles, in: Proceedings of ACM SIGMOD International Conference on Management of Data, 1990, pp. 322-331.
-
(1990)
Proceedings of ACM SIGMOD International Conference on Management of Data
, pp. 322-331
-
-
Beckmann, N.1
Kriegel, H.2
Schneider, R.3
Seeger, B.4
-
2
-
-
0028447381
-
GENESYS: A system for efficient spatial query processing
-
T. Brinkhoff, H. Kriegel, R. Schneider, B. Seeger, GENESYS: A system for efficient spatial query processing, in: Proceedings of ACM SIGMOD International Conference on Management of Data, 1994, p. 519.
-
(1994)
Proceedings of ACM SIGMOD International Conference on Management of Data
, pp. 519
-
-
Brinkhoff, T.1
Kriegel, H.2
Schneider, R.3
Seeger, B.4
-
3
-
-
0031147894
-
A study of concurrent operations on R-trees
-
J.K. Chen, Y.F. Huang, Y.H. Chin, A study of concurrent operations on R-trees, Inform. Sci., Vol. 98 (Nos. 1-4) (1987) 263-300.
-
(1987)
Inform. Sci.
, vol.98
, Issue.1-4
, pp. 263-300
-
-
Chen, J.K.1
Huang, Y.F.2
Chin, Y.H.3
-
5
-
-
84945709355
-
An algorithm for finding the best matches in logarithmic expected time
-
J.H. Friedman, J.L. Bentley, R.A. Finkel, An algorithm for finding the best matches in logarithmic expected time, ACM Trans, on Math. Software 3 (1977) 209-226.
-
(1977)
ACM Trans, on Math. Software
, vol.3
, pp. 209-226
-
-
Friedman, J.H.1
Bentley, J.L.2
Finkel, R.A.3
-
6
-
-
0021615874
-
R-trees: A dynamic index structure for spatial searching
-
A. Guttman, R-trees: A dynamic index structure for spatial searching, in: Proceeding of ACM SIGMOD Annual Meeting, 1984, pp. 47-57.
-
(1984)
Proceeding of ACM SIGMOD Annual Meeting
, pp. 47-57
-
-
Guttman, A.1
-
7
-
-
0025693216
-
A new methodology to evaluate locking protocols
-
Y.F. Huang, Y.H. Chin, A new methodology to evaluate locking protocols, IEEE Trans, on Knowledge and Data Eng. 2 (4) (1990) 431-435.
-
(1990)
IEEE Trans, on Knowledge and Data Eng.
, vol.2
, Issue.4
, pp. 431-435
-
-
Huang, Y.F.1
Chin, Y.H.2
-
9
-
-
0027557582
-
The performance of current B-tree algorithms
-
T. Johnson, D. Shasha, The performance of current B-tree algorithms, ACM Trans, on Database Systems 18 (1) (1993) 51-101.
-
(1993)
ACM Trans, on Database Systems
, vol.18
, Issue.1
, pp. 51-101
-
-
Johnson, T.1
Shasha, D.2
-
10
-
-
0003814252
-
-
Morgan Kaufmann, Los Altos, CA
-
P. O'Neil, Database: Principles, Programming, and Performance, Morgan Kaufmann, Los Altos, CA, 1994.
-
(1994)
Database: Principles, Programming, and Performance
-
-
O'Neil, P.1
-
12
-
-
84976703615
-
Nearest neighbor queries
-
N. Roussopoulos, S. Kelley, F. Vincent, Nearest Neighbor Queries, in: Proceedings of ACM SIGMOD International Conference on Management of Data, 1995, pp. 71-79.
-
(1995)
Proceedings of ACM SIGMOD International Conference on Management of Data
, pp. 71-79
-
-
Roussopoulos, N.1
Kelley, S.2
Vincent, F.3
-
14
-
-
0000561280
-
The R*-tree: A dynamic index for multidimensional objects
-
T Sellis, N. Roussopoulos, C. Faloutsos, The R*-tree: A dynamic index for multidimensional objects, in: Proceedings of the 13th VLDB Conference, 1987, pp. 507-518.
-
(1987)
Proceedings of the 13th VLDB Conference
, pp. 507-518
-
-
Sellis, T.1
Roussopoulos, N.2
Faloutsos, C.3
-
15
-
-
0000987081
-
Performance of B+-trees concurrency control algorithms
-
V. Srinivasan, M.J. Carey, Performance of B+-trees concurrency control algorithms, VLDB J. 2(1993) 361-406.
-
(1993)
VLDB J.
, vol.2
, pp. 361-406
-
-
Srinivasan, V.1
Carey, M.J.2
|