Sciweavers

486 search results - page 77 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
16 years 1 months ago
Holistic UDAFs at streaming speeds
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
Graham Cormode, Theodore Johnson, Flip Korn, S. Mu...
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
16 years 2 months ago
COLR-Tree: Communication-Efficient Spatio-Temporal Indexing for a Sensor Data Web Portal
Abstract-- We present COLR-Tree, an abstraction layer designed to support efficient spatio-temporal queries on live data gathered from a large collection of sensors. We use COLR-Tr...
Yanif Ahmad, Suman Nath
JIIS
2002
141views more  JIIS 2002»
15 years 1 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
ICDE
2007
IEEE
103views Database» more  ICDE 2007»
16 years 2 months ago
TCAM-conscious Algorithms for Data Streams
Recently, there has been significant interest in developing space and time efficient solutions for answering continuous summarization queries over data streams. While these techni...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 5 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel