Abstract
Scientific data is frequently stored across geographically distributed data repositories. Although there have been recent efforts to query scientific datasets using structured query operators, they have not yet supported joins across distributed data repositories. This paper describes a framework that supports join-like operations over multi-dimensional array datasets that are spread across multiple sites. More specifically, we first formally define join operations over array datasets and establish how they arise in the context of scientific data analysis. We then describe a methodology for optimizing such operations—components of our approach include enumeration algorithms for candidate plans, methods for pruning plans before they are enumerated, and a detailed cost model for selecting the best (cheapest) plan. We evaluate our approach using candidate queries, and show that the optimization effort is practical and profitable—query performance was improved significantly using our approach.
Original language | English (US) |
---|---|
Pages | 127-152 |
Number of pages | 26 |
DOIs | |
State | Published - Mar 1 2020 |
Externally published | Yes |
Keywords
- Database join
- Database optimizer
- Distributed join
- Scientific array database
ASJC Scopus subject areas
- Software
- Information Systems
- Hardware and Architecture
- Information Systems and Management