The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
The BigDAWG Polystore System
Abstract
This paper presents a new view of federated databases to address the growing need for managing information that spans multiple data models. This trend is fueled by the proliferation of storage engines and query languages based on the observation that 'no one size fits all'. To address this shift, we propose a polystore architecture; it is designed to unify querying over multiple data models. We consider the challenges and opportunities associated with polystores. Open questions in this space revolve around query optimization and the assignment of objects to storage engines. We introduce our approach to these topics and discuss our prototype in the context of the Intel Science and Technology Center for Big Data
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
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
Mediators in the architecture of future information systems
Wiederhold, G. (1992) · Computer · doi:10.1109/2.121508 · Cited by 2,165
A comparative analysis of methodologies for database schema integration
Batini, C., Lenzerini, M., & Navathe, S. B. (1986) · ACM Computing Surveys · doi:10.1145/27633.27634 · Cited by 1,740
Saeed, M., Villarroel, M., Reisner, A. T., Clifford, G., Lehman, L.-W., Moody, G., Heldt, T., Kyaw, T. H., Moody, B., & Mark, R. G. (2011) · Critical Care Medicine · doi:10.1097/ccm.0b013e31820a92c6 · Cited by 1,162
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
From databases to dataspaces: a new abstraction for information management
Franklin, M., Halevy, A., & Maier, D. (2005) · ACM SIGMOD Record · doi:10.1145/1107499.1107502 · Cited by 757
Self-citation"One size fits all": an idea whose time has come and gone
Stonebraker, M., & Cetintemel, U. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.1 · Cited by 393
Self-citationManaging semantic heterogeneity in databases: a theoretical prospective
Hull, R. (1997) · Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/263661.263668 · Cited by 359
Scrambling 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
Cited by
Big Data Systems: A Software Engineering Perspective
Davoudian, A., & Liu, M. (2021) · ACM Computing Surveys · doi:10.1145/3408314 · Cited by 88
Towards Observability Data Management at Scale
Karumuri, S., Solleza, F., Zdonik, S., & Tatbul, N. (2021) · ACM SIGMOD Record · doi:10.1145/3456859.3456863 · Cited by 48
Self-citationMozaffari, M., Dignös, A., Gamper, J., & Störl, U. (2024) · ACM Computing Surveys · doi:10.1145/3665323 · Cited by 17
Metadata
- Authors
- Duggan, J., Elmore, A. J., Stonebraker, M., Balazinska, M., Howe, B., Kepner, J., Madden, S., Maier, D., Mattson, T., & Zdonik, S.
- Venue
- ACM SIGMOD Record
- Published
- 2015-08-12
- Volume
- 44
- Issue
- 2
- Pages
- 11-16
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2260616469
- Cited by
- 269
- References
- 15
- FWCI
- 32.62
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The BigDAWG Polystore System. https://app.cochat.ai/papers/10.1145/2814710.2814713
- The paper
- Duggan, J., Elmore, A. J., Stonebraker, M., Balazinska, M., Howe, B., Kepner, J., Madden, S., Maier, D., Mattson, T., & Zdonik, S. (2015). The BigDAWG Polystore System. ACM SIGMOD Record. https://doi.org/10.1145/2814710.2814713
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.