Sciweavers

1038 search results - page 80 / 208
» Space-Bounded Query Approximation
Sort
View
115
Voted
CIKM
2007
Springer
15 years 8 months ago
Detecting distance-based outliers in streams of data
In this work a method for detecting distance-based outliers in data streams is presented. We deal with the sliding window model, where outlier queries are performed in order to de...
Fabrizio Angiulli, Fabio Fassetti
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 4 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
202
Voted
MMS
2011
14 years 9 months ago
Dynamic behavior of balanced NV-trees
Abstract In recent years, some approximate highdimensional indexing techniques have shown promising results by trading off quality guarantees for improved query performance. While ...
Arnar Ólafsson, Björn Þór...
222
Voted
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
16 years 4 months ago
Answering Imprecise Queries over Autonomous Web Databases
Current approaches for answering queries with imprecise constraints require user-specific distance metrics and importance measures for attributes of interest - metrics that are ha...
Ullas Nambiar, Subbarao Kambhampati
109
Voted
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
16 years 2 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao