 | Alain Finkel, Matthias Jantzen - 1992 - 644 lapas
...Computational Geometry, Bern, Lecture Notes in Computer Science, page to appear, 1991. [BKSS90] N. Beckmann, HP Kriegel, R. Schneider, and B. Seeger. The r*-tree:...and robust access method for points and rectangles. A CM SIGMOD International Conf. on Management of Data, 19:322-331, 1990. [Gre89] D. Greene. An implementation... | |
 | Burkhard Monien - 1992 - 406 lapas
...Aspects of Computer Science, Paris, 1992 Beckmann, N., H.-P. Kriegel, R. Schneider, B. Seeger (1990): The R'-tree: an efficient and robust access method for points and rectangles; Proc. ACM SIGMOD International Conference on the Management of Data, Atlantic City, New Jersey, 322-331... | |
 | Vojin G. Oklobdzija - 2017 - 992 lapas
...asymptotically optimal multiversion B-tree. VLDB Journal, 5(4), 264-275, Dec. 1996. 41. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree:...robust access method for points and rectangles. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 322-331, 1990. 42. MA... | |
 | Michael F. Worboys, Anna F. Grundy - 1993 - 292 lapas
...structures is important - notably in persistent programming languages. References [Bks90] N. Beckmann, HP Kriegel, R. Schneider and B. Seeger. The R*-Tree:...and robust access method for points and rectangles. Proc. ACM SIGMOD Conf., 1990. [Hen 79] JL Bentley. Multidimensional Binary Search Trees in Database... | |
 | David B. Lomet - 1993 - 430 lapas
...Fundamental Geometric Data Structure" ACM Computing Surveys 23(3):345-405, Sept. 1991. 7. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-tree:...and robust access method for points and rectangles", ACM SIGMOD, pages 322-331, May 1990. 8. LG Brown, "A Survey of Image Registration Techniques", ACM... | |
 | Vincent B. Robinson, Henry Tom - 1998 - 155 lapas
...Specialist's Manual, SYSTEM 9 Technical Documentation, June 1990. [7] Beckmann, N., H. Kriegel, R. Schneider, B. Seeger, The R*-tree: An Efficient and Robust Access Method for Points and Rectangles, Proc ACM SIGMOD Int Conf. on Management of Data, p. 322-331, 1990. [8] Claire, RW, SC Guptill, Spatial... | |
 | Allen Kent, James G. Williams - 1993 - 442 lapas
...Conference on VLDB. 1987, pp. 507-518. 93. Beckmann, N., Kriegel, HE, Schneider, R., and Seeger, B., The R*-tree: An Efficient and Robust Access Method for Points and Rectangles, Proc. ACM SIGMOD 90 Conference. 1990, pp. 322-331. YANNIS MANOLOPOULOS ERRATUM The following is a coirected... | |
 | John P. Lee - 1994 - 256 lapas
...San Francisco, CA. 1990, pp. 238-246. [BKSS 90] Beckmann N.. Kriegel H.-R, Schneider R.. SeegerB.: 'The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles', Proc. ACM SIGMOD Int. Conf. on Management of Data. Atlantic City, NJ, 1990. pp. 322-331. [Cha 90] Chaudhun... | |
 | Stefano Spaccapietra, Ramesh Jain - 1995 - 468 lapas
...Searching. Proc. SIGMOD'8-1, pp.47-57. [II] Beckmann.N., Kriegel.HP, Schneider.R. and Seeger.B. (1990) The R*-tree: An Efficient and Robust Access method for Points and Rectangles. Proc. SIGMOD'90, pp.322-331. [12] Kamel,I. and Faloutsos,C. (1992) Parallel R-tree. Proc. SIGMOD'92,... | |
 | HongJiang Zhang, Philippe Aigrain, Dragutin Petkovic - 2007 - 94 lapas
...Barnsley and AD Sloan, "A better way to compress images," BYTE, pp. 215-223, 1988. 4. N. Beckmann, HP Kriegel, R. Schneider, and B. Seeger, "The R*-tree:...robust access method for points and rectangles," in Proceedings of ACM-SIGMOD International Conference on Management of Data, Atlantic City, NJ, May 1990,... | |
| |
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. 
