The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Eddies: continuously adaptive query processing
Abstract
In large federated and shared-nothing databases, resources can exhibit widely fluctuating characteristics. Assumptions made at the time a query is submitted will rarely hold throughout the duration of query processing. As a result, traditional static query optimization and execution techniques are ineffective in these environments. In this paper we introduce a query processing mechanism called an eddy , which continuously reorders operators in a query plan as it runs. We characterize the moments of symmetry during which pipelined joins can be easily reordered, and the synchronization barriers that require inputs from different sources to be coordinated. By combining eddies with appropriate join algorithms, we merge the optimization and execution phases of query processing, allowing each tuple to have a flexible ordering of the query operators. This flexibility is controlled by a combination of fluid dynamics and a simple learning algorithm. Our initial implementation demonstrates promising results, with eddies performing nearly as well as a static optimizer/executor in static scenarios, and providing dramatic improvements in dynamic execution environments.
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
Introduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
Barto, A. G. (1998) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)38315-5 · Cited by 2,976
(2020) · Machine Learning and Visual Perception · doi:10.1515/9783110595567-011 · Cited by 1,930
Sontag, E. D. (1998) · Texts in Applied Mathematics · doi:10.1007/978-1-4612-0577-7 · Cited by 1,226
The TSIMMIS project: Integration of heterogeneous information sources
Chawathe, S. S., García-Molina, H., Hammer, J., Ireland, K., Papakonstantinou, Y., Ullman, J. D., & Widom, J. (1994) · 情報処理学会研究報告データベースシステム(DBS) · Cited by 914
The design and implementation of INGRES
Stonebraker, M., Held, G., Wong, E., & Kreps, P. (1976) · ACM Transactions on Database Systems · doi:10.1145/320473.320476 · Cited by 886
The TSIMMIS Approach to Mediation: Data Models and Languages
Garcia-Molina, H., Papakonstantinou, Y., Quass, D., Rajaraman, A., Sagiv, Y., Ullman, J., Vassalos, V., & Widom, J. (1997) · Journal of Intelligent Information Systems · doi:10.1023/a:1008683107812 · Cited by 829
The Gamma database machine project
DeWitt, D. J., Ghandeharizadeh, S., Schneider, D. A., Bricker, A., Hsiao, H.-I., & Rasmussen, R. (1990) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.50905 · Cited by 668
Lottery scheduling: flexible proportional-share resource management
Waldspurger, C. A., & Weihl, W. E. (1994) · doi:10.5555/1267638.1267639 · Cited by 637
Optimizing Queries Across Diverse Data Sources
Haas, L. M., Kossmann, D., Wimmers, E. L., & Yang, J. (1997) · Very Large Data Bases · Cited by 456
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
Ripple joins for online aggregation
Haas, P. J., & Hellerstein, J. M. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304208 · Cited by 369
Self-citationEncapsulation of parallelism in the Volcano query processing system
Graefe, G. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98720 · Cited by 340
Efficient mid-query re-optimization of sub-optimal query execution plans
Kabra, N., & DeWitt, D. J. (1998) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/276304.276315 · Cited by 331
Mathematical control theory: deterministic finite dimensional systems (2nd ed.)
Sontag, E. D. (1998) · Springer eBooks · Cited by 249
On the optimal nesting order for computing N -relational joins
Ibaraki, T., & Kameda, T. (1984) · ACM Transactions on Database Systems · doi:10.1145/1270.1498 · Cited by 238
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
Interactive data analysis: the Control project
Hellerstein, J. M., Avnur, R., Chou, A., Hidber, C., Olston, C., Raman, V., Roth, T., & Haas, P. J. (1999) · Computer · doi:10.1109/2.781635 · Cited by 199
Self-citationOptimization of dynamic query evaluation plans
Cole, R. L., & Graefe, G. (1994) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/191839.191872 · Cited by 182
Cluster I/O with River: making the fast case common
Arpaci-Dusseau, R. H., Anderson, E., Treuhaft, N., Culler, D. E., Hellerstein, J. M., Patterson, D., & Yelick, K. (1999) · Proceedings of the sixth workshop on I/O in parallel and distributed systems · doi:10.1145/301816.301823 · Cited by 176
Self-citationQuery optimization in the presence of limited access patterns
Florescu, D., Levy, A., Manolescu, I., & Suciu, D. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304210 · Cited by 164
High-performance sorting on networks of workstations
Arpaci-Dusseau, A. C., Arpaci-Dusseau, R. H., Culler, D., Hellerstein, J. M., & Patterson, D. A. (1997) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/253260.253322 · Cited by 138
Self-citationScrambling query plans to cope with unexpected delays
Amsaleg, L., Tomasic, A., Franklin, M. J. M., & Urhan, T. (2002) · International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568681 · Cited by 102
Query optimization in the presence of limited access patterns
Florescu, D., Levy, A. Y., Manolescu, I., et al. (1999) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/304182.304210 · Cited by 87
Independent, Open Enterprise Data Integration.
Hellerstein, J. M., Stonebraker, M. R., & Caccia, R. (1999) · IEEE Data(base) Engineering Bulletin · Cited by 56
Self-citationHow to avoid building DataBlades(R) that know the value of everything and the cost of nothing
Aoki, P. M. (2003) · International Conference on Scientific and Statistical Database Management · doi:10.1109/ssdm.1999.787627 · Cited by 24
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 cougar approach to in-network query processing in sensor networks
Yao, Y., & Gehrke, J. (2002) · ACM SIGMOD Record · doi:10.1145/601858.601861 · Cited by 1,328
The design of an acquisitional query processor for sensor networks
Madden, S., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872817 · Cited by 927
Self-citation
Metadata
- Authors
- Avnur, R., & Hellerstein, J. M.
- Venue
- ACM SIGMOD Record
- Published
- 2000-05-16
- Volume
- 29
- Issue
- 2
- Pages
- 261-272
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2203361072
- Cited by
- 798
- References
- 26
- FWCI
- 54.22
- Type
- journal article
- 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.