earticle

영어

In many applications such as sensor networks, similarity search is more practical than exact match in stream processing, where both the queries and the data items are always change over time. The volumes of multi-streams could be very large, since new items are continuously appended. The main idea is to build a small size of synopsis instead of keeping original streams by using our proposed techniques, then to provide approximate answers for many different classes of aggregate queries. In this paper, we present D-skyline and T-skyline methods give almost “true” results on approximated analysis for similarity search query in streaming environments.