Sciweavers

3688 search results - page 253 / 738
» Requirements of Phylogenetic Databases
Sort
View
ICDE
2005
IEEE
123views Database» more  ICDE 2005»
16 years 8 months ago
High-Availability Algorithms for Distributed Stream Processing
Stream-processing systems are designed to support an emerging class of applications that require sophisticated and timely processing of high-volume data streams, often originating...
Alex Rasin, Jeong-Hyon Hwang, Magdalena Balazinska...
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
16 years 8 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
16 years 6 months ago
Supporting ad-hoc ranking aggregates
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
PODS
2004
ACM
143views Database» more  PODS 2004»
16 years 6 months ago
Approximate Counts and Quantiles over Sliding Windows
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...
Arvind Arasu, Gurmeet Singh Manku
EDBT
2008
ACM
95views Database» more  EDBT 2008»
16 years 6 months ago
Zerber: r-confidential indexing for distributed documents
To carry out work assignments, small groups distributed within a larger enterprise often need to share documents among themselves while shielding those documents from others'...
Sergej Zerr, Elena Demidova, Daniel Olmedilla, Wol...