The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Continuously adaptive continuous queries over streams
Abstract
We present a continuously adaptive, continuous query (CACQ) implementation based on the eddy query processing framework. We show that our design provides significant performance benefits over existing approaches to evaluating continuous queries, not only because of its adaptivity, but also because of the aggressive cross-query sharing of work and space that it enables. By breaking the abstraction of shared relational algebra expressions, our Telegraph CACQ implementation is able to share physical operators --- both selections and join state --- at a very fine grain. We augment these features with a grouped-filter index to simultaneously evaluate multiple selection predicates. We include measurements of the performance of our core system, along with a comparison to existing continuous query approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Directed diffusion: a scalable and robust communication paradigm for sensor networks
Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345920 · Cited by 5,393
System architecture directions for networked sensors
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.356998 · Cited by 3,084
Barto, A. G. (1998) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)38315-5 · Cited by 2,976
Rete: A fast algorithm for the many pattern/many object pattern match problem
Forgy, C. L. (1982) · Artificial Intelligence · doi:10.1016/0004-3702(82)90020-0 · Cited by 2,634
Asymptotically efficient adaptive allocation rules
Lai, T. L., & Robbins, H. (1985) · Advances in Applied Mathematics · doi:10.1016/0196-8858(85)90002-8 · Cited by 2,406
Adaptive protocols for information dissemination in wireless sensor networks
Heinzelman, W. R., Kulik, J., & Balakrishnan, H. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313529 · Cited by 2,308
Access path selection in a relational database management system
Selinger, P. G., Astrahan, M. M., Chamberlin, D. D., Lorie, R. A., & Price, T. G. (1979) · Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79 · doi:10.1145/582095.582099 · Cited by 2,188
Some aspects of the sequential design of experiments
Robbins, H. (1952) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1952-09620-8 · Cited by 2,184
(2020) · Machine Learning and Visual Perception · doi:10.1515/9783110595567-011 · Cited by 1,930
System architecture directions for networked sensors
Hill, J. L., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. S. J. (2000) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/378993.379006 · Cited by 1,756
Next century challenges: mobile networking for “Smart Dust”
Kahn, J. M., Katz, R. H., & Pister, K. S. J. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313558 · Cited by 1,660
NiagaraCQ: a scalable continuous query system for Internet databases
Chen, J., DeWitt, D. J., Tian, F., & Wang, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335432 · Cited by 1,022
Sellis, T. K. (1988) · ACM Transactions on Database Systems · doi:10.1145/42201.42203 · Cited by 809
Eddies: continuously adaptive query processing
Avnur, R., & Hellerstein, J. M. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335420 · Cited by 798
Self-citationTowards Sensor Database Systems
Bonnet, P., Gehrke, J., & Seshadri, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44498-x_1 · Cited by 791
Continuous queries over data streams
Babu, S., & Widom, J. (2001) · ACM SIGMOD Record · doi:10.1145/603867.603884 · Cited by 721
Bandit Problems, Sequential Allocation of Experiments.
Jones, P. W., Berry, D. A., & Fristedt, B. (1987) · The Journal of the Operational Research Society · doi:10.2307/2582852 · Cited by 566
Efficient Filtering of XML Documents for Selective Dissemination of Information
Altınel, M., & Franklin, M. J. M. (2000) · Cited by 548
Sample mean based index policies by O(log n) regret for the multi-armed bandit problem
Agrawal, R. (1995) · Advances in Applied Probability · doi:10.2307/1427934 · Cited by 540
ACM transactions on database systems: aim and scope
(1976) · ACM Transactions on Database Systems · doi:10.1145/320434.320436 · Cited by 514
NiagaraCQ: a scalable continuous query system for Internet databases
Chen, J., DeWitt, D. J., Tian, F., & Wang, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335432 · Cited by 481
XML-QL: A Query Language for XML
Deutsch, A. (1998) · Cited by 422
Efficient and extensible algorithms for multi query optimization
Roy, P., Seshadri, S., Sudarshan, S., & Bhobe, S. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335419 · Cited by 403
Continuous queries over append-only databases
Terry, D., Goldberg, D., Nichols, D., & Oki, B. (1992) · Proceedings of the 1992 ACM SIGMOD international conference on Management of data · doi:10.1145/130283.130333 · Cited by 399
An adaptive query execution system for data integration
Ives, Z. G., Florescu, D., Friedman, M., Levy, A. Y., & Weld, D. S. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304209 · Cited by 396
Eddies: continuously adaptive query processing
Avnur, R., & Hellerstein, J. M. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335420 · Cited by 381
Self-citationContinual queries for Internet scale event-driven information delivery
Liu, L., Pu, C., & Tang, W. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.790816 · Cited by 332
Automatically Extracting Structure from Free Text Addresses.
Borkar, V., Deshmukh, K., & Sarawagi, S. (2000) · Cited by 313
Efficient and extensible algorithms for multi query optimization
Roy, P., Seshadri, S., Sudarshan, S., & Bhobe, S. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335419 · Cited by 231
Cost-based query scrambling for initial delays
Urhan, T., Franklin, M. J. M., & Amsaleg, L. (1998) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/276304.276317 · Cited by 211
Materialized view selection and maintenance using multi-query optimization
Mistry, H., Roy, P., Sudarshan, S., & Ramamritham, K. (2001) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/375663.375703 · Cited by 195
Using upper confidence bounds for online learning
Auer, P. L. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892116 · Cited by 58
Cited by
Models and issues in data stream systems
Babcock, B., Babu, S., Datar, M., Motwani, R., & Widom, J. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543615 · Cited by 2,495
TinyDB: an acquisitional query processing system for sensor networks
Madden, S. R., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2005) · ACM Transactions on Database Systems · doi:10.1145/1061318.1061322 · Cited by 1,899
Self-citationAurora: a new model and architecture for data stream management
Abadi, D. J., Carney, D., �etintemel, U., Cherniack, M., Convey, C., Lee, S., Stonebraker, M., Tatbul, N., & Zdonik, S. (2003) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s00778-003-0095-z · Cited by 1,495
The CQL continuous query language: semantic foundations and query execution
Arasu, A., Babu, S., & Widom, J. (2006) · The VLDB Journal · doi:10.1007/s00778-004-0147-z · Cited by 1,170
Maté: a tiny virtual machine for sensor networks
Levis, P., & Culler, D. (2002) · Proceedings of the 10th international conference on Architectural support for programming languages and operating systems · doi:10.1145/605397.605407 · Cited by 1,019
Metadata
- Authors
- Madden, S., Shah, M., Hellerstein, J. M., & Raman, V.
- Venue
- Proceedings of the 2002 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2002-06-03
- Pages
- 49-60
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2135499008
- Cited by
- 583
- References
- 32
- FWCI
- 33.18
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.