참고문헌 (37)

1. Journal of Korean Institute of Information Scientists and Engineers, KISS Back 34 5 420 2007 An efficient spatial join method using DOT index 

2. 10.1145/93605.98741 N. Beckmann, H. Kriegel, R. Schneider, The R*-tree: an efficient and robust access method for points and rectangles, in: Proc. Int’l. Conf. on Management of Data, ACM SIGMOD, 1990, pp. 322-331. 

   상세보기

3. ACM Computing Surveys Bohm 33 3 322 2001 10.1145/502807.502809 Searching in high dimensional spaces - index structures for improving the performance of multimedia databases 

   상세보기

4. 10.1145/170036.170075 T. Brinkhoff, H.P. Kriegel, B. Seeger, Efficient processing of spatial joins using R-trees, in: Proc. Int’l. Conf. on Management of Data, ACM SIGMOD, 1993, pp. 237-246. 

   상세보기

5. 10.1145/191843.191880 T. Brinkhoff, H.P. Kriegel, R. Schneider, B. Seeger, Multi-step processing of spatial joins, in: Proc. Int’l. Conf. on Management of Data, ACM SIGMOD, 1994, pp. 197-208. 

   상세보기

6. ACM Computing Surveys Comer 11 2 121 1979 10.1145/356770.356776 The ubiquitous B-Tree 

   상세보기

7. Information Sciences Corral 177 11 2207 2007 10.1016/j.ins.2006.12.012 A performance comparison of distance-based query algorithms using R-trees in spatial databases 

   상세보기

8. Discrete Mathematics and Theoretical Computer Science Dai 53 2003 Approximation and analytical studies of inter-cluster performances of space-filling curves 

9. Information Sciences Du 178 1 52 2008 10.1016/j.ins.2007.07.023 Evaluating structural and topological consistency of complex regions with broad boundaries in multi-resolution spatial databases 

   상세보기

10. 10.1145/73721.73746 C. Faloutsos, S. Roseman, Fractals for secondary key retrieval, in: Proc. Int’l. Symp. on Principles of Database Systems, ACM PODS, 1989, pp. 247-252. 

    

11. C. Faloutsos, Y. Rong, DOT: a spatial access method using fractals, in: Proc. Int’l. Conf. on Data Engineering, IEEE ICDE, 1991, pp. 152-159. 

12. O. Gunther, The Cell Tree: An Index for Geometric Data, Memorandum No. UCB/ERL M86/89, Univ. of California, Berkeley, December 1986. 

13. O. Gunther, Efficient computation of spatial joins, in: Proc. Int’l. Conf. on Data Engineering, IEEE ICDE, 1993, pp. 50-59. 

14. 10.1145/971697.602266 A. Guttman, R-trees: a dynamic index structures for spatial searching, Proc. Int’l. Conf. on Management of Data, ACM SIGMOD, 1984, pp. 47-57. 

    상세보기

15. Special Issue on Spatial Database Systems of the VLDB Journal Guting 3 4 357 1994 An introduction to spatial database systems 

16. A. Henrich, H.-W. Six, P. Widmayer, The LSD tree: spatial access to multidimensional point and non point objects, in: Proc. Int’l. Conf. on Very Large Data Bases, VLDB, 1989, pp. 45-53. 

17. Y.-W. Huang, N. Jing, E.A. Rundensteiner, Rundensteiner: spatial joins using R-trees: breadth-first traversal with global optimizations, in: Proc. Int’l. Conf. on Very Large Data Bases, VLDB, 1997, pp. 396-405. 

18. Journal of Systems and Software Huang 55 3 291 2001 10.1016/S0164-1212(00)00078-9 Optimizing storage utilization in R-tree dynamic index structure for spatial databases 

    상세보기

19. 10.1007/3-540-52208-5_23 H. Kriegel, M. Schiwietz, R. Schneider, B. Seeger, Performance comparison of point and spatial access methods, in: Proc. Int’l. Symp. on Design and Implementation of Large Spatial Databases, SSD, 1989, pp. 89-114. 

    

