메뉴 건너뛰기




Volumn , Issue , 2004, Pages 160-169

Range counting over multidimensional data streams

Author keywords

Data streams; Range counting; approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ERROR ANALYSIS; ESTIMATION; INTERNET; NETWORK PROTOCOLS; OPTIMIZATION; PROBABILITY; QUERY LANGUAGES; STATISTICS;

EID: 4544266872     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997844     Document Type: Conference Paper
Times cited : (20)

References (28)
  • 1
    • 0000795886 scopus 로고    scopus 로고
    • Range searching
    • (J.E. Goodman and J. O'Rourke, eds.), CRC Press, Boca Raton
    • P.K. Agarwal. Range searching. IE Handbook of Discrete and Computational Geometry (J.E. Goodman and J. O'Rourke, eds.), CRC Press, Boca Raton, 1997, pp. 575-598.
    • (1997) IE Handbook of Discrete and Computational Geometry , pp. 575-598
    • Agarwal, P.K.1
  • 4
    • 0013360364 scopus 로고    scopus 로고
    • On irregularities of distribution. II
    • R. C. Baker. On irregularities of distribution. II. J. London Math. Soc. (2) 59 (1999), 50-64.
    • (1999) J. London Math. Soc. (2) , vol.59 , pp. 50-64
    • Baker, R.C.1
  • 5
    • 0001926808 scopus 로고
    • Irregularities of distribution. I
    • J. Beck. Irregularities of distribution. I. Acta Math. 159 (1987) (1-2), 1-49.
    • (1987) Acta Math. , vol.159 , Issue.1-2 , pp. 1-49
    • Beck, J.1
  • 6
    • 84963028444 scopus 로고
    • Irregularities of distribution. II
    • J. Beck. Irregularities of distribution. II. Proc. London Math. Soc. (3) 56 (1988), 1-50.
    • (1988) Proc. London Math. Soc. (3) , vol.56 , pp. 1-50
    • Beck, J.1
  • 9
    • 0024018076 scopus 로고
    • A functional approach to data structures and its use in multidimensional searching
    • B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM J. Computing 17 (3) (1988), 427-462.
    • (1988) SIAM J. Computing , vol.17 , Issue.3 , pp. 427-462
    • Chazelle, B.1
  • 11
    • 13544265613 scopus 로고    scopus 로고
    • On linear-time deterministic algorithms for optimization problems in fixed dimension
    • B. Chazelle and J. Matoušek. On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21 (1996), 579-597.
    • (1996) J. Algorithms , vol.21 , pp. 579-597
    • Chazelle, B.1    Matoušek, J.2
  • 12
    • 0000690281 scopus 로고
    • Quasi-optimal range searching in spaces of finite VC-dimension
    • B. Chazelle and E. Welzl. Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4 (5) (1989), 467-489.
    • (1989) Discrete Comput. Geom. , vol.4 , Issue.5 , pp. 467-489
    • Chazelle, B.1    Welzl, E.2
  • 13
    • 0034832347 scopus 로고    scopus 로고
    • Space-efficient online computation of quantile summaries
    • M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. ACM SIGMOD Record 30 (2) (2001), 58-66.
    • (2001) ACM SIGMOD Record , vol.30 , Issue.2 , pp. 58-66
    • Greenwald, M.1    Khanna, S.2
  • 14
    • 0025383763 scopus 로고
    • A guided tour of Chernoff bounds
    • T. Hagerup and C. Rüb. A guided tour of Chernoff bounds. Inf. Proc. Letts. 33 (1990), 305-308.
    • (1990) Inf. Proc. Letts. , vol.33 , pp. 305-308
    • Hagerup, T.1    Rüb, C.2
  • 16
    • 0242698558 scopus 로고    scopus 로고
    • Random sampling techniques for space efficient online computation of order statistics of large datasets
    • G.S. Manku, S. Rajagopalan, and B.C. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. ACM SIGMOD Record 28 (2) (1999), 251-262.
    • (1999) ACM SIGMOD Record , vol.28 , Issue.2 , pp. 251-262
    • Manku, G.S.1    Rajagopalan, S.2    Lindsay, B.C.3
  • 17
    • 21144462806 scopus 로고
    • Efficient partition trees
    • J. Matoušek. Efficient partition trees. Discrete Comput. Geom. 8 (1992), 315-334.
    • (1992) Discrete Comput. Geom. , vol.8 , pp. 315-334
    • Matoušek, J.1
  • 19
    • 0028742542 scopus 로고
    • Geometric range searching
    • J. Matoušek. Geometric range searching. ACM Computing Surveys 26 (4) (1994), 422-461.
    • (1994) ACM Computing Surveys , vol.26 , Issue.4 , pp. 422-461
    • Matoušek, J.1
  • 21
    • 51249161633 scopus 로고
    • Range searching with efficient hierarchical cuttings
    • J. Matoušek. Range searching with efficient hierarchical cuttings, Discrete Comput. Geom. 10 (1993), 157-182.
    • (1993) Discrete Comput. Geom. , vol.10 , pp. 157-182
    • Matoušek, J.1
  • 22
    • 51249164193 scopus 로고
    • Tight upper bounds for the discrepancy of half-spaces
    • J. Matoušek. Tight upper bounds for the discrepancy of half-spaces. Discrete Com. Geom. 13 (1995), 593-601.
    • (1995) Discrete Com. Geom. , vol.13 , pp. 593-601
    • Matoušek, J.1
  • 23
    • 0002361040 scopus 로고
    • Discrepancy and approximations for bounded VC-dimension
    • J. Matoušek, E. Welzl, and L. Wernisch. Discrepancy and approximations for bounded VC-dimension. Combinatorica 13 (1993), 455-466.
    • (1993) Combinatorica , vol.13 , pp. 455-466
    • Matoušek, J.1    Welzl, E.2    Wernisch, L.3
  • 24
    • 84872851578 scopus 로고
    • Selection and sorting with limited storage
    • 1980
    • J. I. Munro and M. S. Paterson. Selection and sorting with limited storage. Theoretical Computer Science 12 (1980) 315-323; 1980.
    • (1980) Theoretical Computer Science , vol.12 , pp. 315-323
    • Munro, J.I.1    Paterson, M.S.2
  • 26
    • 0001024505 scopus 로고
    • Chervonenkis. on the uniform convergence of relative frequencies of events to their probabilities
    • V.N. Vapnik and A.Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications 16 (1971), 264-280.
    • (1971) Theory of Probability and Its Applications , vol.16 , pp. 264-280
    • Vapnik, V.N.1    Ya, A.2
  • 27
    • 0022026217 scopus 로고
    • Random sampling with a reservoir
    • J.S. Vitter. Random sampling with a reservoir, ACM Trans. Math. Software 11 (1985), 37-57.
    • (1985) ACM Trans. Math. Software , vol.11 , pp. 37-57
    • Vitter, J.S.1
  • 28
    • 0021464004 scopus 로고
    • Faster methods for random sampling
    • J.S. Vitter. Faster methods for random sampling. Communications of ACM 27 (1984), 703-718.
    • (1984) Communications of ACM , vol.27 , pp. 703-718
    • Vitter, J.S.1


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