메뉴 건너뛰기




Volumn 5071 LNCS, Issue , 2008, Pages 139-152

Virtual forced splitting, demotion and the BV-tree

Author keywords

[No Author keywords available]

Indexed keywords

HELIUM; INFORMATION THEORY; KNOWLEDGE BASED SYSTEMS; MILITARY CONSTRUCTION EQUIPMENT; SUPERVISORY PERSONNEL;

EID: 54249108429     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70504-8_13     Document Type: Conference Paper
Times cited : (1)

References (11)
  • 1
    • 0025447750 scopus 로고
    • The R*-tree: An efficient and robust access method for points and rectangles
    • Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proc, ACM SIGMOD, pp. 322-331 (1990)
    • (1990) Proc, ACM SIGMOD , pp. 322-331
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 2
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • Bentley, J.L.: Multidimensional binary search trees used for associative searching. Comm. ACM 18(9), 509-517 (1985)
    • (1985) Comm. ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 3
    • 84976765201 scopus 로고
    • A general solution of the n-dimensional B-tree problem
    • San Jose, California, May
    • Freeston, M.: A general solution of the n-dimensional B-tree problem. In: Proc. ACM SIGMOD, San Jose, California, May 1995, pp. 80-91 (1995)
    • (1995) Proc. ACM SIGMOD , pp. 80-91
    • Freeston, M.1
  • 6
    • 84976747179 scopus 로고
    • The BANG file: A new kind of grid file
    • San Francisco, May
    • Freeston, M.: The BANG file: A new kind of grid file. In: Proc. ACM SIGMOD, San Francisco, May 1987, pp. 260-269 (1987)
    • (1987) Proc. ACM SIGMOD , pp. 260-269
    • Freeston, M.1
  • 7
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • Guttman, A.: R-trees: A dynamic index structure for spatial searching, SIGMOD Record 14(2), 47-57 (1984)
    • (1984) SIGMOD Record , vol.14 , Issue.2 , pp. 47-57
    • Guttman, A.1
  • 9
    • 85010847034 scopus 로고
    • The K-D-B-tree: A search structure for large multidimensional dynamic indexes
    • Robinson, J.T.: The K-D-B-tree: A search structure for large multidimensional dynamic indexes. In: Proc. ACM SIGMOD, pp. 10-18 (1981)
    • (1981) Proc. ACM SIGMOD , pp. 10-18
    • Robinson, J.T.1
  • 10
    • 11344253943 scopus 로고    scopus 로고
    • Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
    • Samet, H.: Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing. ACM Trans. Database Syst. 29(4), 789-830 (2004)
    • (2004) ACM Trans. Database Syst , vol.29 , Issue.4 , pp. 789-830
    • Samet, H.1
  • 11
    • 54249144239 scopus 로고    scopus 로고
    • PhD thesis. School of Computer Science. University of Birmingham, UK , due for completion, May
    • Swinbank, R.: Virtual Forced Splitting in Multidimensional Access Methods. PhD thesis. School of Computer Science. University of Birmingham, UK (2008) (due for completion, May 2008)
    • (2008) Virtual Forced Splitting in Multidimensional Access Methods
    • Swinbank, R.1


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