Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of DSpace
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Ooi Beng Chin"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • No Thumbnail Available
    Item
    On Spatially Partitioned Temporal Join
    (1994-01-01T00:00:00Z) Lu Hongjun; Ooi Beng Chin; Tan Kian Lee
    Temporal relations are relations in temporal database which have one or more attributes whose values vary along the time. The most common representation of time adopted in such databases are the time intervals during which those attributes have specified values. Time join in a temporal database matches tuples from two temporal relations whose time intervals overlap. It is an important but very expensive operation because the volume of temporal data is usually large and the join is a non-equijoin operation in nature. This paper presents a partition-based time join method and its supporting storage structure. Under the proposed method, time intervals in a temporal relations are mapped to points in a two dimensional space. These points are stored in clustered buckets whose addresses can be easily computed with the help of a semi-dynamic directory. When a time join of two relations is to be performed, a bucket in one relation only need to be compared with a determinable set of buckets of the other relation whose addresses can also be efficiently computed. As such, the proposed algorithm outperforms both the nested-loops and sort-merge based time join algorithms. The time-space mapping mechanism, the storage structure, and the join algorithms are discussed. Some results of our preliminary performance study are also provided to show the efficiency of the proposed method.

DSpace software copyright © 2002-2025 LYRASIS

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback