Querying databases by snapping blocks

Yasin Silva, Jaime Chon

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

Abstract

A key area of focus in recent Computer Science education research has been block-based programming. In this approach, program instructions are represented as visual blocks with shapes that control the way multiple instructions can be combined. Since programs are created by dragging and connecting blocks, the focus is on the program's logic rather than its syntax. In this demonstration we present DBSnap, a system that enables building database queries, specifically relational algebra queries, by connecting blocks. A differentiating property of DBSnap is that it uses a visual tree-based structure to represent queries. This structure is, in fact, very similar to the intuitive query trees commonly used by database practitioners and educators. DBSnap is also highly dynamic, it shows the query result and the corresponding relational algebra expression as the query is built and enables the inspection of intermediate query results. This paper describes DBSnap's main design elements, its architecture and implementation guidelines, and the interactive demonstration scenarios. DBSnap is a publicly available system and aims to have a transformational effect on database learning.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Data Engineering
PublisherIEEE Computer Society
Pages1472-1475
Number of pages4
Volume2015-May
ISBN (Print)9781479979639
DOIs
StatePublished - May 26 2015
Event2015 31st IEEE International Conference on Data Engineering, ICDE 2015 - Seoul, Korea, Republic of
Duration: Apr 13 2015Apr 17 2015

Other

Other2015 31st IEEE International Conference on Data Engineering, ICDE 2015
CountryKorea, Republic of
CitySeoul
Period4/13/154/17/15

Fingerprint

Algebra
Demonstrations
Computer programming
Computer science
Education
Inspection

ASJC Scopus subject areas

  • Information Systems
  • Signal Processing
  • Software

Cite this

Silva, Y., & Chon, J. (2015). Querying databases by snapping blocks. In Proceedings - International Conference on Data Engineering (Vol. 2015-May, pp. 1472-1475). [7113404] IEEE Computer Society. https://doi.org/10.1109/ICDE.2015.7113404

Querying databases by snapping blocks. / Silva, Yasin; Chon, Jaime.

Proceedings - International Conference on Data Engineering. Vol. 2015-May IEEE Computer Society, 2015. p. 1472-1475 7113404.

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

Silva, Y & Chon, J 2015, Querying databases by snapping blocks. in Proceedings - International Conference on Data Engineering. vol. 2015-May, 7113404, IEEE Computer Society, pp. 1472-1475, 2015 31st IEEE International Conference on Data Engineering, ICDE 2015, Seoul, Korea, Republic of, 4/13/15. https://doi.org/10.1109/ICDE.2015.7113404
Silva Y, Chon J. Querying databases by snapping blocks. In Proceedings - International Conference on Data Engineering. Vol. 2015-May. IEEE Computer Society. 2015. p. 1472-1475. 7113404 https://doi.org/10.1109/ICDE.2015.7113404
Silva, Yasin ; Chon, Jaime. / Querying databases by snapping blocks. Proceedings - International Conference on Data Engineering. Vol. 2015-May IEEE Computer Society, 2015. pp. 1472-1475
@inproceedings{960a24fe1c0e41f7bcff52c4ec80d36c,
title = "Querying databases by snapping blocks",
abstract = "A key area of focus in recent Computer Science education research has been block-based programming. In this approach, program instructions are represented as visual blocks with shapes that control the way multiple instructions can be combined. Since programs are created by dragging and connecting blocks, the focus is on the program's logic rather than its syntax. In this demonstration we present DBSnap, a system that enables building database queries, specifically relational algebra queries, by connecting blocks. A differentiating property of DBSnap is that it uses a visual tree-based structure to represent queries. This structure is, in fact, very similar to the intuitive query trees commonly used by database practitioners and educators. DBSnap is also highly dynamic, it shows the query result and the corresponding relational algebra expression as the query is built and enables the inspection of intermediate query results. This paper describes DBSnap's main design elements, its architecture and implementation guidelines, and the interactive demonstration scenarios. DBSnap is a publicly available system and aims to have a transformational effect on database learning.",
author = "Yasin Silva and Jaime Chon",
year = "2015",
month = "5",
day = "26",
doi = "10.1109/ICDE.2015.7113404",
language = "English (US)",
isbn = "9781479979639",
volume = "2015-May",
pages = "1472--1475",
booktitle = "Proceedings - International Conference on Data Engineering",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Querying databases by snapping blocks

AU - Silva, Yasin

AU - Chon, Jaime

PY - 2015/5/26

Y1 - 2015/5/26

N2 - A key area of focus in recent Computer Science education research has been block-based programming. In this approach, program instructions are represented as visual blocks with shapes that control the way multiple instructions can be combined. Since programs are created by dragging and connecting blocks, the focus is on the program's logic rather than its syntax. In this demonstration we present DBSnap, a system that enables building database queries, specifically relational algebra queries, by connecting blocks. A differentiating property of DBSnap is that it uses a visual tree-based structure to represent queries. This structure is, in fact, very similar to the intuitive query trees commonly used by database practitioners and educators. DBSnap is also highly dynamic, it shows the query result and the corresponding relational algebra expression as the query is built and enables the inspection of intermediate query results. This paper describes DBSnap's main design elements, its architecture and implementation guidelines, and the interactive demonstration scenarios. DBSnap is a publicly available system and aims to have a transformational effect on database learning.

AB - A key area of focus in recent Computer Science education research has been block-based programming. In this approach, program instructions are represented as visual blocks with shapes that control the way multiple instructions can be combined. Since programs are created by dragging and connecting blocks, the focus is on the program's logic rather than its syntax. In this demonstration we present DBSnap, a system that enables building database queries, specifically relational algebra queries, by connecting blocks. A differentiating property of DBSnap is that it uses a visual tree-based structure to represent queries. This structure is, in fact, very similar to the intuitive query trees commonly used by database practitioners and educators. DBSnap is also highly dynamic, it shows the query result and the corresponding relational algebra expression as the query is built and enables the inspection of intermediate query results. This paper describes DBSnap's main design elements, its architecture and implementation guidelines, and the interactive demonstration scenarios. DBSnap is a publicly available system and aims to have a transformational effect on database learning.

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

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

U2 - 10.1109/ICDE.2015.7113404

DO - 10.1109/ICDE.2015.7113404

M3 - Conference contribution

SN - 9781479979639

VL - 2015-May

SP - 1472

EP - 1475

BT - Proceedings - International Conference on Data Engineering

PB - IEEE Computer Society

ER -