{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-9334"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-9334","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"Plug-and-Play SQL","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Swami, Shubham"],"institution":"Hosted by Utah State University Libraries","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Curtis Dyreson","Dan Watson","Haitao Wang"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:52:35Z","subjects":["SQL","database","query guards","plug-and-play queries","Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/dd31-c8d2"],"render_values":[{"text":"https://doi.org/10.26076/dd31-c8d2","href":"https://doi.org/10.26076/dd31-c8d2","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/8192","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/8192","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-9334","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Curtis Dyreson","Dan Watson","Haitao Wang"]},{"key":"dc:creator","label":"Author","values":["Swami, Shubham"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2010-01-01T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2021-08-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["SQL","database","query guards","plug-and-play queries","Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/8192"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/dd31-c8d2"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Plug-and-Play SQL"]}]}],"canonical_facts":{"dc:contributor":["Curtis Dyreson","Dan Watson","Haitao Wang"],"dc:creator":["Swami, Shubham"],"dc:date.available":["2010-01-01T08:00:00Z"],"dc:date.created":["2021-08-01T07:00:00Z"],"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."],"dc:identifier":["https://digitalcommons.usu.edu/etd/8192"],"dc:identifier.doi":["https://doi.org/10.26076/dd31-c8d2"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["SQL","database","query guards","plug-and-play queries","Computer Sciences"],"dc:title":["Plug-and-Play SQL"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:52:35Z"}