Semantics-based time-alignment operations in temporal query processing and optimization

In a temporal database, object properties and associations evolve very irregularly in time. Different evaluations of data objects with different valid intervals need to be recorded and processed for different temporal instances and their associations. Their intervals need to be aligned in order to find the common intervals in which the combined data are valid. Efficiency can be gained if, in every step of the traversals and manipulations, a minimal number of temporal instances is produced. This paper presents a set of semantics-based time-alignment operations defined as time-computation construct. They can be used as guides to determine the proper alignment operations that should be used to achieve efficient query processing. Five primitive time-alignment operations are defined in this paper. They can be combined and used to efficiently support different temporal query situations. As a byproduct of implementing a parallel temporal query processor on an nCUBE2 computer, we found that these time-alignment primitives and their combinations can be implemented efficiently using a memory mapping technique. We present this implementation technique and analyze its order of complexity. (C) Elsevier Science Inc. 1997.
Publisher
ELSEVIER SCIENCE INC
Issue Date
1997
Language
ENG
Article Type
Article
Keywords

EXTENDING RELATIONAL ALGEBRA; MODEL; LANGUAGE

Citation

INFORMATION SCIENCES, v.103, pp.37 - 70

ISSN
0020-0255
URI
http://hdl.handle.net/10203/74746
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 248
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0