메뉴 건너뛰기




Volumn 101, Issue 1, 2007, Pages 6-12

Execution time analysis of a top-down R-tree construction algorithm

Author keywords

Bulk loading; Data structures; Packing; R trees; Spatial databases

Indexed keywords

DATA PROCESSING; DATA STRUCTURES; DATABASE SYSTEMS; TIME DOMAIN ANALYSIS; TREES (MATHEMATICS);

EID: 33750301207     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.07.010     Document Type: Article
Times cited : (19)

References (11)
  • 1
    • 84979081063 scopus 로고    scopus 로고
    • Efficient bulk operations on dynamic R-trees
    • ALENEX'99: Proc. of the 1st Workshop on Algorithm Engineering and Experimentation Baltimore, MD, Jan. 1999, Springer, Berlin
    • Arge L., Hinrichs K.H., Vahrenhold J., and Vitter J.S. Efficient bulk operations on dynamic R-trees. ALENEX'99: Proc. of the 1st Workshop on Algorithm Engineering and Experimentation Baltimore, MD, Jan. 1999. Lecture Notes in Computer Science vol. 1619 (1999), Springer, Berlin 328-348
    • (1999) Lecture Notes in Computer Science , vol.1619 , pp. 328-348
    • Arge, L.1    Hinrichs, K.H.2    Vahrenhold, J.3    Vitter, J.S.4
  • 2
    • 0025447750 scopus 로고    scopus 로고
    • *-tree: An efficient and robust access method for points and rectangles, in: SIGMOD'90: Proc. of the Internat. Conf. on Management of Data, Atlantic City, NJ, May 1990, pp. 322-331
  • 3
    • 85020464509 scopus 로고    scopus 로고
    • L. Chen, R. Choubey, E.A. Rundensteiner, Bulk-insertions into R-trees using the Small-Tree-Large-Tree approach, in: GIS'98: Proc. of the 6th ACM Intl. Symp. on Advances in Geographic Information Systems, Washington, DC, 1998, pp. 161-162
  • 4
    • 0018480749 scopus 로고
    • The ubiquitous B-tree
    • Comer D. The ubiquitous B-tree. ACM Comput. Surv. 11 2 (1979) 121-137
    • (1979) ACM Comput. Surv. , vol.11 , Issue.2 , pp. 121-137
    • Comer, D.1
  • 5
    • 33750319575 scopus 로고    scopus 로고
    • Y.J. García, M.A. López, S.T. Leutenegger, A greedy algorithm for bulk loading R-trees, Computer Science Technical Report 97-02, University of Denver, Denver, CO, 1997
  • 6
    • 84980369271 scopus 로고    scopus 로고
    • Y.J. García, M.A. López, S.T. Leutenegger, A greedy algorithm for bulk loading R-trees, in: GIS'98: Proc. of the 6th ACM Intl. Symp. on Advances in Geographic Information Systems, Washington, DC, 1998, pp. 163-164
  • 7
    • 85031999247 scopus 로고    scopus 로고
    • A. Guttman, R-trees: A dynamic index structure for spatial searching, in: SIGMOD'84: Proc. of the Intl. Conf. on Management of Data, Boston, MA, June 1984, pp. 47-57
  • 8
    • 0027835372 scopus 로고    scopus 로고
    • I. Kamel, C. Faloutsos, On packing R-trees, in: CIKM'93: Proc. of the 2nd Intl. Conf. on Information and Knowledge Management, Washington, DC, Nov. 1993, pp. 490-499
  • 9
    • 85140867935 scopus 로고    scopus 로고
    • N. Roussopoulos, D. Leifker, Direct spatial search on pictorial databases using packed R-trees, in: SIGMOD'85: Proc. of the Intl. Conf. on Management of Data, Austin, TX, May 1985, pp. 17-31
  • 11
    • 84994175813 scopus 로고    scopus 로고
    • J. van den Bercken, B. Seeger, P. Widmayer, A generic approach to bulk loading multidimensional index structures, in: VLDB'97: Proc. of the 23rd Intl. Conf. on Very Large Databases, Athens, Greece, Aug. 1997, pp. 406-415


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