By Topic

On synchronous properties of periodically generated data sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
K. Munakata ; Graduate Sch. of Inf. Sci., Nara Inst. of Sci. & Technol., Japan ; M. Yoshikawa ; S. Uemura

We address the problem of choosing synchronous data combinations from periodically generated data sequences (PGDAs). In real time systems, PGDAs play a major role. When integrating PGDAs generated from various information sources, we face the problem of choosing which data combinations to use, since different PGDAs, in general, have different data generation intervals. A data combination is defined as a set of data each obtained from distinct PGDAs. As a criterion for choosing a data combination, we propose a novel notion of synchronousness of data combinations. We present two theorems for calculating upper bounds of the synchronousness of data combinations, given a set of PGDAs: one for PGDAs with the same periodic interval and the other for PGDAs with different periodic intervals. These theorems give the synchronousness upper bounds that guarantee to find the data combinations at the constant interval that is the same as the maximum periodic interval of all the PGDAs

Published in:

Database Applications in Non-Traditional Environments, 1999. (DANTE '99) Proceedings. 1999 International Symposium on

Date of Conference:

1999