Implementation of Update Operations for Interval Relations | Zendy

Nikos A. Lorentzos | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Implementation of Update Operations for Interval Relations

Author(s) -

Nikos A. Lorentzos

Publication year - 1994

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/37.3.164

Subject(s) - tuple , set operations , computer science , interval (graph theory) , theoretical computer science , complement (music) , semantics (computer science) , redundancy (engineering) , set (abstract data type) , algorithm , mathematics , data mining , discrete mathematics , programming language , combinatorics , biochemistry , chemistry , complementation , phenotype , gene , operating system

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 how 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 us to the definition of a normalized representation for interval relations in which there is no duplication of data over several tuples: 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 canoricity

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research