메뉴 건너뛰기




Volumn 31, Issue 3, 2006, Pages 1095-1133

An integrated efficient solution for computing frequent and top-k elements in data streams

Author keywords

Advertising networks; Approximate queries; Continuous queries; Data streams; Exact queries; Frequent elements; Top k elements; Zipfian data

Indexed keywords

APPROXIMATE QUERIES; CONTINUOUS QUERIES; DATA STREAMS; EXACT QUERIES; FREQUENT ELEMENTS; TOP-K ELEMENTS; ZIPFIAN DATA;

EID: 33750185779     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1166074.1166084     Document Type: Conference Paper
Times cited : (148)

References (47)
  • 3
    • 5444267959 scopus 로고    scopus 로고
    • The CQL continuous query language: Semantic foundations and query execution
    • Stanford University, Stanford, CA
    • ARASU, A., BABU, S., AND WIDOM, J. 2003b. The CQL Continuous Query Language: Semantic foundations and query execution. Tech. rep. 2002-67. Stanford University, Stanford, CA.
    • (2003) Tech. Rep. , vol.2002 , Issue.67
    • Arasu, A.1    Babu, S.2    Widom, J.3
  • 6
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • BLOOM, B. H. 1970. Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13, 7, 422-426.
    • (1970) Commun. ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 9
    • 1142296951 scopus 로고
    • A fast majority vote algorithm
    • Institute for Computing Science, University of Texas, Austin, Austin, TX
    • BOYER, R. AND MOORE, J. 1981. A fast majority vote algorithm. Tech. rep. 1981-32. Institute for Computing Science, University of Texas, Austin, Austin, TX.
    • (1981) Tech. Rep. , vol.1981 , Issue.32
    • Boyer, R.1    Moore, J.2
  • 18
    • 2442583610 scopus 로고    scopus 로고
    • New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
    • ESTAN, C. AND VARGHESE, G. 2003. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Trans. Comput. Syst. 21, 3, 270-313.
    • (2003) ACM Trans. Comput. Syst. , vol.21 , Issue.3 , pp. 270-313
    • Estan, C.1    Varghese, G.2
  • 21
    • 0040286013 scopus 로고
    • Finding a majority among N votes: Solution to problem 81-5
    • FISCHER, M. AND SALZBERG, S. 1982. Finding a majority among N votes: Solution to problem 81-5. J. Algorith. 3, 376-379.
    • (1982) J. Algorith. , vol.3 , pp. 376-379
    • Fischer, M.1    Salzberg, S.2
  • 22
    • 0020828424 scopus 로고
    • Probabilistic counting algorithms
    • FLAJOLET, P. AND MARTIN, G. 1985. Probabilistic counting algorithms. J. Comput. Syst. Sci. 31, 182-209.
    • (1985) J. Comput. Syst. Sci. , vol.31 , pp. 182-209
    • Flajolet, P.1    Martin, G.2
  • 27
    • 2442617843 scopus 로고    scopus 로고
    • Issues in data stream management
    • GOLAB, L. AND OZSU, M. 2003. Issues in data stream management. ACM SIGMOD Rec. 32, 2, 5-14.
    • (2003) ACM SIGMOD Rec. , vol.32 , Issue.2 , pp. 5-14
    • Golab, L.1    Ozsu, M.2
  • 34
    • 0348164422 scopus 로고
    • Algorithm 65: Find
    • HOARE, C. 1961. Algorithm 65: Find. Commun. ACM 4, 7, 321-322.
    • (1961) Commun. ACM , vol.4 , Issue.7 , pp. 321-322
    • Hoare, C.1
  • 36
    • 0348252034 scopus 로고    scopus 로고
    • A simple algorithm for finding frequent elements in streams and bags
    • KARP, R., SHENKER, S., AND PAPADIMITRIOU, C. 2003. A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28, 1, 51-55.
    • (2003) ACM Trans. Database Syst. , vol.28 , Issue.1 , pp. 51-55
    • Karp, R.1    Shenker, S.2    Papadimitriou, C.3
  • 37
    • 0031540315 scopus 로고    scopus 로고
    • Analysis of Hoare's FIND algorithm with median-of-three partition
    • KIRSCHENHOFER, P., PRODINGER, H., AND MARINEZ, C. 1997. Analysis of Hoare's FIND algorithm with median-of-three partition. Random Struct. Algorith. 10, 1-2, 143-156.
    • (1997) Random Struct. Algorith. , vol.10 , Issue.1-2 , pp. 143-156
    • Kirschenhofer, P.1    Prodinger, H.2    Marinez, C.3
  • 42
    • 33745623047 scopus 로고    scopus 로고
    • Duplicate detection in click streams
    • An extended version appears as a University of California, Santa Barbara, Department of Computer Science Technical Report 2004-23
    • METWALLY, A., AGRAWAL, D., AND EL ABBADI, A. 2005a. Duplicate detection in click streams. In Proceedings of the 14th WWW International World Wide Web Conference. 12-21. An extended version appears as a University of California, Santa Barbara, Department of Computer Science Technical Report 2004-23.
    • (2005) Proceedings of the 14th WWW International World Wide Web Conference , pp. 12-21
    • Metwally, A.1    Agrawal, D.2    El Abbadi, A.3
  • 43
    • 77049088731 scopus 로고    scopus 로고
    • Efficient computation of frequent and top-k elements in data streams
    • An extended version appears as a University of California, Santa Barbara, Department of Computer Science, Technical Report 2005-23
    • METWALLY, A., AGRAWAL, D., AND EL ABBADI, A. 2005b. Efficient computation of frequent and top-k elements in data streams. In Proceedings of the 10th ICDT International Conference on Database Theory. 398-412. An extended version appears as a University of California, Santa Barbara, Department of Computer Science, Technical Report 2005-23.
    • (2005) Proceedings of the 10th ICDT International Conference on Database Theory , pp. 398-412
    • Metwally, A.1    Agrawal, D.2    El Abbadi, A.3
  • 45
    • 0025449292 scopus 로고
    • A linear-time probabilistic counting algorithm for database applications
    • WHANG, K., VANDER-ZANDEN, B., AND TAYLOR, H. 1990. A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Syst. 15, 208-229.
    • (1990) ACM Trans. Database Syst. , vol.15 , pp. 208-229
    • Whang, K.1    Vander-Zanden, B.2    Taylor, H.3


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