메뉴 건너뛰기




Volumn 33, Issue 4, 2008, Pages

Scalable approximate query processing with the DBO engine

Author keywords

Online aggregation; Randomized algorithms; Sampling

Indexed keywords

AGGREGATE QUERIES; APPROXIMATE QUERY PROCESSING; EXPLORATORY DATA ANALYSES; ONLINE AGGREGATION; RANDOMIZED ALGORITHMS; RELATIONAL DATABASES;

EID: 57849140231     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1412331.1412335     Document Type: Article
Times cited : (74)

References (24)
  • 1
    • 0345982315 scopus 로고    scopus 로고
    • Join synopses for approximate query answering
    • ACHARYA, S., GIBBONS, P. B., POOSALA, V., AND RAMASWAMY, S. 1999. Join synopses for approximate query answering. SIGMOD Rec. 28, 2, 275-286.
    • (1999) SIGMOD Rec , vol.28 , Issue.2 , pp. 275-286
    • ACHARYA, S.1    GIBBONS, P.B.2    POOSALA, V.3    RAMASWAMY, S.4
  • 10
    • 0030169435 scopus 로고    scopus 로고
    • Selectivity and cost estimation for joins based on random sampling
    • HAAS, P. J., NAUGHTON, J. F., SESHADRI, S., AND SWAMI, A. N. 1996. Selectivity and cost estimation for joins based on random sampling. J. Comput. Syst. Sci. 52, 3, 550-569.
    • (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
  • 22
    • 84976660052 scopus 로고
    • Join processing in database systems with large main memories
    • SHAPIRO, L. D. 1986. Join processing in database systems with large main memories. ACM Trans. Database Syst. 11, 3, 239-264.
    • (1986) ACM Trans. Database Syst , vol.11 , Issue.3 , pp. 239-264
    • SHAPIRO, L.D.1
  • 23
    • 57849156788 scopus 로고    scopus 로고
    • STEFANOV, S. 2001. Separable Programming. Applied Optimization, 53. Kluwer Academic Publishers.
    • STEFANOV, S. 2001. Separable Programming. Applied Optimization, vol. 53. Kluwer Academic Publishers.


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