메뉴 건너뛰기




Volumn , Issue , 2000, Pages 232-241

Hierarchical compact cube for range-max queries

Author keywords

[No Author keywords available]

Indexed keywords

DATA CUBE; NUMBER OF DATUM; ON-LINE ANALYTICAL PROCESSING; PRECOMPUTE; QUERY TIME; STORAGE REQUIREMENTS; UPDATE COSTS;

EID: 0008690131     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (26)

References (14)
  • 1
    • 0002896163 scopus 로고
    • Branch and bound methods: General formulation and properties
    • L. Mitten. "Branch and bound methods: General formulation and properties" in Operations Research, 18:24-34, 1970.
    • (1970) Operations Research , vol.18 , pp. 24-34
    • Mitten, L.1
  • 2
    • 0018999905 scopus 로고
    • Multidimensional divide and conquer
    • Jon Louis Bentley. "Multidimensional divide and conquer": In Comm. ACM, 23(4):2l4-229,1980
    • (1980) Comm. ACM , vol.23 , Issue.4
    • Bentley, J.L.1
  • 13
    • 0002535928 scopus 로고    scopus 로고
    • Hierarchical cubes for range-sum queries
    • Edinburgh, Scotland
    • Chee Yong Chan, Yannis E. loannidis. 'Hierarchical Cubes for Range-Sum Queries": Proceedings of the 2" VLDB Conference, Edinburgh, Scotland, 1999 pages 675-686.
    • (1999) Proceedings of the 2" VLDB Conference , pp. 675-686
    • Chan, C.Y.1    Loannidis, Y.E.2


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