Sibling Clustering of Tree-based Spatial Indexes for Efficient Spatial Query Processing

International Conference on Information and Knowledge Management, Proceedings

Volumn 1998-January, Issue , 1998, Pages 398-405

  Kim, Kihong ^a   Cha, Sang K ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; NEAREST NEIGHBOR SEARCH; QUERY LANGUAGES; QUERY PROCESSING;

B TREES; CLUSTERINGS; DISK BLOCK; INDEX NODES; ONE-DIMENSIONAL; R-TREES; SPATIAL INDEXES; SPATIAL QUERIES; SPATIAL QUERY PROCESSING; TREE-BASED;

MAPPING;

EID: 85139874810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/288627.288686     Document Type: Conference Paper

References (35)

1. D. G. Keehn and S. O. Lacy, "VSAM dataset design parameters," IBM Systems Journal, vol. 13, no. 3, pp. 186-212, 1974.
2. G. Smith, "Online reorganization of key-sequenced tables and files," Tandem System Review, vol. 6, no. 2, pp. 52-59, 1990.
3. C. Zou and B. Salzberg, "On-line reorganization of sparsely-populated B+-trees," in Proc. of ACM SIGMOD Conf, pp. 168-179, 1996.
4. M. Jakobsson, "Reducing block accesses in inverted files by partial clustering," Information Systems, vol. 5, pp. 1-5, 1980.
5. E. Omiecinski, L. Lee, and P. Scheuermann, "Concurrent file reorganization for record clustering: A performance study," in Proc. of 8th IEEE Conf. on Data Engineering, pp. 265-272, 1992.
6. J. R. Cheng and A. R. Hurson, "Effective clustering of complex objects in object-oriented databases," in Proc. of ACM SIGMOD Conf, pp. 22-31, 1991.
7. M. M. Tsanggaris and J. F. Naughton, "On the performance of object clustering techniques," in Proc. of ACM SIGMOD Conf, pp. 144-153, 1992.
8. J. W. J. Mciver and R. King, "Self-adaptive, on-line reentering of complex object data," in Proc. of ACM SIGMOD Conf, pp. 407-418, 1994.
9. J. Banerjee, W. Kim, S. Kim, and J. F. Garza, "Clustering a DAG for CAD databases," IEEE Trans, on Software Engineering, vol. 14, pp. 1684-1699, Nov. 1988.
10. A. A. Diwan, S. Rane, S. Seshadri, and S. Sudarshan, "Clustering technique for minimizing external path length," in Proc. of the 22nd VLDB Conf, pp. 342-353, 1996.
11. Y.-W. Huang, N. Jing, and E. A. Rundensteiner, "Effective graph clustering for path queries in digital map databases," in Proc. of 5th ACM Conf. on Information and Knowledge Mgmt, pp. 215-222, 1996.
12. S. Shekhar and D.-R. Liu, "CCAM: A connectivity-clustered access method for networks and network computations," IEEE Trans, on Knowledge and Data Eng., vol. 9, no. 1, pp. 102-119, 1997.
13. T. Brinkhoff and H.-P. Kriegel, 'The impact of global clustering on spatial database systems," in Proc. of the 20th VLDB Conf, pp. 168-179, 1994.
14. J. Lee, Y. Lee, K. Whang, and I. Song, "A region splitting strategy for physical database design of multidimensional file organizations," in Proc. of 23rd VLDB Conf, pp. 416-425, 1997.
15. A. Guttman, "R-trees: A dynamic index structure for spatial searching," in Proc. of ACM SIGMOD Conf, pp. 47-57,1984.
16. K.-I. Lin, H. V. Jagadish, and C. Faloutsos, "The TV-tree: An index structure for high-dimensional data," VLDB Journal, vol. 3, pp. 517-542, Oct. 1994.
17. S. Berchtold, A. Keim, and H.-P. Kriegel, 'The X-tree: An index structure for high-dimensional data," in Proc. of the 22nd VLDB Conf, pp. 28-39, 1996.
18. S. Berchtold, B. Ertl, D. A. Keim, H.-P. Kriegel, and T. Seidl, "Fast nearest neighbor search in high-dimensional space," in Proc. of the 14th IEEE Conf. on Data Engineering, pp. 209-218, 1998.
19. J. T. Robinson, 'The K-D-B tree: A search structure for large multidimensional dynamic indexes," in Proc. of ACM SIGMOD Conf, pp. 10-18, 1981.
20. + tree: A dynamic index for multi-dimensional objects," in Proc. of the 13th VLDB Conf, pp. 507-518, 1987.
21. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: An efficient and robust access method for points and rectangles," in Proc. of ACM SIGMOD Conf, pp. 322-331, 1990.
22. I. Kamel and C. Faloutsos, "Hibert R-tree: An improved R-tree using fractals," in Proc. of the 20th VLDB Conf, pp. 500-509, 1994.
23. D. Knuth, The Art of Computer Programming: Searching and Sorting, vol. 3. Addison-Wesley, 1973.
24. D. Comer, 'The uniquitous B-tree," ACM Computing Surveys, vol. 11, pp. 121-137, June 1979.
25. I. Kamel and C. Faloutsos, "On packing R-trees," in Proc. of the 2nd Conf. on Information and Knowledge Management, pp. 490-499, 1993.
26. J. Gray and G. Graefe, 'The five-minute rule ten years later, and other computer storage rules of thumb," SIGMOD Record, vol. 26, pp. 63-68, Dec. 1997.
27. J. Gray and A. Reuter, Transaction Processing: Comcepts and Techniques. Morgan Kaufmann, 1993.
28. R. A. Baeza-Yates and P.-A. Larson, "Performance of B+-trees with partial expansion," IEEE Trans, on Knowledge and Data Engineering, vol. 1, pp. 248-257, June 1989.
29. P.-A. Larson, "Linear hashing with partial expansion," in Proc. of the 6th VLDB Conf, pp. 224-232, 1980.
30. Bureau of Census, Washington. DC, Tiger/Lines Precensus Files: 1990 Technical Documentation, 1989.
31. N. Roussopoulos, S. Kelley, and F. Vincent, "Nearest neighbor queries," in Proc. of ACM SIGMOD Conf, pp. 71-79, 1995.
32. T. Brinkhoff, H.-P. Kriegel, and B. Seeger, "Efficient processing of spatial joins using R-trees," in Proc. of ACM SIGMOD Conf, pp. 237-246, 1993.
33. Y.-W. Huang, N. Jing, and E. A. Rundensteiner, "Spatial joins using R-trees: Breadth-first traversal with global optimization," in Proc. of the 23rd VLDB Conf, pp. 396-405, 1997.
34. D. Papadias, Y. Theodoridis, T. Sellis, and M. J. Egenhofer, 'Topological relations in the world of minimum bounding rectangles: A study with R-trees," in Proc. of ACM SIGMOD Conf, pp. 92-103, 1995.
35. H. Samet, The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.