| 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:58Z |
|
| dc.date.available |
2014-06-06T06:42:58Z |
|
| dc.date.issued |
1995 |
en |
| dc.identifier.issn |
0169023X |
en |
| dc.identifier.uri |
http://62.217.125.90/xmlui/handle/123456789/921 |
|
| dc.relation.uri |
http://www.scopus.com/inward/record.url?eid=2-s2.0-0029386667&partnerID=40&md5=7adc9cf82140175a8d53dfd21ecb00a3 |
en |
| dc.subject |
Database management |
en |
| dc.subject |
Interval data type |
en |
| dc.subject |
Multi-dimensional interval data |
en |
| dc.subject |
Spatial databases |
en |
| dc.subject |
Temporal databases |
en |
| dc.subject.other |
Data acquisition |
en |
| dc.subject.other |
Data structures |
en |
| dc.subject.other |
Distributed database systems |
en |
| dc.subject.other |
Management information systems |
en |
| dc.subject.other |
Mathematical operators |
en |
| dc.subject.other |
Optimization |
en |
| dc.subject.other |
Query languages |
en |
| dc.subject.other |
Interval data types |
en |
| dc.subject.other |
Spatial databases |
en |
| dc.subject.other |
Temporal databases |
en |
| dc.subject.other |
Relational database systems |
en |
| dc.title |
Manipulation operations for an interval-extended relational model |
en |
| heal.type |
journalArticle |
en |
| heal.publicationDate |
1995 |
en |
| heal.abstract |
We identify semantic problems associated with the querying and updating of spatio-temporal interval data and propose operations which alleviate these problems. We first motivate two key requirements for the manipulation of such data, namely that no two tuples of a relation should intersect or be mergeable. We then examine the properties of two operations, unfold and fold, and show how they can be used to define three further operations which, respectively: eliminate intersecting or mergeable data from a relation incorporating interval attributes, yielding a so-called canonical relation: add data to a canonical relation while preserving the canonicity property; and remove data from a canonical relation while also preserving canonicity. We formally show the correctness of all these operations. An examination of their space and time requirements then leads us to define an equivalent set of optimised operations. We formally show the equivalence of the non-optimised and optimised operations, and discuss the performance gains of the latter. © 1995. |
en |
| heal.journalName |
Data and Knowledge Engineering |
en |
| dc.identifier.issue |
1 |
en |
| dc.identifier.volume |
17 |
en |
| dc.identifier.spage |
1 |
en |
| dc.identifier.epage |
29 |
en |