메뉴 건너뛰기




Volumn 27, Issue 3, 2002, Pages 261-298

Fast incremental maintenance of approximate histograms

Author keywords

Algorithms; Approximation; Experimentation; H.2.4 Database Management : Systems Query processing; Histograms; Incremental maintenance; Performance; Query optimization; Sampling

Indexed keywords

HISTOGRAMS; INCREMENTAL MAINTENANCE; QUERY OPTIMIZATION;

EID: 0041401239     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/581751.581753     Document Type: Article
Times cited : (98)

References (33)
  • 8
    • 0021443979 scopus 로고
    • Implications of certain assumptions in database performance evaluation
    • CHRISTODOULAKIS, S. 1984. Implications of certain assumptions in database performance evaluation. ACM Trans. Database Syst. 9, 2 (June), 163-186.
    • (1984) ACM Trans. Database Syst. , vol.9 , Issue.2 JUNE , pp. 163-186
    • Christodoulakis, S.1
  • 11
    • 84944323337 scopus 로고    scopus 로고
    • Distinct sampling for highly-accurate answers to distinct values queries and event reports
    • Morgan Kaufman, Rome
    • GIBBONS, P. B. 2001. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In Proceedings of the 27th International Conference on Very Large Data Bases, Morgan Kaufman, Rome, 541-550.
    • (2001) Proceedings of the 27th International Conference on Very Large Data Bases , pp. 541-550
    • Gibbons, P.B.1
  • 21
    • 0012313278 scopus 로고    scopus 로고
    • Combining histograms and parametric curve fitting for feedback-driven query result-size estimation
    • Morgan Kaufman, Edinburgh
    • KONIG, A. C. AND WEIKUM, G. 1999. Combining histograms and parametric curve fitting for feedback-driven query result-size estimation. In Proceedings of the 25th International Conference on Very Large Databases, Morgan Kaufman, Edinburgh, 423-434.
    • (1999) Proceedings of the 25th International Conference on Very Large Databases , pp. 423-434
    • Konig, A.C.1    Weikum, G.2
  • 30
    • 0023213138 scopus 로고
    • A logarithmic time sort for linear size networks
    • REIF, J. H. AND VALIANT, L. G. 1987. A logarithmic time sort for linear size networks. J. ACM 34, 1, 60-76.
    • (1987) J. ACM , vol.34 , Issue.1 , pp. 60-76
    • Reif, J.H.1    Valiant, L.G.2
  • 32
    • 0022026217 scopus 로고
    • Random sampling with a reservoir
    • VITTER, J. S. 1985. Random sampling with a reservoir. ACM Trans. Math. Softw. 11, 37-57.
    • (1985) ACM Trans. Math. Softw. , vol.11 , pp. 37-57
    • Vitter, J.S.1


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