BigDAWG polystore query optimization through semantic equivalences

Zuohao She, Surabhi Ravishankar, Jennie Duggan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2 Citations

Abstract

A polystore system evaluates queries that span multiple disparate data models; this character introduces a unique query optimization challenge. Specialized database engines such as array and graph databases support partially overlapping sets of query processing operations. Among their common or similar semantics, different systems could have completely different performance profiles for the same query, making their relative usefulness vary from query to query. We hypothesize that a polystore system could exploit this context-dependent disparity of performance by making choices between executing a sub-query locally and migrating the inputs for remote executions. In this work, as part of the larger ISTC BigDAWG project, we examine the challenges of polystore query optimization through the lens of equivalent semantics among back-end databases.

Original languageEnglish
Title of host publication2016 IEEE High Performance Extreme Computing Conference, HPEC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509035250
DOIs
StatePublished - Nov 28 2016
Event2016 IEEE High Performance Extreme Computing Conference, HPEC 2016 - Waltham, United States

Other

Other2016 IEEE High Performance Extreme Computing Conference, HPEC 2016
CountryUnited States
CityWaltham
Period9/13/169/15/16

Fingerprint

Query
Semantics
Query optimization
Query processing
Data structures
Lenses
Engines
Multiple models
Disparities
Data model
Lens
Overlapping
Engine
Equivalence
Vary
Dependent
Evaluate
Graph in graph theory

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Hardware and Architecture
  • Computational Mathematics

Cite this

She, Z., Ravishankar, S., & Duggan, J. (2016). BigDAWG polystore query optimization through semantic equivalences. In 2016 IEEE High Performance Extreme Computing Conference, HPEC 2016 [7761584] Institute of Electrical and Electronics Engineers Inc.. DOI: 10.1109/HPEC.2016.7761584

BigDAWG polystore query optimization through semantic equivalences. / She, Zuohao; Ravishankar, Surabhi; Duggan, Jennie.

2016 IEEE High Performance Extreme Computing Conference, HPEC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. 7761584.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

She, Z, Ravishankar, S & Duggan, J 2016, BigDAWG polystore query optimization through semantic equivalences. in 2016 IEEE High Performance Extreme Computing Conference, HPEC 2016., 7761584, Institute of Electrical and Electronics Engineers Inc., 2016 IEEE High Performance Extreme Computing Conference, HPEC 2016, Waltham, United States, 13-15 September. DOI: 10.1109/HPEC.2016.7761584
She Z, Ravishankar S, Duggan J. BigDAWG polystore query optimization through semantic equivalences. In 2016 IEEE High Performance Extreme Computing Conference, HPEC 2016. Institute of Electrical and Electronics Engineers Inc.2016. 7761584. Available from, DOI: 10.1109/HPEC.2016.7761584

She, Zuohao; Ravishankar, Surabhi; Duggan, Jennie / BigDAWG polystore query optimization through semantic equivalences.

2016 IEEE High Performance Extreme Computing Conference, HPEC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. 7761584.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

@inbook{867daed4571947a9a9d1116a4d7f2daa,
title = "BigDAWG polystore query optimization through semantic equivalences",
abstract = "A polystore system evaluates queries that span multiple disparate data models; this character introduces a unique query optimization challenge. Specialized database engines such as array and graph databases support partially overlapping sets of query processing operations. Among their common or similar semantics, different systems could have completely different performance profiles for the same query, making their relative usefulness vary from query to query. We hypothesize that a polystore system could exploit this context-dependent disparity of performance by making choices between executing a sub-query locally and migrating the inputs for remote executions. In this work, as part of the larger ISTC BigDAWG project, we examine the challenges of polystore query optimization through the lens of equivalent semantics among back-end databases.",
author = "Zuohao She and Surabhi Ravishankar and Jennie Duggan",
year = "2016",
month = "11",
doi = "10.1109/HPEC.2016.7761584",
booktitle = "2016 IEEE High Performance Extreme Computing Conference, HPEC 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - CHAP

T1 - BigDAWG polystore query optimization through semantic equivalences

AU - She,Zuohao

AU - Ravishankar,Surabhi

AU - Duggan,Jennie

PY - 2016/11/28

Y1 - 2016/11/28

N2 - A polystore system evaluates queries that span multiple disparate data models; this character introduces a unique query optimization challenge. Specialized database engines such as array and graph databases support partially overlapping sets of query processing operations. Among their common or similar semantics, different systems could have completely different performance profiles for the same query, making their relative usefulness vary from query to query. We hypothesize that a polystore system could exploit this context-dependent disparity of performance by making choices between executing a sub-query locally and migrating the inputs for remote executions. In this work, as part of the larger ISTC BigDAWG project, we examine the challenges of polystore query optimization through the lens of equivalent semantics among back-end databases.

AB - A polystore system evaluates queries that span multiple disparate data models; this character introduces a unique query optimization challenge. Specialized database engines such as array and graph databases support partially overlapping sets of query processing operations. Among their common or similar semantics, different systems could have completely different performance profiles for the same query, making their relative usefulness vary from query to query. We hypothesize that a polystore system could exploit this context-dependent disparity of performance by making choices between executing a sub-query locally and migrating the inputs for remote executions. In this work, as part of the larger ISTC BigDAWG project, we examine the challenges of polystore query optimization through the lens of equivalent semantics among back-end databases.

UR - http://www.scopus.com/inward/record.url?scp=85007130653&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85007130653&partnerID=8YFLogxK

U2 - 10.1109/HPEC.2016.7761584

DO - 10.1109/HPEC.2016.7761584

M3 - Conference contribution

BT - 2016 IEEE High Performance Extreme Computing Conference, HPEC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -