A comparison of historical relational query languages

Simple item page
dc.citation.epage282en_US
dc.citation.spage275en_US
dc.contributor.authorTansel, Abdullah Uzen_US
dc.contributor.authorTin, E.en_US
dc.coverage.spatialLondon, England
dc.date.accessioned2016-02-08T12:01:49Z
dc.date.available2016-02-08T12:01:49Z
dc.date.issued1994-07en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionConference name: Proceedings of the 1994 Engineering Systems Design and Analysis Conference : presented at the Second Biennial European Joint Conference on Engineering Systems Design and Analysis
dc.descriptionDate of Conference: 4-7 July, 1994
dc.description.abstractWe introduce a historical relational data model in which N1NF relations are used and 1-level of nesting is allowed. Attributes can either be atomic or temporal atom. An atomic attribute represents a time invariant attribute. A temporal atom consists of two components, a value and a temporal set, which is a set of times denoting the validity period of the value. We define a relational tuple calculus for this model. We follow a comparative approach towards completeness of historical query languages.en_US
dc.identifier.urihttp://hdl.handle.net/11693/27790
dc.language.isoEnglishen_US
dc.publisherASMEen_US
dc.source.titleThe Second Biennial European Joint Conference on Engineering Systems Design and Analysis,1994en_US
dc.subjectComputational complexityen_US
dc.subjectData structuresen_US
dc.subjectRelational database systemsen_US
dc.subjectHistorical database (HDB)en_US
dc.subjectRelational query languagesen_US
dc.subjectQuery languagesen_US
dc.titleA comparison of historical relational query languagesen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
bilkent-research-paper.pdf
Size:
68.58 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Computer Engineering