Processing temporal aggregates over networked workstations

Show simple item record

dc.contributor.author Ye, Xinfeng en
dc.contributor.author Keane, John A. en
dc.date.accessioned 2009-06-16T01:53:01Z en
dc.date.available 2009-06-16T01:53:01Z en
dc.date.issued 1998 en
dc.identifier.citation Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. San Diego, CA, USA, 2513-2518. (1998) en
dc.identifier.issn 08843627 en
dc.identifier.uri http://hdl.handle.net/2292/4405 en
dc.description An open access copy of this article is available and complies with the copyright holder/publisher conditions. en
dc.description.abstract TSQL2 is a query language designed for temporal databases. In TSQL2, the GROUP BY clause has a temporal grouping property. In temporal grouping, the time line of each attribute value is partitioned into several sections, and aggregate functions are computed for each time partition. This paper describes two parallel algorithms, data partition and group partition, which compute temporal aggregates over a network of workstations. In the group partition scheme, each workstation maintains the entire aggregate tree for some attribute values selected by the GROUP BY clause. Thus, some workstations may be overloaded while others are idle for most of the time. In the data partition scheme, all the workstations participate in constructing the aggregate trees in the first phase of the scheme. Thus the load is evenly distributed across the workstations in the system in the first phase of the scheme. However, before the second phase starts, workstations must exchange the aggregate trees generated at the first phase. A simulator has been used to test the performance of the two algorithms. The results show that the performance of algorithm group partition is slightly better than data partition en
dc.publisher IEEE en
dc.relation.ispartof Proceedings of the IEEE International Conference on Systems, Man and Cybernetics en
dc.rights Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.title Processing temporal aggregates over networked workstations en
dc.type Conference Paper en
dc.subject.marsden Fields of Research::290000 Engineering and Technology en
dc.identifier.doi 10.1109/ICSMC.1998.725035 en
pubs.begin-page 2513-2518. en
dc.description.version VoR - Version of Record en
dc.rights.holder Copyright IEEE en
dc.rights.accessrights http://purl.org/eprint/accessRights/OpenAccess en


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics