Sciweavers

449 search results - page 61 / 90
» Novel Optimization Techniques for Modern Database Environmen...
Sort
View
BMCBI
2006
120views more  BMCBI 2006»
13 years 7 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
13 years 11 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
ICDT
2007
ACM
121views Database» more  ICDT 2007»
14 years 1 months ago
Compact Samples for Data Dissemination
We consider data dissemination in a peer-to-peer network, where each user wishes to obtain some subset of the available information objects. In most of the modern algorithms for su...
Tova Milo, Assaf Sagi, Elad Verbin
ISCC
2008
IEEE
123views Communications» more  ISCC 2008»
14 years 1 months ago
Improving reliability and energy efficiency of disk systems via utilization control
As disk drives become increasingly sophisticated and processing power increases, one of the most critical issues of designing modern disk systems is data reliability. Although num...
Kiranmai Bellam, Adam Manzanares, Xiaojun Ruan, Xi...
KDD
2009
ACM
208views Data Mining» more  KDD 2009»
14 years 8 months ago
A principled and flexible framework for finding alternative clusterings
The aim of data mining is to find novel and actionable insights in data. However, most algorithms typically just find a single (possibly non-novel/actionable) interpretation of th...
Zijie Qi, Ian Davidson