dc.contributor.author |
LORENTZOS, NA |
en |
dc.contributor.author |
POULOVASSILIS, A |
en |
dc.contributor.author |
SMALL, C |
en |
dc.date.accessioned |
2014-06-06T06:42:43Z |
|
dc.date.available |
2014-06-06T06:42:43Z |
|
dc.date.issued |
1994 |
en |
dc.identifier.issn |
0010-4620 |
en |
dc.identifier.uri |
http://62.217.125.90/xmlui/handle/123456789/782 |
|
dc.subject.classification |
Computer Science, Hardware & Architecture |
en |
dc.subject.classification |
Computer Science, Information Systems |
en |
dc.subject.classification |
Computer Science, Software Engineering |
en |
dc.subject.other |
TIME |
en |
dc.title |
IMPLEMENTATION OF UPDATE OPERATIONS FOR INTERVAL RELATIONS |
en |
heal.type |
journalArticle |
en |
heal.language |
English |
en |
heal.publicationDate |
1994 |
en |
heal.abstract |
The concept of an interval has application in diverse areas, including temporal and spatial databases, However, the semantics of set-union and set-difference are inappropriate for the update of interval relations (i.e. of relations with interval attributes). In particular, we discuss bow set-union can yield relations in which data is duplicated over several tuples and how set-difference does not implement the desired deletion semantics. This leads tis to the definition of a normalized representation for interval relations in which there is no duplication of data over several tubules: we call such relations canonical ones. We define a pair of update operations which complement set-union and set-difference, give the desired update semantics, and maintain the property of canonicity. We give algorithms for these update operations. An examination of the efficiency of these operations leads us to propose two pairs of successively more optimized operations and we give algorithms for these also. The contribution of this paper is the development of efficient algorithms for updating interval relations while maintaining the desired update semantics and preserving the non-redundancy of the data. |
en |
heal.publisher |
CAMBRIDGE UNIV PRESS |
en |
heal.journalName |
COMPUTER JOURNAL |
en |
dc.identifier.issue |
3 |
en |
dc.identifier.volume |
37 |
en |
dc.identifier.isi |
ISI:A1994NW66600002 |
en |
dc.identifier.spage |
164 |
en |
dc.identifier.epage |
176 |
en |