The expressive power of temporal relational query languages
dc.citation.epage | 134 | en_US |
dc.citation.issueNumber | 1 | en_US |
dc.citation.spage | 120 | en_US |
dc.citation.volumeNumber | 9 | en_US |
dc.contributor.author | Tansel, A. U. | en_US |
dc.contributor.author | Tin, E. | en_US |
dc.date.accessioned | 2016-02-08T10:46:26Z | |
dc.date.available | 2016-02-08T10:46:26Z | en_US |
dc.date.issued | 1997 | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.description.abstract | We consider the representation of temporal data based on tuple and attribute timestamping. We identify the requirements in modeling temporal data and elaborate on their implications in the expressive power of temporal query languages. We introduce a temporal relational data model where N1NF relations and attribute timestamping are used and one level of nesting is allowed. For this model, a nested relational tuple calculus (NTC) is defined. We follow a comparative approach in evaluating the expressive power of temporal query languages, using NTC as a metric and comparing it with the existing temporal query languages. We prove that NTC subsumes the expressive power of these query languages. We also demonstrate how various temporal relational models can be obtained from our temporal relations by NTC and give equivalent NTC expressions for their languages. Furthermore, we show the equivalence of intervals and temporal elements (sets) as timestamps in our model. © 1997 IEEE. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T10:46:26Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1997 | en |
dc.identifier.doi | 10.1109/69.567055 | en_US |
dc.identifier.eissn | 1558-2191 | |
dc.identifier.issn | 1041-4347 | |
dc.identifier.uri | http://hdl.handle.net/11693/25538 | en_US |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/69.567055 | en_US |
dc.source.title | IEEE Transactions on Knowledge and Data Engineering | en_US |
dc.subject | Attribute Timestamping | en_US |
dc.subject | Expressive Power of Temporal Query Languages | en_US |
dc.subject | N1NF Relations | en_US |
dc.subject | Temporal Relational Calculus | en_US |
dc.subject | Temporal Relational Completeness | en_US |
dc.subject | Tuple timestamping | en_US |
dc.subject | Algebra | en_US |
dc.subject | Data Structures | en_US |
dc.subject | Differentiation (Calculus) | en_US |
dc.subject | Relational Database Systems | en_US |
dc.subject | Expressive Power | en_US |
dc.subject | Nested Relational Tuple Calculus | en_US |
dc.subject | Temporal Relational Algebra | en_US |
dc.subject | Temporal Relations | en_US |
dc.subject | Query Languages | en_US |
dc.title | The expressive power of temporal relational query languages | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- The expressive power of temporal relational query languages.pdf
- Size:
- 242.78 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version