20. ACM SIGMOD Record Lawder 30 1 19 2001 10.1145/373626.373678 Querying multi-dimensional data indexed using the Hilbert space-filling curve 

    상세보기

21. IEEE Transactions on Knowledge and Data Engineering Lee 18 2 245 2006 10.1109/TKDE.2006.33 Transform-space view: Performing spatial join in the transform space using original-space indexes 

    상세보기

22. IEEE Transactions on Knowledge and Data Engineering Moon 13 1 124 2001 10.1109/69.908985 Analysis of the clustering properties of Hilbert space-filling curve 

    상세보기

23. H.K. Ng, H.W. Leong, Multi-point queries in large spatial databases, in: Proc. Int’l. Conf. on Advances in Computer Science and Technology, IASTED ACST, 2007, pp. 408-413. 

24. ACM Transactions on Database Systems Nievergelt 9 1 38 1984 10.1145/348.318586 The grid file: an adaptable, symmetric Multikey file structure 

    상세보기

25. 10.1145/16856.16886 J. Orenstein, Spatial query processing in an object-oriented database system, in: Proc. Int’l. Conf. on Management of Data, ACM SIGMOD, 1986, pp. 326-336. 

    상세보기

26. IEEE Transactions on Software Engineering Orenstein 14 5 611 1988 10.1109/32.6139 PROBE spatial data modeling and query processing in an image database applications 

    상세보기

27. 10.1007/3-540-56869-7_5 B.-U. Pagel, H.-W. Six, H. Toben, The transformation technique for spatial objects revisited, in: Proc. Int’l. Symp. on Advances in Spatial Databases, SSD, 1993, pp. 73-88. 

    상세보기

28. D. Pfoser, Y. Theodoridis, C.S. Jensen, Indexing Trajectories in Query Processing for Moving Objects, Chorochronos Technical Report, CH-99-3, 1999. 

29. D. Pfoser, C.S. Jensen, Y. Theodoridis, Novel approaches in query processing for moving objects, in: Proc. Int’l. Conf. on Very Large Data Bases, VLDB, 2000, pp. 395-406. 

30. 10.1145/582318.582321 J.T. Robinson, The K-D-B-tree: a search structure for large multidimensional dynamic indexes, in: Proc. Int’l. Conf. on Management of Data, ACM SIGMOD, 1981, pp. 10-18. 

    

31. <http://www.rtreeportal.org>. 

32. B. Seeger, H.-P. Kriegel, Techniques for design and implementation of efficient spatial access methods, in: Proc. Int’l. Conf. on Very Large Data Bases, VLDB, 1988, pp. 360-371. 

33. T. Sellis, N. Roussopoulos, C. Faloutsos, The R+ tree: a dynamic index for multidimensional objects, in: Proc. Int’l. Conf. on Very Large Data Bases, VLDB, 1987, pp. 507-518. 

34. IEEE Transactions on Knowledge and Data Engineering Song 11 4 688 1999 10.1109/69.790844 Spatial join processing using corner transformation 

    상세보기

35. Y. Tao, D. Papadias, MV3R-tree: a spatio-temporal access method for timestamp and interval queries, in: Proc. Int’l. Conf. on Very Large Data Bases, VLDB, 2001, pp. 431-440. 

36. 10.1109/MMCS.1996.535011 Y. Theodoridis, M. Vazirgiannis, T.K. Sellis, Spatio-temporal indexing for large multimedia applications, in: Proc. Int’l. Conf. on Multimedia Systems, IEEE ICMCS, 1996, pp. 441-448. 

    

37. 10.1109/ICMLC.2006.258779 J. Xiao, Comparison of heuristics for scheduling spatial clusters to reduce I/O cost in spatial join processing, in: Proc. Int’l. Conf. on Machine Learning and Cybernetics, ICMLC, 2006, pp. 2455-2460.