Show simple item record

dc.contributor.authorÜnal, A.en_US
dc.contributor.authorSaygın, Y.en_US
dc.contributor.authorUlusoy, Özgüren_US
dc.date.accessioned2016-02-08T10:18:39Z
dc.date.available2016-02-08T10:18:39Z
dc.date.issued2006-07-22en_US
dc.identifier.issn0020-0255
dc.identifier.urihttp://hdl.handle.net/11693/23755
dc.description.abstractManagement and analysis of streaming data has become crucial with its applications to web, sensor data, network traffic data, and stock market. Data streams consist of mostly numeric data but what is more interesting are the events derived from the numerical data that need to be monitored. The events obtained from streaming data form event streams. Event streams have similar properties to data streams, i.e., they are seen only once in a fixed order as a continuous stream. Events appearing in the event stream have time stamps associated with them at a certain time granularity, such as second, minute, or hour. One type of frequently asked queries over event streams are count queries, i.e., the frequency of an event occurrence over time. Count queries can be answered over event streams easily, however, users may ask queries over different time granularities as well. For example, a broker may ask how many times a stock increased in the same time frame, where the time frames specified could be an hour, day, or both. Such types of queries are challenging especially in the case of event streams where only a window of an event stream is available at a certain time instead of the whole stream. In this paper, we propose a technique for predicting the frequencies of event occurrences in event streams at multiple time granularities. The proposed approximation method efficiently estimates the count of events with a high accuracy in an event stream at any time granularity by examining the distance distributions of event occurrences. The proposed method has been implemented and tested on different real data sets including daily price changes in two different stock exchange markets. The obtained results show its effectiveness. © 2005 Elsevier Inc. All rights reserved.en_US
dc.language.isoEnglishen_US
dc.source.titleInformation Sciencesen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.ins.2005.10.006en_US
dc.subjectCount queriesen_US
dc.subjectData streamsen_US
dc.subjectEvent streamsen_US
dc.subjectTime granularityen_US
dc.subjectAssociation rulesen_US
dc.subjectData miningen_US
dc.subjectApproximation theoryen_US
dc.titleProcessing count queries over event streams at multiple time granularitiesen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage2066en_US
dc.citation.epage2096en_US
dc.citation.volumeNumber176en_US
dc.citation.issueNumber14en_US
dc.identifier.doi10.1016/j.ins.2005.10.006en_US
dc.publisherElsevier Inc.en_US
dc.contributor.bilkentauthorUlusoy, Özgür


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record