N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R* - tree: An Efficient and Robust Access Method for Points and Rectangles. Proceedings of ACM SIGMOD, pages 220-- 231, June 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Ranked Join Indices - Panayiotis Tsaparas Tsap (2003) (2 citations) (Correct)
No context found.
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R* - tree: An Efficient and Robust Access Method for Points and Rectangles. Proceedings of ACM SIGMOD, pages 220-- 231, June 1990.
Indexing Multi-Dimensional Uncertain Data with.. - Tao, Cheng, Xiao, .. (2005) (Correct)
No context found.
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In SIGMOD, pages 322--331, 1990.
Continuous K-Nearest Neighbor Search for Moving Objects - Yifan Li Jiong (Correct)
No context found.
N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. "The ##### tree: an efficient and robust access method for points and rectangles", SIGMOD, 1990.
Scalable QSF-Trees: Retrieving Regional Objects in.. - Orlandic, Yu (2004) (Correct)
No context found.
Beckmann, N., Kriegel, H., Schneider, R., & Seeger, B. (1990). The R -tree: An efficient and robust access method for points and rectangles. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 322-331.
Finding Similarity in Time Series Data by Method of Time.. - Moments Durga Toshniwal (Correct)
No context found.
Beckmann, N., Kriegel, H., Schneider, R. and Seeger, B. (1990): The R*-tree: An efficient and robust access method for points and rectangles. Proc. ACM SIGMOD International Conference, 322-331.
Zoning Multidimensional Access Methods for Analytical Database.. - Yu, Kim (Correct)
No context found.
N. Beckman, H. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. ACM SIGMOD International Conference on Management of Data, pages 322--331, 1990.
Providing Diversity in K-Nearest Neighbor Query - Results Anoop Jain (Correct)
No context found.
N. Beckmann, H. Kriegel, R. Schneider and B. Seeger, The R -tree: An efficient and robust access method for points and rectangles, Proc. of ACM SIGMOD Intl. Conf. on Management of Data, 1990.
Query and Update Efficient B+-Tree Based Indexing of Moving.. - Jensen, Lin, Ooi (2004) (Correct)
No context found.
N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In Proc. ACM SIGMOD, pp. 322--331, 1990.
Reverse kNN Search in Arbitrary Dimensionality - Dimitris (2004) (2 citations) (Correct)
No context found.
Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD, 1990.
MobiEyes: Distributed Processing of Continuously Moving Queries .. - Gedik, Liu (2004) (8 citations) (Correct)
No context found.
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-Tree: An efficient and robust access method for points and rectangles. In SIGMOD, 1990.
Virtual Reality in Assembly Simulation - Collision Detection.. - Zachmann (2000) (Correct)
No context found.
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. ACM SIGMOD Conf. on Management of Data, pages 322--331, 1990.
Indexing the Past, Present and Anticipated Future.. - Pelanis, Saltenis.. (2004) (Correct)
No context found.
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R -tree: An Efficient and Robust Access Method for Points and Rectangles. Proc. of SIGMOD, pp. 322--331, 1990.
Supporting Frequent Updates in R-Trees: A Bottom-Up Approach - Lee, Hsu, Jensen, Cui, Teo (2003) (11 citations) (Correct)
No context found.
N. Beckmann, H-P Kriegel, R. Schneider, and B. Seeger. The R -tree: An Efficient and Robust Access Method for Points and Rectangles. In ACM SIGMOD, 1990.
Fast Time Sequence Indexing for Arbitrary - Oung-Kee Yi Dept (2000) (Correct)
No context found.
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. ACM SIGMOD Conf., pages 322--331, Atlantic City, NJ, May 1990.
A Spatial Grid File For Multimedia Data Representation - Alpkocak, Ozkarahan (1997) (Correct)
No context found.
Beckman N, Kriegel HP (1990) The R*-tree: An Efficient And Robust Access Method For Points And Rectangles. Proceedings of ACM SIGMOD Conference, pp 332-331
R-Tree Based Indexing of General Spatio-Temporal Data - Saltenis, Jensen (1999) (1 citation) (Correct)
No context found.
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R -tree: An Efficient and Robust Access Method for Points and Rectangles. ACM SIGMOD'90, pp. 322--331.
Dynamic and Hierarchical Spatial Access Method using.. - Cho, Han, Lee, Park (2001) (Correct)
No context found.
Beakmann, N., Kriegel, H., Schneider, R., and Seeger, B. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. Proceedings of ACM SIGMOD International Conference on Management of Data, (Atlantic City, NJ, May 23-25). 1990, pp. 322-331.
Indexing of Moving Objects for Location-Based Services - Saltenis, Jensen (2002) (18 citations) (Correct)
No context found.
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The -tree: An Efficient and Robust Access Method for Points and Rectangles. Proc. of the ACM SIGMOD Conf., pp. 322-- 331, 1990.
Nearest Neighbor and Reverse Nearest Neighbor Queries.. - Rimantas Benetis.. (2002) (13 citations) (Correct)
No context found.
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-Tree: An Efficient and Robust Ac- cess Method for Points and Rectangles. In Proceedings of the 1990.
Representing Uncertainty In Spatial And Spatiotemporal Databases - Tøssebro (2002) (Correct)
No context found.
N. Beckmann, H.-P. 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, 1990, pp. 322-331.
R-Tree Based Indexing of Now-Relative Bitemporal Data - Rasa Bliujute Christian (1998) (2 citations) (Correct)
No context found.
N. Beckmann et al. The R -tree: An Efficient and Robust Access Method for Points and Rectangles. ACM SIGMOD '90, pp. 322--331.
Replicated Declustering of Spatial Data - Ferhatosmanoglu, Tosun.. (2004) (Correct)
No context found.
N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R* tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 322--331, May 23-25 1990.
Index Structures for Databases Containing Data Items with.. - Helmer (1997) (Correct)
No context found.
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The r -tree: An efficient and robust access method for points and rectangles. ACM SIGMOD Record, 19(2):322--331, June 1990.
Spatio-Temporal Data Services in a Shared-Nothing.. - Hadjieleftheriou.. (2004) (Correct)
No context found.
N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. of ACM Management of Data (SIGMOD), pages 220--231, 1990.
Skyline Index for Time Series Data - Li, Lopez, Moon (2003) (Correct)
No context found.
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R -Tree: An Efficient and Robust Access Method for Points and Rectangles. In Proceedings of the 1990.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC