-
3
-
-
5444267959
-
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
-
4
-
-
0036042175
-
Models and issues in data stream systems
-
BABCOCK, B., BABU, S., DATAR, M., MOTWANI, R., AND WIDOM, J. 2002. Models and issues in data stream systems. In Proceedings of the 21st ACM PODS Symposium on Principles of Database Systems. 1-16.
-
(2002)
Proceedings of the 21st ACM PODS Symposium on Principles of Database Systems
, pp. 1-16
-
-
Babcock, B.1
Babu, S.2
Datar, M.3
Motwani, R.4
Widom, J.5
-
6
-
-
0014814325
-
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
-
8
-
-
33750178210
-
Bounds for frequency estimation of packet streams
-
BOSE, P., KRANAKIS, E., MORIN, P., AND TANG, Y. 2003. Bounds for frequency estimation of packet streams. In Proceedings of the 10th SIROCCO International Colloquium on Structural Information and Communication Complexity, 33-42.
-
(2003)
Proceedings of the 10th SIROCCO International Colloquium on Structural Information and Communication Complexity
, pp. 33-42
-
-
Bose, P.1
Kranakis, E.2
Morin, P.3
Tang, Y.4
-
9
-
-
1142296951
-
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
-
10
-
-
84869158135
-
Finding frequent items in data streams
-
CHARIKAR, M., CHEN, K., AND FARACH-COLTON, M. 2002. Finding frequent items in data streams. In Proceedings of the 29th ICALP International Colloquium on Automata, Languages and Programming. 693-703.
-
(2002)
Proceedings of the 29th ICALP International Colloquium on Automata, Languages and Programming
, pp. 693-703
-
-
Charikar, M.1
Chen, K.2
Farach-Colton, M.3
-
11
-
-
0040377588
-
NiagaraCQ: A scalable continuous query system for Internet databases
-
CHEN, J., DEWITT, D., TIAN, F., AND WANG, Y. 2000. NiagaraCQ: A scalable continuous query system for Internet databases. In Proceedings of the 19th ACM SIGMOD International Conference on Management of Data. 379-390.
-
(2000)
Proceedings of the 19th ACM SIGMOD International Conference on Management of Data
, pp. 379-390
-
-
Chen, J.1
Dewitt, D.2
Tian, F.3
Wang, Y.4
-
12
-
-
85012186650
-
Finding hierarchical heavy hitters in data streams
-
CORMODE, G., KORN, F., MUTHUKRISHNAN, S., AND SRIVASTAVA, D. 2003. Finding hierarchical heavy hitters in data streams. In Proceedings of the 29th VLDB International Conference on Very Large Data Bases. 464-475.
-
(2003)
Proceedings of the 29th VLDB International Conference on Very Large Data Bases
, pp. 464-475
-
-
Cormode, G.1
Korn, F.2
Muthukrishnan, S.3
Srivastava, D.4
-
13
-
-
3142735161
-
Diamond in the rough: Finding hierarchical heavy hitters in multi-dimensional data
-
CORMODE, G., KORN, F., MUTHUKRISHNAN, S., AND SRIVASTAVA, D. 2004. Diamond in the rough: Finding hierarchical heavy hitters in multi-dimensional data. In Proceedings of the 23rd ACM SIGMOD International Conference on Management of Data. 155-166.
-
(2004)
Proceedings of the 23rd ACM SIGMOD International Conference on Management of Data
, pp. 155-166
-
-
Cormode, G.1
Korn, F.2
Muthukrishnan, S.3
Srivastava, D.4
-
15
-
-
0034592773
-
Hancock: A language for extracting signatures from data streams
-
CORTES, C., FISHER, K., PREGIBON, D., ROGERS, A., AND SMITH, F. 2000. Hancock: A language for extracting signatures from data streams. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 9-17.
-
(2000)
Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, pp. 9-17
-
-
Cortes, C.1
Fisher, K.2
Pregibon, D.3
Rogers, A.4
Smith, F.5
-
16
-
-
84968735289
-
Maintaining stream statistics over sliding windows
-
DATAR, M., GIONIS, A., INDYK, P., AND MOTWANI, R. 2002. Maintaining stream statistics over sliding windows. In Proceedings of the 13th ACM SIAM Symposium on Discrete Algorithms. 635-644.
-
(2002)
Proceedings of the 13th ACM SIAM Symposium on Discrete Algorithms
, pp. 635-644
-
-
Datar, M.1
Gionis, A.2
Indyk, P.3
Motwani, R.4
-
18
-
-
2442583610
-
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
-
19
-
-
0002586462
-
Computing iceberg queries efficiently
-
FANG, M., SHIVAKUMAR, S., GARCIA-MOLINA, H., MOTWANI, R., AND ULLMAN, J. 1998. Computing iceberg queries efficiently. In Proceedings of the 24th VLDB International Conference on Very Large Data Bases. 299-310.
-
(1998)
Proceedings of the 24th VLDB International Conference on Very Large Data Bases
, pp. 299-310
-
-
Fang, M.1
Shivakumar, S.2
Garcia-Molina, H.3
Motwani, R.4
Ullman, J.5
-
20
-
-
0033309273
-
An approximate L1-difference algorithm for massive data streams
-
FEIGENBAUM, J., KANNAN, S., STRAUSS, M., AND VISWANATHAN, M. 1999. An approximate L1-difference algorithm for massive data streams. In Proceedings of 40th FOCS Annual Symposium on Foundations of Computer Science. 501-511.
-
(1999)
Proceedings of 40th FOCS Annual Symposium on Foundations of Computer Science
, pp. 501-511
-
-
Feigenbaum, J.1
Kannan, S.2
Strauss, M.3
Viswanathan, M.4
-
21
-
-
0040286013
-
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
-
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
-
25
-
-
0005308437
-
Surfing wavelets on streams: One-pass summaries for approximate aggregate queries
-
GILBERT, A., KOTIDIS, Y., MUTHUKRISHNAN, S., AND STRAUSS, M. 2001. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries. In Proceedings of the 27th VLDB International Conference on Very Large Data Bases. 79-88.
-
(2001)
Proceedings of the 27th VLDB International Conference on Very Large Data Bases
, pp. 79-88
-
-
Gilbert, A.1
Kotidis, Y.2
Muthukrishnan, S.3
Strauss, M.4
-
26
-
-
16344385372
-
Identifying frequent items in sliding windows over online packet streams
-
GOLAB, L., DEHAAN, D., DEMAINE, E., LÓPEZ-ORTIZ, A., AND MUNRO, J. 2003. Identifying frequent items in sliding windows over online packet streams. In Proceedings of the 1st ACM SIGCOMM Internet Measurement Conference. 173-178.
-
(2003)
Proceedings of the 1st ACM SIGCOMM Internet Measurement Conference
, pp. 173-178
-
-
Golab, L.1
Dehaan, D.2
Demaine, E.3
López-Ortiz, A.4
Munro, J.5
-
27
-
-
2442617843
-
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
-
29
-
-
84869198292
-
Histogramming data streams with fast per-item processing
-
GUHA, S., INDYK, P., MUTHUKRISHNAN, M., AND STRAUSS, M. 2002. Histogramming data streams with fast per-item processing. In Proceedings of the 29th ICALP International Colloquium on Automata, Languages and Programming. 681-692.
-
(2002)
Proceedings of the 29th ICALP International Colloquium on Automata, Languages and Programming
, pp. 681-692
-
-
Guha, S.1
Indyk, P.2
Muthukrishnan, M.3
Strauss, M.4
-
32
-
-
0033204142
-
Packet classification on multiple fields
-
GUPTA, P. AND MCKEOWN, N. 1999. Packet classification on multiple fields. In Proceedings of the ACM SIGCOMM International Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 147-160.
-
(1999)
Proceedings of the ACM SIGCOMM International Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
, pp. 147-160
-
-
Gupta, P.1
Mckeown, N.2
-
33
-
-
0002812751
-
Sampling-based estimation of the number of distinct values of an attribute
-
HAAS, P., NAUGHTON, J., SEHADRI, S., AND STOKES, L. 1995. Sampling-based estimation of the number of distinct values of an attribute. In Proceedings of the 21st VLDB International Conference on Very Large Data Bases. 311-322.
-
(1995)
Proceedings of the 21st VLDB International Conference on Very Large Data Bases
, pp. 311-322
-
-
Haas, P.1
Naughton, J.2
Sehadri, S.3
Stokes, L.4
-
34
-
-
0348164422
-
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
-
35
-
-
8644256210
-
Dynamically maintaining frequent items over a data stream
-
JIN, C., QIAN, W., SHA, C., YU, J., AND ZHOU, A. 2003. Dynamically maintaining frequent items over a data stream. In Proceedings of the 12th ACM CIKM International Conference on Information and Knowledge Management. 287-294.
-
(2003)
Proceedings of the 12th ACM CIKM International Conference on Information and Knowledge Management
, pp. 287-294
-
-
Jin, C.1
Qian, W.2
Sha, C.3
Yu, J.4
Zhou, A.5
-
36
-
-
0348252034
-
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
-
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
-
38
-
-
2442631384
-
Continuously maintaining quantile summaries of the most recent N elements over a data stream
-
LIN, X., LU, H., XU, J., AND YU, J. 2004. Continuously maintaining quantile summaries of the most recent N elements over a data stream. In Proceedings of the 20th IEEE ICDE International Conference on Data Engineering. 362-374.
-
(2004)
Proceedings of the 20th IEEE ICDE International Conference on Data Engineering
, pp. 362-374
-
-
Lin, X.1
Lu, H.2
Xu, J.3
Yu, J.4
-
42
-
-
33745623047
-
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
-
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
-
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
|