Sciweavers

2736 search results - page 106 / 548
» Indexing uncertain data
Sort
View
DAWAK
2005
Springer
15 years 12 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 10 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 10 months ago
Similarity-Based Queries for Time Series Data
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We ha...
Davood Rafiei, Alberto O. Mendelzon
ICDE
2003
IEEE
149views Database» more  ICDE 2003»
16 years 7 months ago
Indexing Weighted-Sequences in Large Databases
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...
Haixun Wang, Chang-Shing Perng, Wei Fan, Sanghyun ...
VLDB
1999
ACM
131views Database» more  VLDB 1999»
15 years 10 months ago
High-Performance Extensible Indexing
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
Marcel Kornacker