-
1
-
-
0002130676
-
Scalable sweeping-based spatial join
-
L. Arge, S. Procopiuc, S. Ramaswamy, T. Suel, and J. Vitter, "Scalable Sweeping-Based Spatial Join," Proc. 24th Very Large Data Bases Conf., pp. 570-581, 1998.
-
(1998)
Proc. 24th Very Large Data Bases Conf.
, pp. 570-581
-
-
Arge, L.1
Procopiuc, S.2
Ramaswamy, S.3
Suel, T.4
Vitter, J.5
-
2
-
-
84958752171
-
Algorithms for performing polygonal map overlay and spatial join on massive data sets
-
L. Becker, A. Giesen, K. Hinrichs, and J. Vahrenhold, "Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets," Proc. Sixth Int'l Symp. Advances in Spatial Databases, pp. 270-285, 1999.
-
(1999)
Proc. Sixth Int'l Symp. Advances in Spatial Databases
, pp. 270-285
-
-
Becker, L.1
Giesen, A.2
Hinrichs, K.3
Vahrenhold, J.4
-
3
-
-
0027621672
-
Efficient processing of spatial joins using R-trees
-
T. Brinkhoff, H.-P. Kriegel, and B. Seeger, "Efficient Processing of Spatial Joins Using R-Trees," Proc. ACM SIGMOD, pp. 237-246, 1993.
-
(1993)
Proc. ACM SIGMOD
, pp. 237-246
-
-
Brinkhoff, T.1
Kriegel, H.-P.2
Seeger, B.3
-
4
-
-
0028445007
-
Multi-step processing of spatial joins
-
T. Brinkhoff, H.-P. Kriegel, R. Schneider, and B. Seeger, "Multi-Step Processing of Spatial Joins," Proc. ACM SIGMOD, pp. 197-208, 1994.
-
(1994)
Proc. ACM SIGMOD
, pp. 197-208
-
-
Brinkhoff, T.1
Kriegel, H.-P.2
Schneider, R.3
Seeger, B.4
-
5
-
-
0039253795
-
Closest pair queries in spatial databases
-
A. Carral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, "Closest Pair Queries in Spatial Databases," Proc. ACM SIGMOD, pp. 189-200, 2000.
-
(2000)
Proc. ACM SIGMOD
, pp. 189-200
-
-
Carral, A.1
Manolopoulos, Y.2
Theodoridis, Y.3
Vassilakopoulos, M.4
-
7
-
-
0020949322
-
Optimal algorithms for the intersection and the minimum distance problems between planar polygons
-
F. Chin and C.A. Wang, "Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons," IEEE Trans. Computer, pp. 1203-1207, 1983.
-
(1983)
IEEE Trans. Computer
, pp. 1203-1207
-
-
Chin, F.1
Wang, C.A.2
-
9
-
-
0027261939
-
Efficient computation of spatial joins
-
O. Gunther, "Efficient Computation of Spatial Joins," Proc. Int'l Conf. Data Eng., pp. 50-59, 1993.
-
(1993)
Proc. Int'l Conf. Data Eng.
, pp. 50-59
-
-
Gunther, O.1
-
10
-
-
0023385392
-
A practical divide-and-conquer algorithm for the rectangle intersection problem
-
R.H. Guting and W. Schilling, "A Practical Divide-and-Conquer Algorithm for the Rectangle Intersection Problem," Information Sciences (42), pp. 95-112, 1987.
-
(1987)
Information Sciences
, Issue.42
, pp. 95-112
-
-
Guting, R.H.1
Schilling, W.2
-
11
-
-
84893472215
-
Implementation of ROSE algebra: Efficient algorithms for realm-based spatial data types
-
R.H. Guting, T. Ridder, and M. Schneider, "Implementation of ROSE Algebra: Efficient Algorithms for Realm-Based Spatial Data Types," Proc. Advances in Spatial Databases-Fourth Int'l Symp. (SSD '95), pp. 216-239, 1995.
-
(1995)
Proc. Advances in Spatial Databases-Fourth Int'l Symp. (SSD '95)
, pp. 216-239
-
-
Guting, R.H.1
Ridder, T.2
Schneider, M.3
-
12
-
-
0021615874
-
R-trees: A dynamic index structure for spatial searching
-
A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, pp. 47-57, 1984.
-
(1984)
Proc. ACM SIGMOD
, pp. 47-57
-
-
Guttman, A.1
-
13
-
-
0032089982
-
Incremental distance join algorithms for spatial databases
-
G.R. Hjaltason and H. Samet, "Incremental Distance Join Algorithms for Spatial Databases," Proc. ACM SIGMOD, pp. 237-248, 1998.
-
(1998)
Proc. ACM SIGMOD
, pp. 237-248
-
-
Hjaltason, G.R.1
Samet, H.2
-
14
-
-
84885618215
-
Improving spatial intersect using symbolic intersect detection
-
Y.-W. Huang, M. Jones, and E. Rundensteiner, "Improving Spatial Intersect Using Symbolic Intersect Detection," Proc. Fifth Int'l Symp. Advances in Spatial Databases, pp. 165-177, 1997.
-
(1997)
Proc. Fifth Int'l Symp. Advances in Spatial Databases
, pp. 165-177
-
-
Huang, Y.-W.1
Jones, M.2
Rundensteiner, E.3
-
17
-
-
0012906001
-
High dimensional similarity joins: Algorithms and performance evaluation
-
Jan./Feb.
-
N. Koudas and K.C. Sevcik, "High Dimensional Similarity Joins: Algorithms and Performance Evaluation," IEEE Trans. Knowledge and Data Eng., vol. 12, no. 1, pp. 3-18, Jan./Feb. 2000.
-
(2000)
IEEE Trans. Knowledge and Data Eng.
, vol.12
, Issue.1
, pp. 3-18
-
-
Koudas, N.1
Sevcik, K.C.2
-
20
-
-
0022113717
-
On fast computation of distance between line segments
-
V.J. Lumelsky, "On Fast Computation of Distance Between Line Segments," Information Processing Letters, vol. 21, pp. 55-61, 1985.
-
(1985)
Information Processing Letters
, vol.21
, pp. 55-61
-
-
Lumelsky, V.J.1
-
21
-
-
0029184961
-
LEDA, a platform for combinatorial and geometric computing
-
Jan.
-
K. Mehlhorn and S. Naher, "LEDA, A Platform for Combinatorial and Geometric Computing," Comm. ACM, no. 38, pp. 96-102, Jan. 1995.
-
(1995)
Comm. ACM
, Issue.38
, pp. 96-102
-
-
Mehlhorn, K.1
Naher, S.2
-
23
-
-
0030157411
-
Partition based spatial-merge join
-
J.M. Patel and D. DeWitt, "Partition Based Spatial-Merge Join," Proc. ACM SIGMOD, pp. 259-270, 1996.
-
(1996)
Proc. ACM SIGMOD
, pp. 259-270
-
-
Patel, J.M.1
DeWitt, D.2
-
24
-
-
0027964031
-
Efficient distance computation between non-convex objects
-
S. Quinlan, "Efficient Distance Computation Between Non-Convex Objects," Proc. IEEE Int'l Conf. Robotics and Automation, pp. 3325-3330, 1994.
-
(1994)
Proc. IEEE Int'l Conf. Robotics and Automation
, pp. 3325-3330
-
-
Quinlan, S.1
-
26
-
-
84976703615
-
Nearest neighbor queries
-
N. Roussopoulos, S. Kelley, and F. Vincent, "Nearest Neighbor Queries," Proc. ACM SIGMOD, pp. 71-79, 1995.
-
(1995)
Proc. ACM SIGMOD
, pp. 71-79
-
-
Roussopoulos, N.1
Kelley, S.2
Vincent, F.3
|