메뉴 건너뛰기




Volumn 28, Issue 2, 1999, Pages 275-286

Join Synopses for Approximate Query Answering

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0345982315     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/304181.304207     Document Type: Article
Times cited : (260)

References (27)
  • 2
    • 0347941734 scopus 로고    scopus 로고
    • Join synopses for approximate query answering
    • Bell Laboratories, Murray Hill, New Jersey, Full version of the paper appearing in SIGMOD'99
    • S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy. Join synopses for approximate query answering. Technical report, Bell Laboratories, Murray Hill, New Jersey, 1999. Full version of the paper appearing in SIGMOD'99.
    • (1999) Technical Report
    • Acharya, S.1    Gibbons, P.B.2    Poosala, V.3    Ramaswamy, S.4
  • 3
    • 0029719644 scopus 로고    scopus 로고
    • The space complexity of approximating the frequency moments
    • May Full version to appear in JCSS special issue for STOC'96
    • N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proc. 28th ACM Symp. on the Theory of Computing, pages 20-29, May 1996. Full version to appear in JCSS special issue for STOC'96.
    • (1996) Proc. 28th ACM Symp. on the Theory of Computing , pp. 20-29
    • Alon, N.1    Matias, Y.2    Szegedy, M.3
  • 9
    • 0346050245 scopus 로고    scopus 로고
    • Selecting estimation procedures and bounds for approximate answering of aggregation queries
    • Bell Laboratories, Murray Hill New Jersey
    • P. B. Gibbons and Y. Matias. Selecting estimation procedures and bounds for approximate answering of aggregation queries. Technical report. Bell Laboratories, Murray Hill New Jersey, 1999.
    • (1999) Technical Report
    • Gibbons, P.B.1    Matias, Y.2
  • 10
    • 0001905015 scopus 로고    scopus 로고
    • Synopsis data structures for massive data sets
    • To appear. Available as Bell Labs tech. rep., Sept. 1998
    • P. B. Gibbons and Y. Matias. Synopsis data structures for massive data sets. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, 1999. To appear. Available as Bell Labs tech. rep., Sept. 1998, and at http://www.bell-labs.com/∼pbgibbons/.
    • (1999) DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
    • Gibbons, P.B.1    Matias, Y.2
  • 11
    • 0003559858 scopus 로고    scopus 로고
    • Aqua project white paper
    • Bell Laboratories, Murray Hill, New Jersey, December
    • P. B. Gibbons, Y. Matias, and V. Poosala. Aqua project white paper. Technical report, Bell Laboratories, Murray Hill, New Jersey, December 1997.
    • (1997) Technical Report
    • Gibbons, P.B.1    Matias, Y.2    Poosala, V.3
  • 13
    • 0347941733 scopus 로고    scopus 로고
    • Hoeffding inequalities for join-selectivity estimation and online aggregation
    • IBM Almaden Research Center, San Jose, CA
    • P. J. Haas. Hoeffding inequalities for join-selectivity estimation and online aggregation. Technical Report RJ 10040, IBM Almaden Research Center, San Jose, CA, 1996.
    • (1996) Technical Report RJ 10040
    • Haas, P.J.1
  • 27
    • 0027883367 scopus 로고
    • Approximate - A query processor that produces monotonically improving approximate answers
    • S. V. Vrbsky and J. W. S. Liu. Approximate - a query processor that produces monotonically improving approximate answers. IEEE Trans. on Knowledge and Data Engineering, 5(6):1056-1068, 1993.
    • (1993) IEEE Trans. on Knowledge and Data Engineering , vol.5 , Issue.6 , pp. 1056-1068
    • Vrbsky, S.V.1    Liu, J.W.S.2


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