메뉴 건너뛰기




Volumn , Issue , 2007, Pages 725-736

Scalable approximate query processing with the DBO engine

Author keywords

DBO; Online aggregation; Randomized algorithms; Sampling

Indexed keywords

DATA REDUCTION; INFORMATION MANAGEMENT; INFORMATION RETRIEVAL; RELATIONAL DATABASE SYSTEMS; SAMPLING;

EID: 35449000607     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247480.1247560     Document Type: Conference Paper
Times cited : (60)

References (20)
  • 4
    • 1142275488 scopus 로고    scopus 로고
    • Peter Widmayer: On producing join results early
    • J.-P. Dittrich, B. Seeger, D.S. Taylor, Peter Widmayer: On producing join results early. PODS 2003: 134-142
    • (2003) PODS , pp. 134-142
    • Dittrich, J.-P.1    Seeger, B.2    Taylor, D.S.3
  • 5
    • 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
  • 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
  • 12
    • 0026676135 scopus 로고
    • Processing Real-Time, Non-Aggregate Queries with Time-Constraints in CASE-DB
    • G. Özsoyoglu, K. Du, S.G. Swamy, W.-C. Hou: Processing Real-Time, Non-Aggregate Queries with Time-Constraints in CASE-DB. ICDE 1992:410-417
    • (1992) ICDE , pp. 410-417
    • Özsoyoglu, G.1    Du, K.2    Swamy, S.G.3    Hou, W.-C.4
  • 14
    • 33745602802 scopus 로고    scopus 로고
    • Online Estimation for Subset-Based SQL Queries
    • C. Jermaine, A. Dobra, A. Pol, S. Joshi: Online Estimation for Subset-Based SQL Queries. VLDB 2005: 745-756.
    • (2005) VLDB , pp. 745-756
    • Jermaine, C.1    Dobra, A.2    Pol, A.3    Joshi, S.4
  • 17
    • 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
  • 18
    • 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
  • 19
    • 84976660052 scopus 로고
    • Join Processing in Database Systems with Large Main Memories
    • L.D. Shapiro: Join Processing in Database Systems with Large Main Memories. ACM TODS 11(3): 239-264 (1986)
    • (1986) ACM TODS , vol.11 , Issue.3 , pp. 239-264
    • Shapiro, L.D.1


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