Sciweavers

301 search results - page 45 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
15 years 10 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
BMCBI
2007
177views more  BMCBI 2007»
14 years 11 months ago
The BioPrompt-box: an ontology-based clustering tool for searching in biological databases
Background: High-throughput molecular biology provides new data at an incredible rate, so that the increase in the size of biological databanks is enormous and very rapid. This sc...
Claudio Corsi, Paolo Ferragina, Roberto Marangoni
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
15 years 3 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
TKDE
2008
146views more  TKDE 2008»
14 years 11 months ago
Toward Managing Uncertain Spatial Information for Situational Awareness Applications
Situational awareness (SA) applications monitor the real world and the entities therein to support tasks such as rapid decision making, reasoning, and analysis. Raw input about unf...
Yiming Ma, Dmitri V. Kalashnikov, Sharad Mehrotra
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
15 years 11 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...