Models and issues in data stream systems

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2002, Pages 1-16

  Babcock, Brian ^a   Babu, Shivnath ^a   Datar, Mayur ^a   Motwani, Rajeev ^a   Widom, Jennifer ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BATCH DATA PROCESSING; COMPUTER SIMULATION; DATA STRUCTURES; QUERY LANGUAGES;

DATA STREAM SYSTEMS; QUERY PROCESSING; STREAM QUERY LANGUAGES;

RELATIONAL DATABASE SYSTEMS;

EID: 0036042175     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/543613.543615     Document Type: Conference Paper

References (93)

1. Congressional samples for approximate answering of group-by queries
2. Join synopses for approximate query answering
3. Counting inversions in a data stream
4. Tracking join and self-join sizes in limited storage
5. The space complexity of approximating the frequency moments
6. Efficient filtering of XML documents for selective dissemination of information
7. Characterizing memory requirements for queries over continuous data streams
8. Eddies: Continuously adaptive query processing
9. Sampling from a moving window over streaming data
10. Continuous queries over data streams
11. Sampling algorithms: Lower bounds and applications
12. Reductions in streaming algorithms, with an application to counting triangles in graphs
13. Analytic functions in oracle 8i
14. Updating derived relations: Detecting irrelevant and autonomously computable updates
15. Monitoring streams - A new class of dbms applications
16. Approximate query processing using wavelets
17. Towards estimation error guarantees for distinct values
18. A robust, optimization-based approach for approximate answering of aggregate queries
19. On sampling and relational operators
20. Random sampling for histogram construction: How much is enough?
21. On random sampling over joins
22. An efficient cost-driven index selection tool for microsoft sql server
23. NiagraCQ: A scalable continuous query system for internet databases
24. Hancock: A language for extracting signatures from data streams
25. Maintaining stream statistics over sliding windows
26. Processing complex aggregate queries over data streams
27. Mining high-speed data streams
28. Mining time-changing data streams
29. Trajectory sampling for direct traffic observation
30. The New Jersey data reduction report
31. Fast subsequence matching in time-series databases
32. Computing iceberg queries efficiently
33. An approximate 11-difference algorithm for massive data streams
34. Testing and spot checking of data streams
35. Probabilistic counting
36. Expiring data in a warehouse
37. On computing correlated aggregate over continual data streams
38. Estimating simple functions on the union of data streams
39. Fast, small-space algorithms for approximate histogram maintenance
40. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries
41. Space-efficient online computation of quantile summaries
42. Approximating a data stream for querying and estimation: Algorithms and performance evaluation
43. Data-streams and histograms
44. Clustering data streams
45. Data integration using self-maintainable views
46. Sampling-based estimation of the number of distinct values of an attribute
47. Adaptive query processing: Technology in evolution
48. Online aggregation
49. Computing on data streams
50. Stable distributions, pseudorandom generators, embeddings and data stream computation
51. Histogram-based approximation of set-valued query-answers
52. An adaptive query execution system for data integration
53. Optimal histograms with quality guarantees
54. View maintenance issues for the Chronicle data model
55. Continual queries for internet scale event-driven information delivery
56. Fjording the stream: An architecture for queries over streaming sensor data
57. Continuously adaptive continuous queries over streams
58. Approximate frequency counts over streaming data
59. Approximate medians and other quantiles in one pass and with limited memory
60. Random sampling techniques for space efficient online computation of order statistics of large datasets
61. Wavelet-based histograms for selectivity estimation
62. Dynamic maintenance of wavelet-based histograms
63. Selection and sorting with limited storage
64. Monitoring XML data on the web
65. Fast approximate answers to aggregate queries on a data cube
66. Making views self-maintainable for data warehousing
67. Online dynamic reordering for interactive data processing
68. Space lower bounds for distance approximation in the data stream model
69. Alert: An architecture for transforming a passive DBMS into an active DBMS
70. Multiple-query optimization
71. Sequence query processing
72. Seq: A model for sequence databases
73. The design and implementation of a sequence database system
74. Architecting a network query engine for producing partial results
75. A taxonomy of time in databases
76. On-line analytical processing (sql/olap)
77. Tribeca: A stream database manager for network traffic analysis
78. Continuous queries over append-only databases
79. Enhancing relational operators for querying over punctuated data streams
80. Xjoin: A reactively-scheduled pipelined join operator
81. Rate-based query optimization for streaming information sources
82. Random sampling with a reservoir
83. External memory algorithms and datastructures
84. Approximate computation of multidimensional aggregates of sparse data using wavelets
85. Data cube approximation and histograms via wavelets