1 |
H. V. Jagadish, Linear Clustering of Objects with Multiple Attributes, In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, pp. 332-342, May 1990
DOI
|
2 |
J. K. Lawder and P. J. H. King, Querying Multi-Dimensional Data Indexed Using the Hilbert Space-filling Curve, SIGMOD Record, Vol.30, No.1, pp. 19-24, 2001
DOI
ScienceOn
|
3 |
B. Seeger and H.-P. Kriegel, 'Techniques for Design and Implementation of Efficient Spatial Access Methods,' In Proc. the 14th Int'l Conf. on Very Large Data Bases, pp. 360-371, 1988
|
4 |
H. Samet, The Design and Analysis of Spatial Data Structures, Addision-Wesley Publishing Company, Inc., 1990
|
5 |
V. Gaede, O. Gunther, 'Multidimensional Access Methods,' ACM Computing Surveys, 30(2), pp.170-231, 1998
DOI
ScienceOn
|
6 |
H. V. Jagadish, 'Spatial Search with Polyhedra,' In Proc. the 16th IEEE Int'l Conf. on Data Engineering, pp. 311-319, 1990
DOI
|
7 |
O. Gunther, 'The Cell Tree: An Object-Oriented Index Structure for Geometric Databases,' In Proc. the 15th IEEE Int'l Conf. on Data Engineering, pp. 598-605, 1989
DOI
|
8 |
K. Hinrichs and J. Nievergelt, 'The Grid File: A Data Structure Designed to Support Proximity Queries on Spatial Objects,' In Proc. Int'l Workshop on Graph Theoretic Concepts in Computer Science, pp. 100-113, 1983
|
9 |
B. C. Ooi, K. J. Mcdonell, and R. Sacks-Davis, 'Spatial kd-tree: An Indexing Mechanism for Spatial Databases,' In Proc. IEEE Computer Software and Applications Conference, pp. 433-438, 1987
|
10 |
S. Berchtold, D. Keirn, and H.-P. Kriegel, 'The X-tree: An Index Structure for High-Dimensional Data,' In Proc. the 22nd Int'l Conf. on Very Large Data Bases, pp. 28-39, 1996
|
11 |
Y. Ohsawa and M. Sakauchi, 'A New Tree Type Data Structure with Homogeneous Node Suitable for a Very Large Spatial Database,' In Proc. the Sixth IEEE Int'l Conf. on Data Engineering, pp. 296-303. 1990
DOI
|
12 |
N. Mamoulis and D. Papadias, 'Slot Index Spatial Join' IEEE Transactions on Knowledge and Data Engineering, Vol.15, No.1, Jan/Feb., 2003
DOI
ScienceOn
|
13 |
A. Guttman, 'R-Trees: A Dynamic Index Structure for Spatial Searching,' In Proceedings of ACM SIGMOD International Conference on Management of Data, pp.47-57, Jun., 1984
DOI
|
14 |
J. Lee, Y. Lee, K. Whang, and I. Song, 'A Region Splitting Strategy for Physical Database Design of Multidimensional File Organizations,' In Proc. the 23rd Int'l Conf. on Very Large Data Bases, pp. 416-425, 1997
|
15 |
K. Whang and R. Krishnamurthy, Multilevel Grid Files, IBM Research Report RC 11516, 1985
|
16 |
J. M. Patel and D. J. DeWitt, 'Partition Based Spatial-Merge Join,' In Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 259-270, Jun. 1996
DOI
|
17 |
N. Beckmann et al., 'The -tree : An Efficient and Robust Access Method for Points and Rectangles,' In Proc. Int'l, Conf. on Management of Data, ACM SIGMOD, pp.322-331, May, 1990
DOI
|
18 |
J. Song, K. Whang, Y. Lee, M. Lee, and S. Kim, 'Spatial Join Processing Using Comer Transformation,' IEEE Trans. on Knowledge and Data Engineering, Vol. 11, No. 4, pp. 688-695, 1999
DOI
ScienceOn
|
19 |
M.-L. Lo and C. V. Ravishankar, 'Spatial Hash-Joins,' In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, pp. 247-258, June, 1996
DOI
|
20 |
Y.-W. Huang and N. Jing, 'Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations,' In Proc. the 23rd Int'l Conf. on Very Large Data Bases, pp. 396-405, 1997
|
21 |
T. Brinkhoff, H.-P. Kriegel, and B. Seeger, 'Efficient Processing of Spatial Joins Using R-Trees,' In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, pp. 237-246, May 1993
DOI
|
22 |
M. L. La and C. V. Ravishankar, 'Spatial joins using seeded trees,' In Proceedings of ACM SIGMOD International Conference on Management of Data, Minneapolis, MN, pp. 209-220, May, 1994
DOI
|
23 |
O. Gunther, 'Efficient Computation of Spatial Joins,' In Proc. the Ninth Int'l Conf. on Data Engineering, pp. 50-59, 1993
DOI
|