Parallel bulk-loading of spatial data

Parallel Computing

Volumn 29, Issue 10, 2003, Pages 1419-1444

  Papadopoulos, Apostolos ^a   Manolopoulos, Yannis ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Bulk loading; Parallel databases; Query processing; Spatial access methods

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; MATHEMATICAL MODELS;

SPATIAL DATA;

PARALLEL PROCESSING SYSTEMS;

EID: 0141525471     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2003.05.003     Document Type: Conference Paper

References (34)

1. Arge L., Hinrichs K.H., Vahrenhold J., Vitter J.S. Efficient bulk operations on dynamic R-trees. Algorithmica. 33(1):2002;104-128.
2. N. Beckmann, H.P. Kriegel, B. Seeger, The R*-tree: an efficient and robust method for points and rectangles, in: Proceedings of 1990 ACM SIGMOD Conference, Atlantic City, NJ, 1990, pp. 322-331.
3. J. van den Bercken, B. Seeger, P. Widmayer, A generic approach to bulk loading multidimensional index structures, in: Proceedings of the 23rd VLDB Conference, Athens, Greece, 1997, pp. 406-415.
4. S. Berchtold, C. Bohm, H.-P. Kriegel, Improving the query performance of high-dimensional index structures by bulk load operations, in: Proceedings of the 6th EDBT Conference, Valencia, Spain, 1998, pp. 216-230.
5. J. Van den Bercken, B. Seeger, An evaluation of generic bulk loading techniques, in: Proceedings of the 27th VLDB Conference, Roma, Italy, 2001, pp. 461-470.
6. G.E. Blelloch, C.E. Leiserson, B.M. Maggs, C.G. Plaxton, S.J. Smith, M. Zagha, A comparison of sorting algorithms for the connection machine CM-2, in: Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991.
7. Chartrand G., Oellermann O. Applied and Algorithmic Graph Theory. 1993;McGraw-Hill, New York.
8. P. Ciaccia, M. Patella, Bulk-loading the M-tree, in: Proceedings of the 9th Australian Database Conference, Perth, Australia, 1998.
9. DeWitt D.J.et al. The gamma database machine project. IEEE Transactions on Knowledge and Data Engineering. 2(1):1990;44-62.
10. D.J. DeWitt, J.F. Naughton, D.A. Schneider, Parallel sorting on a shared-nothing architecture using probabilistic splitting, in: Proceedings of the 1st PDIS Conference, Miami Beach, FL, 1991, pp. 280-291.
11. De Witt D.J., Gray P. Parallel database systems: the future of high performance database systems. Communications of the ACM. 35(6):1992;85-98.
12. C. Faloutsos, I. Kamel, Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension, in: Proceedings of the 13th ACM PODS Symposium, Minneapolis, MN, 1994, pp. 4-13.
13. Gaede V., Guenther O. Multidimensional access methods. ACM Computing Surveys. 30(2):1998;170-231.
14. Graefe G. Query evaluation techniques for large databases. ACM Computing Surveys. 25(2):1993;73-170.
15. Guting R.H. An introduction to spatial database systems. The VLDB Journal. 3(4):1994;357-399.
16. A. Guttman, R-trees: a dynamic index structure for spatial searching, in: Proceedings of the 1984 ACM SIGMOD Conference, Boston, MA, 1984, pp. 47-57.
17. I. Kamel, C. Faloutsos, Parallel R-trees, in: Proceedings of 1992 ACM SIGMOD Conference, San Diego, CA, 1992, pp. 195-204.
18. I. Kamel, C. Faloutsos, On packing R-trees, in: Proceedings of the 2nd CIKM Conference, Washington, DC, 1993, pp. 490-499.
19. I. Kamel, M. Khalil, V. Kouramajian, Bulk insertion in dynamic R-trees, in: Proceedings of the 4th SDH Symposium, 1996, pp. 3b.31-3b.42.
20. N. Koudas, C. Faloutsos, I. Kamel, Declustering spatial databases on a multi-computer architecture, in: Proceedings of the EDBT Conference, Avignon, France, 1996, pp. 592-614.
21. S.T. Leutenegger, M.A. Lopez, J. Edgington, STR: a simple and efficient algorithm for R-tree packing, in: Proceedings of the 13th IEEE ICDE Conference, Birmingham, UK, 1997, pp. 497-506.
22. Leutenegger S.T., Nicol D.M. Efficient bulk-loading of grid files. IEEE Transactions on Knowledge and Data Engineering. 9(3):1997;410-420.
23. Melhorn K., Noher S. LEDA: A platform for combinatorial and geometric computing. Communications of the ACM. 38(1):1995;96-102.
24. Papadias D., Theodoridis Y. Spatial relations, Minimum bounding rectangles and spatial data structures. Journal of Geographic Information Science. 11(2):1997;111-138.
25. Papadopoulos A.N., Manolopoulos Y. Nearest neighbor queries in shared-nothing environments. Geoinformatica. 1(4):1997;369-392.
26. A.N. Papadopoulos, Y. Manolopoulos, Similarity query processing using disk arrays, in: Proceedings of 1998 ACM SIGMOD Conference, Seattle, WA, 1998, pp. 225-236.
27. N. Roussopoulos, D. Leifker, Direct spatial search on pictorial databases using packed R-trees, in: Proceedings of 1985 ACM SIGMOD Conference, Austin, TX, 1985, pp. 17-31.
28. Salzberg B. Merging sorted runs using large main memory. Acta Informatica. 27(3):1989;195-215.
29. +-tree: a dynamic index for multidimensional objects, Proceedings of the 13th VLDB Conference, Brighton, UK, 1987, pp. 507-518.
30. S. Seshadri, J.F. Naughton, Sampling issues in parallel database systems, in: Proceedings of the EDBT '92, 1992, pp. 328-343.
31. M. Stonebraker, R. Katz, D. Patterson, J. Ousterhout, The design of XPRS, in: Proceedings of the 14th VLDB Conference, Los Angeles, CA, 1988, pp. 318-330.
32. M. Stonebraker, J. Frew, K. Gardels, J. Meredith, The Sequoia 2000 storage benchmark, in: Proceedings of 1993 ACM SIGMOD Conference, Washington, DC, 1993, pp. 2-11.
33. TIGER/Line Files, 1994 Technical Documentation, The Bureau of the Census, Washington, DC, 1994.
34. D.E. Vengroff, J.S. Vitter, I/O Efficient Scientific Computations using TPIE, in: Proceedings of the Goddard Conference on Mass Storage Systems and Technologies, NASA Conference Publication, 1996, pp. 553-570.