메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 51-

Space-efficient relative error order sketch over data streams

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAMING; RANDOMISED ALGORITHMS; RELATIVE ERRORS; SPACE COMPRESSION TECHNIQUES;

EID: 33749614111     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2006.145     Document Type: Conference Paper
Times cited : (25)

References (28)
  • 2
    • 3142749702 scopus 로고    scopus 로고
    • Approximate counts and quantiles over sliding windows
    • A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. In PODS04, 2004.
    • (2004) PODS04
    • Arasu, A.1    Manku, G.S.2
  • 4
    • 3142673606 scopus 로고    scopus 로고
    • Spatially-decaying aggregation over a network: Model and algorithms
    • E. Cohen and H. Kaplan. Spatially-decaying aggregation over a network: model and algorithms. In SIGMOD'04.
    • SIGMOD'04
    • Cohen, E.1    Kaplan, H.2
  • 5
    • 29844457932 scopus 로고    scopus 로고
    • Holistic aggregates in a networked world: Distributed tracking of approximate quantiles
    • C. Cormode, M. Garofalakis, S. Muthukrishnan, and R. Rastogi. Holistic aggregates in a networked world: Distributed tracking of approximate quantiles. In SIGMOD2005, 2005.
    • (2005) SIGMOD2005
    • Cormode, C.1    Garofalakis, M.2    Muthukrishnan, S.3    Rastogi, R.4
  • 8
    • 1142303698 scopus 로고    scopus 로고
    • Approximate join processing over data streams
    • A. Das, J. Gehrke, and M. Riedewald. Approximate join processing over data streams. In SIGMOD'03, 2003.
    • (2003) SIGMOD'03
    • Das, A.1    Gehrke, J.2    Riedewald, M.3
  • 9
    • 84968735289 scopus 로고    scopus 로고
    • Maintaining stream statistics over sliding windows: (Extended abstract)
    • M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows: (extended abstract). In SODA03, 2002.
    • (2002) SODA03
    • Datar, M.1    Gionis, A.2    Indyk, P.3    Motwani, R.4
  • 14
    • 85087223400 scopus 로고    scopus 로고
    • Power-conserving computation of order-statistics over sensor networks
    • M. Greenwald and S. Khanna. Power-conserving computation of order-statistics over sensor networks. In PODS'04.
    • PODS'04
    • Greenwald, M.1    Khanna, S.2
  • 15
    • 0034832347 scopus 로고    scopus 로고
    • Space-efficient online computation of quantile summaries
    • M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In SIGMOD'01, 2001.
    • (2001) SIGMOD'01
    • Greenwald, M.1    Khanna, S.2
  • 16
    • 0036203294 scopus 로고    scopus 로고
    • Approximating a data stream for querying and estimation: Algorithms and performance evaluation
    • S. Guha and N. Koudas. Approximating a data stream for querying and estimation: Algorithms and performance evaluation. In ICDE 2002, 2002.
    • (2002) ICDE 2002
    • Guha, S.1    Koudas, N.2
  • 19
    • 0038416086 scopus 로고    scopus 로고
    • Counting inversions in lists
    • A. Gupta and F. Zane. Counting inversions in lists. In SODA'03, 2003.
    • (2003) SODA'03
    • Gupta, A.1    Zane, F.2
  • 20
    • 84872851578 scopus 로고
    • Selection and sorting wiith limited storage
    • J.I.Munro and M.S.Paterson. Selection and sorting wiith limited storage. In TCS12, 1980.
    • (1980) TCS12
    • Munro, J.I.1    Paterson, M.S.2
  • 21
    • 0036366837 scopus 로고    scopus 로고
    • Mining database structure; or, how to build a data quality browser
    • T. Johnson, S. Muthukrishnan, T. Dasu, , and V. Shkapenyuk. Mining database structure; or, how to build a data quality browser. In SIGMOD, 2002.
    • (2002) SIGMOD
    • Johnson, T.1    Muthukrishnan, S.2    Dasu, T.3    Shkapenyuk, V.4
  • 22
    • 2442631384 scopus 로고    scopus 로고
    • Continuously maintaining quantile summaries of the most recent n elements over a data stream
    • X. Lin, H. Lu, J. Xu, and J. X. Yu. Continuously maintaining quantile summaries of the most recent n elements over a data stream. In ICDE, 2004.
    • (2004) ICDE
    • Lin, X.1    Lu, H.2    Xu, J.3    Yu, J.X.4
  • 24
    • 2442443820 scopus 로고    scopus 로고
    • Approximate frequency counts over data streams
    • G. Manku and R. Motwani. Approximate frequency counts over data streams. In VLDB 2002, 2002.
    • (2002) VLDB 2002
    • Manku, G.1    Motwani, R.2
  • 25
    • 0242698558 scopus 로고    scopus 로고
    • Random sampling techniques for space efficient online computation of order statistics of large datasets
    • G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. In SIGMOD, 1999.
    • (1999) SIGMOD
    • Manku, G.S.1    Rajagopalan, S.2    Lindsay, B.G.3
  • 26
    • 33749620465 scopus 로고    scopus 로고
    • Improved histograms for selectivity estimation of range predicates
    • V. Poosala, P. Haas, Y. Ioannidis, and E. Shekita. Improved histograms for selectivity estimation of range predicates. In VLDB'96, 1996.
    • (1996) VLDB'96
    • Poosala, V.1    Haas, P.2    Ioannidis, Y.3    Shekita, E.4
  • 27
    • 0041566698 scopus 로고    scopus 로고
    • Estimation of query-result distribution and its application in parallel-join load balancing
    • V. Poosala and Y. Ioannidis. Estimation of query-result distribution and its application in parallel-join load balancing. In The VLDB Journal, 1996.
    • (1996) The VLDB Journal
    • Poosala, V.1    Ioannidis, Y.2
  • 28
    • 33745534630 scopus 로고    scopus 로고
    • False positive or false negative: Mining frequent itemsets from high speed transactional data streams
    • J. Yu, Z. Chong, H. Lu, and A. Zhou. False positive or false negative: Mining frequent itemsets from high speed transactional data streams. In VLDB'04, 2004.
    • (2004) VLDB'04
    • Yu, J.1    Chong, Z.2    Lu, H.3    Zhou, A.4


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