메뉴 건너뛰기




Volumn 12, Issue 3, 2003, Pages 262-283

Incremental computation and maintenance of temporal aggregates

Author keywords

Access methods; Aggregation; B tree; Segment tree; Temporal database; View maintenance

Indexed keywords

ALGORITHMS; DATA HANDLING; QUERY LANGUAGES;

EID: 0142200483     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-003-0107-z     Document Type: Article
Times cited : (80)

References (25)
  • 1
    • 0015489880 scopus 로고
    • Organization and maintenance of large ordered indices
    • Bayer R, McCreight EM (1972) Organization and maintenance of large ordered indices. Acta Informat 1:173-189
    • (1972) Acta Informat , vol.1 , pp. 173-189
    • Bayer, R.1    McCreight, E.M.2
  • 4
    • 0037621005 scopus 로고
    • Techniques for processing of aggregates in relational database systems
    • University of California, Berkeley, CA
    • Epstein R (1979) Techniques for processing of aggregates in relational database systems. Technical Report UCB/ERL M7918, University of California, Berkeley, CA
    • (1979) Technical Report , vol.UCB-ERL M7918
    • Epstein, R.1
  • 9
    • 0142259543 scopus 로고    scopus 로고
    • Java SB-tree library
    • Hadjieleftheriou M (2001) Java SB-tree library. http://www.cs.ucr.edu/̃marioh/sbtree/.
    • (2001)
    • Hadjieleftheriou, M.1
  • 17
    • 84894104746 scopus 로고    scopus 로고
    • Comparison of access methods for time-evolving data
    • Salzberg B, Tsotras VJ (1999) Comparison of access methods for time-evolving data. ACM Comput Surv 21(2):158-221
    • (1999) ACM Comput Surv , vol.21 , Issue.2 , pp. 158-221
    • Salzberg, B.1    Tsotras, V.J.2


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