Sciweavers

55 search results - page 10 / 11
» Randomized Synopses for Query Assurance on Data Streams
Sort
View
PODS
2010
ACM
232views Database» more  PODS 2010»
13 years 11 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 10 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
PVLDB
2008
110views more  PVLDB 2008»
13 years 6 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons
COOPIS
1999
IEEE
13 years 10 months ago
Using Fagin's Algorithm for Merging Ranked Results in Multimedia Middleware
A distributed multimedia information system allows users to access data of different modalities, from different data sources, ranked by various combinationsof criteria. In [6], Fa...
Edward L. Wimmers, Laura M. Haas, Mary Tork Roth, ...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 6 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi