메뉴 건너뛰기




Volumn , Issue , 2005, Pages 587-598

Relational confidence bounds are easy with the bootstrap

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; DATA STRUCTURES; INFERENCE ENGINES; LEARNING ALGORITHMS; PROBABILISTIC LOGICS; PROBLEM SOLVING; QUERY LANGUAGES; STATISTICAL METHODS;

EID: 29844444248     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066157.1066224     Document Type: Conference Paper
Times cited : (33)

References (21)
  • 1
    • 0033723117 scopus 로고    scopus 로고
    • Towards estimation error guarantees for distinct values
    • M. Charikar, S. Chaudhuri, R. Motwani, V.R. Narasayya: Towards Estimation Error Guarantees for Distinct Values. PODS 2000: 268-279
    • (2000) PODS , pp. 268-279
    • Charikar, M.1    Chaudhuri, S.2    Motwani, R.3    Narasayya, V.R.4
  • 5
    • 0008717161 scopus 로고
    • Sampling-based estimation of the number of distinct values of an attribute
    • P.J. Haas, J.F. Naughton, S. Seshadri, L. Stokes: Sampling-Based Estimation of the Number of Distinct Values of an Attribute. VIDB 1995: 311-322
    • (1995) VIDB , pp. 311-322
    • Haas, P.J.1    Naughton, J.F.2    Seshadri, S.3    Stokes, L.4
  • 6
    • 0030169435 scopus 로고    scopus 로고
    • Selectivity and cost estimation for joins based on random sampling
    • P.J. Haas, J.F. Naughton, S. Seshadri, A.N. Swami: Selectivity and Cost Estimation for Joins Based on Random Sampling. J. Comput. Syst. Sci. 52(3): 550-569 (1996)
    • (1996) J. Comput. Syst. Sci. , vol.52 , Issue.3 , pp. 550-569
    • Haas, P.J.1    Naughton, J.F.2    Seshadri, S.3    Swami, A.N.4
  • 7
    • 0030684315 scopus 로고    scopus 로고
    • Large-sample and deterministic confidence intervals for online aggregation
    • P.J. Haas: Large-Sample and Deterministic Confidence Intervals for Online Aggregation. SSDBM 1997: 51-63
    • (1997) SSDBM , pp. 51-63
    • Haas, P.J.1
  • 8
    • 0346501106 scopus 로고    scopus 로고
    • Ripple joins for online aggregation
    • P.J. Haas, J.M. Hellerstein: Ripple Joins for Online Aggregation. SIGMOD 1999: 287-298
    • (1999) SIGMOD , pp. 287-298
    • Haas, P.J.1    Hellerstein, J.M.2
  • 12
    • 0026274506 scopus 로고
    • Statistical estimators for aggregate relational algebra queries
    • W.-C. Hou, G. Özsoyoglu: Statistical Estimators for Aggregate Relational Algebra Queries. ACM Trans. Database Syst. 16(4): 600-654 (1991)
    • (1991) ACM Trans. Database Syst. , vol.16 , Issue.4 , pp. 600-654
    • Hou, W.-C.1    Özsoyoglu, G.2
  • 15
    • 0025446531 scopus 로고
    • Practical selectivity estimation through adaptive sampling
    • R.J. Lipton, J.F. Naughton, D.A. Schneider: Practical Selectivity Estimation through Adaptive Sampling. SIGMOD 1990: 1-11
    • (1990) SIGMOD , pp. 1-11
    • Lipton, R.J.1    Naughton, J.F.2    Schneider, D.A.3
  • 16
    • 62749117282 scopus 로고    scopus 로고
    • Uncertainty management for spatial data in databases: Fuzzy spatial data types
    • M. Schneider: Uncertainty Management for Spatial Data in Databases: Fuzzy Spatial Data Types. SSD 1999: 330-351
    • (1999) SSD , pp. 330-351
    • Schneider, M.1
  • 17
    • 84856043672 scopus 로고
    • A mathematical theory of communication
    • July and October
    • C. E. Shannon: A Mathematical Theory of Communication. Bell System Technical Journal, vol. 27: 379-423 and 623-656, (July and October, 1948)
    • (1948) Bell System Technical Journal , vol.27 , pp. 379-423
    • Shannon, C.E.1
  • 19
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • J. Ziv and A. Lempel: A Universal Algorithm for Sequential Data Compression. IEEE Trans. Inform. Theory, 23: 337-343 (1977)
    • (1977) IEEE Trans. Inform. Theory , vol.23 , pp. 337-343
    • Ziv, J.1    Lempel, A.2
  • 20
    • 29844445111 scopus 로고    scopus 로고
    • http://www.sas.com
  • 21
    • 29844432323 scopus 로고    scopus 로고
    • http://www.tpc.org/tpch


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