Aggregate operations are valuable tools for data analysis in databases. For example, the traditional aggregates like sum, average, count, min and max enable powerful analysis over data in relational databases. Set operations like union, intersection and difference can be used to find aggregate values on spatial, temporal and spatiotemporal data. They take a set of regions, either static or moving, and return a single region. Though there were existing structures to find an aggregate value on spatiotemporal data, they are not efficient to query aggregates on moving regions. This paper proposes a structure that we can use to find different types of aggregates on moving regions.
|Commitee:||Ercal, Gunes, Yu, Xudong|
|School:||Southern Illinois University at Edwardsville|
|School Location:||United States -- Illinois|
|Source:||MAI 58/03M(E), Masters Abstracts International|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be