Sciweavers

485 search results - page 56 / 97
» Processing complex aggregate queries over data streams
Sort
View
200
Voted
SIGMOD
2011
ACM
442views Database» more  SIGMOD 2011»
14 years 3 months ago
ArrayStore: a storage manager for complex parallel array processing
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
Emad Soroush, Magdalena Balazinska, Daniel L. Wang
PODS
2006
ACM
134views Database» more  PODS 2006»
16 years 20 days ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
116
Voted
PVLDB
2010
252views more  PVLDB 2010»
14 years 7 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu
ALGORITHMICA
2002
97views more  ALGORITHMICA 2002»
15 years 12 days ago
Testing and Spot-Checking of Data Streams
Abstract. We consider the tasks of testing and spot-checking for data streams. These testers and spotcheckers are potentially useful in real-time or near real-time applications tha...
Joan Feigenbaum, Sampath Kannan, Martin Strauss, M...
196
Voted
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
16 years 1 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...