עץ R
הערות שוליים

↑  Antonin Guttman, R-Trees: A Dynamic, Index Structure for Spatial Searching, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, 1984
↑  Y. Manolopoulos; A. Nanopoulos; Y. Theodoridis. R-Trees: Theory and Applications, Springer, 2006
↑  Antonin Guttman, R-Trees: A Dynamic, Index Structure for Spatial Searching, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, 1984, p. 48
↑  Antonin Guttman, R-Trees: A Dynamic, Index Structure for Spatial Searching, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, 1984, pp. 49-50
↑  Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data - SIGMOD '90, 1990, pp. 325-326
↑  Antonin Guttman, R-Trees: A Dynamic, Index Structure for Spatial Searching, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, 1984, p. 52
↑  Diane Greene, An implementation and performance analysis of spatial data access methods, [1989] Proceedings. Fifth International Conference on Data Engineering, 1989, pp. 606–615
↑  Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data - SIGMOD '90, 1990, p. 326
↑  C. H Ang; T. C. Tan, New linear node splitting algorithm for R-trees. In Michel Scholl; Agnès Voisard. Proceedings of the 5th International Symposium on Advances in Spatial Databases (SSD '97), Berlin, Germany, July 15–18, 1997, Lecture Notes in Computer Science, Vol. 1262,pp. 337–349
↑  Antonin Guttman, R-Trees: A Dynamic, Index Structure for Spatial Searching, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, 1984, p. 51
↑  Antonin Guttman, R-Trees: A Dynamic, Index Structure for Spatial Searching, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, 1984, pp. 50-51
↑  Antonin Guttman, R-Trees: A Dynamic, Index Structure for Spatial Searching, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, 1984, pp. 48-49
↑  Nick Roussopoulos, Stephen Kelley, Frédéric Vincent, Nearest Neighbor Queries, In ACM SIGMOD record, vol. 24, no. 2, pp. 71-79. ACM, June 1995
↑  King Lum Cheung, and Ada Wai-Chee Fu. Enhanced nearest neighbour search on the R-tree, In ACM SIGMOD Record, vol. 27, no. 3, Sep. 1998, pp. 16-21
↑  הוגדרה על ידי: Orenstein, Jack A., Spatial query processing in an object-oriented database system, In ACM Sigmod Record, vol. 15, no. 2, p. 329. ACM, 1986. Harvard
↑  Brinkhoff, T., Kriegel, H.P. and Seeger, B., Efficient processing of spatial joins using R-trees, SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data (Vol. 22, No. 2), ACM, Vancouver, June 1993,, pp. 237-246
↑  Lo, Ming-Ling, and Chinya V. Ravishankar., Spatial joins using seeded trees. In ACM SIGMOD Record, vol. 23, no. 2, pp. 209-220. ACM, 1994.
↑  N. Roussopoulos and D. Leifker, Direct spatial search on pictorial databases using packed R-trees, Proceedings of the ACM SIGMOD Conference, Austin, TX, May 1985, pp. 17-31
↑  Leutenegger, Scott T.; Edgington, Jeffrey M.; Lopez, Mario A., STR: A Simple and Efficient Algorithm for R-Tree Packing, ICASE Report No. 97-14, 1997
↑  Arge, Lars, Klaus H. Hinrichs, Jan Vahrenhold, and Jeffrey Scott Vitter, Efficient bulk operations on dynamic R-trees, Algorithmica (Vol. 33, no. 1), Harvard, May 2002, pp. 104-128.
↑  L. Arge; M. de Berg; H. J. Haverkort; K. Yi, The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree, SIGMOD, 2004
↑  Timos Sellis, Nick Roussopoulos, and Christos Faloutsos, The R+-Tree: A dynamic index for multi-dimensional objects, Proceedings of 13th International Conference on Very Large Data Bases (VLDB), 1987, pp. 507-518
↑  Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data - SIGMOD '90, 1990, pp. 322-331
↑  Ibrahim Kamel and Christos Faloutsos, Hilbert R-tree: An improved R-tree using fractals, Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, September 1994, pp. 500-509
↑  Xiong, X. and Aref, W.G., R-trees with update memos, in: Computer Science Technical Reports, Paper 1634, Purdue University, October 2005
↑  Kamel, I. and Faloutsos, C., Parallel R-trees, In Proceedings of the 1992 ACM SIGMOD International conference on Management of data (SIGMOD), Vancouver, (Vol. 21, No. 2), pp. 195-204, June 1992
↑  Pfoser, Dieter, Christian S. Jensen, and Yannis Theodoridis. Novel approaches to the indexing of moving object trajectories. In Proceedings of the 26th International Conference on Very Large Databases (VLDB), Cairo, Egypt, pp. 395-406, September 2000.
↑  Šaltenis, Simonas, Christian S. Jensen, Scott T. Leutenegger, and Mario A. Lopez. Indexing the positions of continuously moving objects. In Proc. of the ACM Intl. Conf. on Management of Data, SIGMOD (Vol. 29, no. 2), pp. 331-342, May 2000
↑  Tao, Y., & Papadias, D, The MV3R-tree: A spatio-temporal access method for timestamp and interval queries, In Proceedings of Very Large Data Bases Conference (VLDB), Rome, pp. 431-440, September 2001,
↑  עץ MVR הוא וריאציה של עץ R שמבוססת על הרעיון של וריאציית עץ MVB עבור עץ B: ‏Becker, B., Gschwind, S., Ohler, T., Seeger, B., & Widmayer, P. An asymptotically optimal multiversion B-tree. The VLDB Journal - The International Journal on Very Large Data Bases, Vol. 5 (No. 4), pp. 264-275, 1996
↑  De Almeida, V. T., & Güting, R. H., Indexing the trajectories of moving objects in networks, pp. 1-27 (from GeoInformatica, Vol. 9 (No. 1), pp. 33-60), 2005.
↑  ניתן למדל את הרשת גם כקבוצה של קודקודים וקשתות, אבל זה פחות יעיל מעשית: De Almeida, V. T., & Güting, R. H., Indexing the trajectories of moving objects in networks, p. 6 (from GeoInformatica, Vol. 9 (No. 1), p. 49), 2005
↑  Cong, G., Jensen, C. S., & Wu, D. Efficient retrieval of the top-k most relevant spatial web objects, Proceedings of the VLDB Endowment, (Vol. 2, no. 1), 2009, pp. 337-348
↑  וריאציה זו מבוססת על עץ IR של Cong et al. קיימת וריאציה נוספת בשם עץ IR שהוצעה בנפרד בשנת 2011  (Z. Li, K. C. K. Lee, B. Zheng, W.-C. Lee, D. L. Lee, and X. Wang. IR-tree: An efficient index for geographic document search, IEEE Transactions on Knowledge and Data Engineering, Vol. 23, no. 4, pp. 585–599, 2011). כדי להבדיל בין הווריאציות מזכירים את שמות המחברים, או שלפעמים מכנים את הווריאציה השנייה בשם עץ IRLi.
↑  K-I. Lin, H. V. Jagadish and C. Faloutsos, The TV-Tree: An Index Structure for High-Dimensional Data, The VLDB Journal (Vol. 3, no. 4), pp. 519-520, 1994.
↑  S. Berchtold, D.A. Keim and H.P. Kriegel, The X-tree: An Index Structure for High-Dimensional Data, Proceedings of the 22nd VLDB Conference, Mumbai, India, pp. 29-31, 1996
↑  S. Berchtold, D.A. Keim and H.P. Kriegel, The X-tree: An Index Structure for High-Dimensional Data, Proceedings of the 22nd VLDB Conference, Mumbai, India, pp. 28-39, 1996
| מבני נתונים |
| --- | --- | --- |
| מבנים מופשטים | רשימה • מחסנית • קבוצה • מולטי קבוצה • תור • דו-תור • תור עדיפויות • מילון • מחרוזת • איחוד קבוצות זרות |  |
| מימושים ליניאריים | מערך • מערך משונן • טבלת גיבוב • רשימה מקושרת • רשימת דילוגים • חוצץ |  |
| גרפים ועצים | ערימה  (בינארית • בינומית • פיבונאצ'י) • עץ חיפוש  (עץ אדום שחור • עץ 2-3 • עץ 2-3-4) • עץ סיפות • עץ B • עץ +B • עץ AVL • עץ Splay • עץ BSP • עץ kd • עץ R‏ • Trie • X-fast trie • טריי y מהיר• עץ WAVL |  |
| הסתברותיים | מסנן בלום |  |
| --- | --- |
בקרת זהויות :  NKC: ph613265