Back to search

Hosted by Utah State University Libraries

Plug-and-Play SQL

Abstract

dc:description.abstract

We present an efficient model to retrieve data from a database by implementing plug-and-play queries using the query guards. The model is efficient in the sense that it saves time when writing a query and promotes query portability and reuse. A plug-and-play query is a freestanding query that can couple to any data socket and self determine whether it can be evaluated reliably on the data. We use hierarchies to improve SQL querying in a way that eliminates the need to write a view to construct virtual tables or a set of tables to run a query. The hierarchy is a declarative specification of the desired shape of data rather than a description of how the data is organized. The advantage is that the common use of logical or semantic pointers in the SQL queries is eliminated and a natural way to group data for aggregation is provided. The plug-and-play queries have several advantages, they are portable and can be used to evaluate any data source.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science
Grantor dc:publisher
Hosted by Utah State University Libraries

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Swami, Shubham
Contributors dc:contributor
  • Curtis Dyreson
  • Dan Watson
  • Haitao Wang

Subjects

dc:subject × 5

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Utah State University
Base URL
digitalcommons.usu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Swami, Shubham. Plug-and-Play SQL. Thesis thesis, Hosted by Utah State University Libraries, https://digitalcommons.usu.edu/etd/8192