{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-9376"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-9376","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"Achieving a Sequenced, Relational Query Language with Log-Segmented Timestamps","abstract":"In a relational temporal database, typically each row of each table has a period timestamp to indicate the lifetime of that row. In order to evaluate a query in a temporal database, sequenced semantics comes into play. The semantics stipulates that the query must be evaluated simultaneously in each time instant using the data rows available at that point of time. Existing researches have proposed changes in the query evaluation engine to achieve sequenced semantics. In this paper we show a way to support sequenced semantics without modifying the query engine. We propose a noble construction log-segmented label to represent the lifetime and replace the period timestamp from each row with a log-segmented label that signifies when the tuple is alive. Then we translate a sequenced query to a non-temporal query by utilizing the properties of log-segmented label. The translated query has only operations already available in a typical relational database making the query readily executable in an unaltered installation of the database. Thus the sequenced query inevitably runs and retrieve data without changing query evaluation engine. Finally our implementation using Java language, ANTLR parser generator and PostgreSQL database demonstrates the feasibility of the proposed mechanism, which, to the best of our knowledge, has not been previously shown.","abstract_html":"In a relational temporal database, typically each row of each table has a period timestamp to indicate the lifetime of that row. In order to evaluate a query in a temporal database, sequenced semantics comes into play. The semantics stipulates that the query must be evaluated simultaneously in each time instant using the data rows available at that point of time. Existing researches have proposed changes in the query evaluation engine to achieve sequenced semantics. In this paper we show a way to support sequenced semantics without modifying the query engine. We propose a noble construction log-segmented label to represent the lifetime and replace the period timestamp from each row with a log-segmented label that signifies when the tuple is alive. Then we translate a sequenced query to a non-temporal query by utilizing the properties of log-segmented label. The translated query has only operations already available in a typical relational database making the query readily executable in an unaltered installation of the database. Thus the sequenced query inevitably runs and retrieve data without changing query evaluation engine. Finally our implementation using Java language, ANTLR parser generator and PostgreSQL database demonstrates the feasibility of the proposed mechanism, which, to the best of our knowledge, has not been previously shown.","abstract_has_math":false,"creators":["Ahsan, M. A. Manazir"],"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","Nick Flann"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:52:35Z","subjects":["Temporal databases","sequenced semantics","log-segmented label","query evaluation","relational algebra","query translation","Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/77cc-998e"],"render_values":[{"text":"https://doi.org/10.26076/77cc-998e","href":"https://doi.org/10.26076/77cc-998e","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/8227","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/8227","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-9376","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Curtis Dyreson","Dan Watson","Nick Flann"]},{"key":"dc:creator","label":"Author","values":["Ahsan, M. A. Manazir"]}]},{"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-12-01T08: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":["Temporal databases","sequenced semantics","log-segmented label","query evaluation","relational algebra","query translation","Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/8227"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/77cc-998e"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In a relational temporal database, typically each row of each table has a period timestamp to indicate the lifetime of that row. In order to evaluate a query in a temporal database, sequenced semantics comes into play. The semantics stipulates that the query must be evaluated simultaneously in each time instant using the data rows available at that point of time. Existing researches have proposed changes in the query evaluation engine to achieve sequenced semantics. In this paper we show a way to support sequenced semantics without modifying the query engine. We propose a noble construction log-segmented label to represent the lifetime and replace the period timestamp from each row with a log-segmented label that signifies when the tuple is alive. Then we translate a sequenced query to a non-temporal query by utilizing the properties of log-segmented label. The translated query has only operations already available in a typical relational database making the query readily executable in an unaltered installation of the database. Thus the sequenced query inevitably runs and retrieve data without changing query evaluation engine. Finally our implementation using Java language, ANTLR parser generator and PostgreSQL database demonstrates the feasibility of the proposed mechanism, which, to the best of our knowledge, has not been previously shown."]},{"key":"dc:title","label":"Title","values":["Achieving a Sequenced, Relational Query Language with Log-Segmented Timestamps"]}]}],"canonical_facts":{"dc:contributor":["Curtis Dyreson","Dan Watson","Nick Flann"],"dc:creator":["Ahsan, M. A. Manazir"],"dc:date.available":["2010-01-01T08:00:00Z"],"dc:date.created":["2021-12-01T08:00:00Z"],"dc:description.abstract":["In a relational temporal database, typically each row of each table has a period timestamp to indicate the lifetime of that row. In order to evaluate a query in a temporal database, sequenced semantics comes into play. The semantics stipulates that the query must be evaluated simultaneously in each time instant using the data rows available at that point of time. Existing researches have proposed changes in the query evaluation engine to achieve sequenced semantics. In this paper we show a way to support sequenced semantics without modifying the query engine. We propose a noble construction log-segmented label to represent the lifetime and replace the period timestamp from each row with a log-segmented label that signifies when the tuple is alive. Then we translate a sequenced query to a non-temporal query by utilizing the properties of log-segmented label. The translated query has only operations already available in a typical relational database making the query readily executable in an unaltered installation of the database. Thus the sequenced query inevitably runs and retrieve data without changing query evaluation engine. Finally our implementation using Java language, ANTLR parser generator and PostgreSQL database demonstrates the feasibility of the proposed mechanism, which, to the best of our knowledge, has not been previously shown."],"dc:identifier":["https://digitalcommons.usu.edu/etd/8227"],"dc:identifier.doi":["https://doi.org/10.26076/77cc-998e"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["Temporal databases","sequenced semantics","log-segmented label","query evaluation","relational algebra","query translation","Computer Sciences"],"dc:title":["Achieving a Sequenced, Relational Query Language with Log-Segmented Timestamps"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:52:35Z"}