A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.
Filters
Approximate Query Processing over Static Sets and Sliding Windows [article]
2018 arXiv pre-print
Preserved Fulltext
We also extend our model to sliding windows, in which we process a stream of elements and compute suffix sums. ... Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. ... XX:22 Approximate Query Processing over Static Sets and Sliding Windows 2. oldest ρ = 0 case.Here, since the value of oldest ρ is 0, we have that r 0 + d=1 Round b (x d ) < δ and thus ν Proofs ...
arXiv:1809.05419v1 fatcat:nladctksjfgp5ndpdvvh3wel3y
Approximate Query Processing over Static Sets and Sliding Windows
2021 Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.
We also extend our model to sliding windows, in which we process a stream of elements and compute suffix sums. ... Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. ... Consider Approximate Query Processing over Static Sets and Sliding Windows two distinct bit-strings B and B in S, and let i be the index of the leftmost block such that B i = B i . ...
doi:10.1016/j.tcs.2021.06.015 fatcat:5gii2vxg3zfh3kjpo3ww4vwa6i
Querying Sliding Windows Over Online Data Streams [chapter]
2004 Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL. The file type is application/pdf.
Processing continuous queries over data streams introduces a number of research problems, one of which concerns evaluating queries over sliding windows defined on the inputs. ... In this paper, we describe our research on sliding window query processing, with an emphasis on query models and algebras, physical and logical optimization, efficient processing of multiple windowed queries ... optimization, generating approximate statistics over sliding windows with error guarantees, and shared evaluation of windowed queries. ...
doi:10.1007/978-3-540-30192-9_1 fatcat:wsecmjqfxbcfjl5pm4lpiyeyo4
Declarative Network Monitoring with an Underprovisioned Query Processor
2006 22nd International Conference on Data Engineering (ICDE'06)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.
Provisioning a stream query processor to handle peak rates in such a setting can be prohibitively expensive. ... However, high-speed bursts and tight time constraints make implementing declarative query processing for network monitoring a difficult problem. ... We would also like to thank Boon Thao Loo, Ryan Huebsch, Yanlei Diao, and Shariq Rizvi for helpful comments on early drafts of this paper. ...
doi:10.1109/icde.2006.46 dblp:conf/icde/ReissH06 fatcat:cdsd53lyjrabvlnzf4k3xdmzfy
Alternate Data Clustering for Fast Pattern Matching in Stream Time Series Data [chapter]
2012 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.
This approach can be used for both static and dynamic stream data processing. The results obtained are the better than the existing algorithms. ... Presently, there is a demand for stream data processing, high speed searching and quick response. ... D is used to compare with pattern set, P = , ,..., , with the sliding window = ( , ,..., = w − 1), where i=1 ..., (t -w+1) and w is window size. ...
doi:10.1007/978-3-642-35615-5_22 fatcat:rvkmpjt3bbglpempjq4fbvyksm
On-the-fly sharing for streamed aggregation
2006 Proceedings of the 2006 ACM SIGMOD international conference on Management of data - SIGMOD '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.
These systems often have to process many similar but different queries over common data. ... In this paper we present ways to efficiently share streaming aggregate queries with differing periodic windows and arbitrary selection predicates. ... . , sn}, the slides of the queries in Q, and let T be the set of input tuples processed in the composite period S. ...
doi:10.1145/1142473.1142543 dblp:conf/sigmod/KrishnamurthyWF06 fatcat:ro4qgywofvfrpmwldnszu744se
Online summarization of dynamic time series data
2005 The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL. The file type is application/pdf.
Moreover, there has been little work on extending the summarization techniques to sliding windows, and maintaining the top coefficients of the transform-based summaries for sliding window applications ... Our experiments carefully evaluate the quality of the online summaries for point, range and k-nn queries using real-life dynamic data sets of substantial size. utilized in sensors networks and monitoring ... As the window slides both over the stream and the query, we computed the approximate answers based on the synopsis maintained by the proposed method. ...
doi:10.1007/s00778-004-0149-x fatcat:dcdyaibydjd6jef2h5ry6pbxxy
Real-time influence maximization on dynamic social streams
2017 Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.
Other Versions
Technically, SIM adopts the sliding window model and maintains a set of k seeds with the largest influence value over the most recent social actions. ... The IC framework creates a checkpoint for each window slide and ensures an ε-approximate solution. ... . • We address the limitations of existing IM solutions in supporting fast evolving social networks and propose a novel SIM query over sliding windows. ...
doi:10.14778/3067421.3067429 fatcat:yaiwmvdt6fdn5m5tj4zb6mvzfa
Location-aware Influence Maximization over Dynamic Social Streams
2018 ACM Transactions on Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.
Technically, SIM adopts the sliding window model and maintains a seed set with the maximum influence value collectively over the most recent social actions. ... Theoretically, SIC keeps a logarithmic number of checkpoints w.r.t. the size of the sliding window and always returns an approximate solution from one of the checkpoint for the SIM query at any time. ... Section 3 formally defines the SIM and LSIM queries over sliding windows. Then, Section 4 presents the SIC framework for SIM processing. ...
doi:10.1145/3230871 fatcat:iwncw6pzq5dufilah5enpayau4
Issues in data stream management
2003 SIGMOD record
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL. The file type is application/pdf.
Traditional databases store sets of relatively static records with no pre-defined notion of time, unless timestamp attributes are explicitly added. ... The purpose of this paper is to review recent work in data stream management systems, with an emphasis on application requirements, data models, continuous query languages, and query evaluation. * ... windowing to data models and query languages, implementing approximate operators, combining push-based and pull-based operators in query plans, adaptive query re-optimization, and distributed query processing ...
doi:10.1145/776985.776986 fatcat:soq554qj5nc7rkyifpm5vkuylm
Query Processing, Approximation, and Resource Management in a Data Stream Management System
2003 Conference on Innovative Data Systems Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL. The file type is application/pdf.
The STREAM system supports a declarative query language, and it copes with high data rates and query workloads by providing approximate answers when resources are limited. ... This paper describes our ongoing work developing the Stanford Stream Data Manager (STREAM), a system for executing continuous queries over multiple continuous data streams. ... We are grateful to Aris Gionis, Jon McAlister, Liadan O'Callaghan, Qi Sun, and Jeff Ullman for their participation in the STREAM project, and to Bruce Lindsay for his excellent suggestion about heartbeats ...
dblp:conf/cidr/MotwaniWABBDMORV03 fatcat:wg6rzsl36bamng4mnvkoa7qcjm
Maintaining Sliding-Window Neighborhood Profiles in Interaction Networks [chapter]
2015 Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.
The summary of the graph is maintained such that query of any window length can be performed. ... We present an online streaming algorithm to maintain neighborhood profiles in the sliding-window model. ... An interaction network over G is now defined as a pair (G, E), where G is a static graph and E is a set of interactions. We should point out that we do not need to know E beforehand. ...
doi:10.1007/978-3-319-23525-7_44 fatcat:hdy7mcrepbhmtgguudkkwwgzli
Adaptively Routing P2P Queries Using Association Analysis
2006 2006 International Conference on Parallel Processing (ICPP'06)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.
This work borrows the technique of association analysis from the data mining community and extends it to intelligently forward queries through the network. ... Because only a small subset of a node's neighbors are forwarded queries, the number of times those queries are propagated is also reduced, which results in considerably less network traffic. ... Fig. 1 . 1 Coverage and Success of Sliding Window over time Fig. 2. Coverage Sliding Window over time using different block sizes. Fig. 3 . 3 Coverage and Success of Lazy Sliding Window over time. ...
doi:10.1109/icpp.2006.18 dblp:conf/icpp/ConnellyBXTW06 fatcat:tscsdt5t45cnbmzsu76djfhtza
Continuously monitoring top-k uncertain data streams: a probabilistic threshold method
2009 Distributed and parallel databases
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL. The file type is application/pdf.
Recently, uncertain data processing has become more and more important. ... An extensive empirical study using real data sets and synthetic data sets is reported to verify the effectiveness and the efficiency of our methods. ... The current sliding window is processed. We are ready to slide the window to the next time instant (t + 2). Table 3 . ...
doi:10.1007/s10619-009-7043-x fatcat:ti4uiuns7rgrjensmqgoypmvsi
Heuristic Event Filtering Methodology for Interval based Temporal Semantics
2013 International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.
Continuous queries can be evaluated by sliding a window over the recent events. Imposing Sliding Windows on events is a natural method of approximation. ... Properties in Sliding Window approximation include well definiteness, easily understandable and clear semantics. ...
doi:10.5120/11974-7836 fatcat:te5ecf4dazbj5odl2sabiqguja
« Previous Showing results 1 — 15 out of 8,955 results