Sciweavers

3471 search results - page 487 / 695
» Data Stream Query Processing
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 13 hour ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
16 years 12 hour ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
ENTCS
2002
143views more  ENTCS 2002»
14 years 11 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...
WAIM
2007
Springer
15 years 6 months ago
Distributed, Hierarchical Clustering and Summarization in Sensor Networks
We propose DHCS, a method of distributed, hierarchical clustering and summarization for online data analysis and mining in sensor networks. Different from the acquisition and aggre...
Xiuli Ma, Shuangfeng Li, Qiong Luo, Dongqing Yang,...
DEBS
2009
ACM
15 years 3 months ago
Event-based systems: opportunities and challenges at exascale
Streaming data models have been shown to be useful in many applications requiring high-performance data exchange. Application-level overlay networks are a natural way to realize t...
Greg Eisenhauer, Matthew Wolf, Hasan Abbasi, Karst...