메뉴 건너뛰기




Volumn 4, Issue 1, 2008, Pages

The priority R-tree: A practically efficient and worst-case optimal R-tree

Author keywords

R trees

Indexed keywords

DISTRIBUTED DATA; R-TREES;

EID: 42149192617     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1328911.1328920     Document Type: Article
Times cited : (102)

References (26)
  • 3
    • 4344672356 scopus 로고    scopus 로고
    • I/O-Efficient dynamic planar point location
    • ARGE, L., AND VAHRENHOLD, J. 2004. I/O-Efficient dynamic planar point location. Comput. Geom. Theory Appl. 29, 2, 147-162.
    • (2004) Comput. Geom. Theory Appl , vol.29 , Issue.2 , pp. 147-162
    • ARGE, L.1    VAHRENHOLD, J.2
  • 4
    • 0141686142 scopus 로고    scopus 로고
    • Efficient bulk operations on dynamic R-trees
    • ARGE, L., HINRICHS, K. H., VAHRENHOLD, J., AND VITTER, J. S. 2002a. Efficient bulk operations on dynamic R-trees. Algorithmica 33, 1, 104-128.
    • (2002) Algorithmica , vol.33 , Issue.1 , pp. 104-128
    • ARGE, L.1    HINRICHS, K.H.2    VAHRENHOLD, J.3    VITTER, J.S.4
  • 6
    • 0015489880 scopus 로고
    • Organization and maintenance of large ordered indexes
    • BAYER, R., AND MCCREIGHT, E. 1972. Organization and maintenance of large ordered indexes. Acta Inf. 1, 173-189.
    • (1972) Acta Inf , vol.1 , pp. 173-189
    • BAYER, R.1    MCCREIGHT, E.2
  • 8
    • 84890541133 scopus 로고    scopus 로고
    • Improving the query performance of high-dimensional index structures by bulk load operations
    • Proceedings of the Conference on Extending Database Technology, Springer
    • BERCHTOLD, S., BÖHM, C., AND KRIEGEL, H.-P. 1998. Improving the query performance of high-dimensional index structures by bulk load operations. In Proceedings of the Conference on Extending Database Technology. Lecture Notes in Computer Science, vol. 1377. Springer, 216-230.
    • (1998) Lecture Notes in Computer Science , vol.1377 , pp. 216-230
    • BERCHTOLD, S.1    BÖHM, C.2    KRIEGEL, H.-P.3
  • 9
    • 0037853259 scopus 로고    scopus 로고
    • LR-Tree: A logarithmic decomposable spatial index method
    • BOZANIS, P., NANOPOULOS, A., AND MANOLOPOULOS, Y. 2003. LR-Tree: A logarithmic decomposable spatial index method. The Comput. J. 46, 3, 319-331.
    • (2003) The Comput. J , vol.46 , Issue.3 , pp. 319-331
    • BOZANIS, P.1    NANOPOULOS, A.2    MANOLOPOULOS, Y.3
  • 11
    • 0018480749 scopus 로고
    • The ubiquitous B-tree
    • COMER, D. 1979. The ubiquitous B-tree. ACM Comput. Surv. 11, 2, 121-137.
    • (1979) ACM Comput. Surv , vol.11 , Issue.2 , pp. 121-137
    • COMER, D.1
  • 13
    • 0032083561 scopus 로고    scopus 로고
    • Multidimensional access methods
    • GAEDE, V., AND GÜNTHER, O. 1998. Multidimensional access methods. ACM Comput. Surv. 30, 2, 170-231.
    • (1998) ACM Comput. Surv , vol.30 , Issue.2 , pp. 170-231
    • GAEDE, V.1    GÜNTHER, O.2
  • 19
    • 84947262282 scopus 로고    scopus 로고
    • Optimal dynamic range searching in non-replicating index structures
    • Proceedings of the International Conference on Database Theory, Springer
    • KANTH, K. V. R., AND SINGH, A. K. 1999. Optimal dynamic range searching in non-replicating index structures. In Proceedings of the International Conference on Database Theory. Lecture Notes in Computer Science, vol. 154. Springer, 257-276.
    • (1999) Lecture Notes in Computer Science , vol.154 , pp. 257-276
    • KANTH, K.V.R.1    SINGH, A.K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.