Show simple item record

dc.contributor.authorAguilar-Saborit, J.en
dc.contributor.authorTrancoso, Pedroen
dc.contributor.authorMuntes-Mulero, V.en
dc.contributor.authorLarriba-Pey, J. L.en
dc.creatorAguilar-Saborit, J.en
dc.creatorTrancoso, Pedroen
dc.creatorMuntes-Mulero, V.en
dc.creatorLarriba-Pey, J. L.en
dc.date.accessioned2019-11-13T10:38:11Z
dc.date.available2019-11-13T10:38:11Z
dc.date.issued2008
dc.identifier.issn0169-023X
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/53502
dc.description.abstractThe monitoring of data streams is a very important issue in many different areas. Aspects such as accuracy, the speed of response, the use of memory and the adaptability to the changing nature of data may vary in importance depending on the situation. Examples such as Web page access monitoring, approximate aggregation in relational queries or IP message routing are clear examples of a varied range of those needs. There are different data structures that deal with this problem such as the counting bloom filters, the spectral bloom filters and the dynamic count filters. Those data structures range from static to complex dynamic representations of the data stream that keep an approximate count of the number of occurrences for each data value. In this paper, we focus on three main aspects. First, we analyze the problem in perspective and review the existing static and dynamic solutions. Second, we propose and analyze in depth a simple yet powerful partitioning strategy that reinforces the advantages of the methods proposed up to now solving most of their drawbacks. Finally, using real executions and mathematical models, we evaluate the existing methods alone and in combination with our partitioning strategy. We show that with our partitioning strategy, it is possible to reduce the memory requirements and average response time, improving the adaptiveness to changing data characteristics and leaving the accuracy of the partitioned dynamic data structures intact. © 2008 Elsevier B.V. All rights reserved.en
dc.sourceData and Knowledge Engineeringen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-44349134967&doi=10.1016%2fj.datak.2007.12.006&partnerID=40&md5=81011d6d18b44a77c409dd945b049a61
dc.subjectWebsitesen
dc.subjectMessage passingen
dc.subjectAdaptive systemsen
dc.subjectBloom filtersen
dc.subjectCounting bloom filtersen
dc.subjectData streamsen
dc.subjectData structuresen
dc.subjectDynamic count filtersen
dc.subjectQuery processingen
dc.titleDynamic adaptive data structures for monitoring data streamsen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1016/j.datak.2007.12.006
dc.description.volume66
dc.description.issue1
dc.description.startingpage92
dc.description.endingpage115
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeArticleen
dc.source.abbreviationData Knowl.Eng.en
dc.contributor.orcidTrancoso, Pedro [0000-0002-2776-9253]
dc.gnosis.orcid0000-0002-2776-9253


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record