메뉴 건너뛰기




Volumn , Issue , 2005, Pages 563-574

A disk-based join with probabilistic guarantees

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATE FUNCTIONS; ANALYTIC QUERY PROCESSING; STATISTICAL ESTIMATOR;

EID: 29844455629     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066157.1066222     Document Type: Conference Paper
Times cited : (31)

References (18)
  • 4
    • 29844443461 scopus 로고    scopus 로고
    • Progressive merge join: A generic and non-blocking sort-based join algorithm
    • J.-P. Dittrich, B. Seeger, D.S. Taylor, P. Widmayer: Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm. VLDB 2002: 299-310
    • (2002) VLDB , pp. 299-310
    • Dittrich, J.-P.1    Seeger, B.2    Taylor, D.S.3    Widmayer, P.4
  • 5
  • 6
    • 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
  • 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
    • 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. Com. Syst. Sci. 52(3): 550-569 (1996)
    • (1996) J. Com. Syst. Sci. , vol.52 , Issue.3 , pp. 550-569
    • Haas, P.J.1    Naughton, J.F.2    Seshadri, S.3    Swami, A.N.4
  • 11
    • 85139798659 scopus 로고
    • Statistical estimators for relational algebra expressions
    • W.-C. Hou, G. Özsoyoglu, B.K. Taneja: Statistical Estimators for Relational Algebra Expressions. PODS 1988: 276-287
    • (1988) PODS , pp. 276-287
    • Hou, W.-C.1    Özsoyoglu, G.2    Taneja, B.K.3
  • 12
    • 84976802986 scopus 로고
    • Processing aggregate relational queries with hard time constraints
    • W.-C. Hou, G. Özsoyoglu, B.K. Taneja: Processing Aggregate Relational Queries with Hard Time Constraints. SIGMOD 1989:68-77
    • (1989) SIGMOD , pp. 68-77
    • Hou, W.-C.1    Özsoyoglu, G.2    Taneja, B.K.3
  • 14
    • 0036203052 scopus 로고    scopus 로고
    • A non-blocking parallel spatial join algorithm
    • G. Luo, J.F. Naughton, C. Ellmann: A Non-Blocking Parallel Spatial Join Algorithm. ICDE 2002; 697-705
    • (2002) ICDE , pp. 697-705
    • Luo, G.1    Naughton, J.F.2    Ellmann, C.3
  • 15
    • 0025446214 scopus 로고
    • Random sampling from hash files
    • F. Olken, D. Rotem, P. Xu: Random Sampling from Hash Files. SIGMOD 1990: 375-386
    • (1990) SIGMOD , pp. 375-386
    • Olken, F.1    Rotem, D.2    Xu, P.3
  • 16
    • 0024719177 scopus 로고
    • Random sampling from B+-trees
    • F. Olken, D. Rotem: Random Sampling from B+-Trees. VLDB 1989: 269-277
    • (1989) VLDB , pp. 269-277
    • Olken, F.1    Rotem, D.2
  • 17
    • 84976660052 scopus 로고
    • Join processing in database systems with large main memories
    • L.D. Shapiro: Join Processing in Database Systems with Large Main Memories. ACM Trans. Database Syst. 11(3): 239-264 (1986)
    • (1986) ACM Trans. Database Syst. , vol.11 , Issue.3 , pp. 239-264
    • Shapiro, L.D.1


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