Sciweavers

51 search results - page 2 / 11
» Dynamically Optimizing High-Dimensional Index Structures
Sort
View
PODS
1997
ACM
182views Database» more  PODS 1997»
13 years 9 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
14 years 6 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
CSB
2005
IEEE
125views Bioinformatics» more  CSB 2005»
13 years 11 months ago
On Optimizing Distance-Based Similarity Search for Biological Databases
Similarity search leveraging distance-based index structures is increasingly being used for both multimedia and biological database applications. We consider distance-based indexi...
Rui Mao, Weijia Xu, Smriti R. Ramakrishnan, Glen N...
DASFAA
2004
IEEE
87views Database» more  DASFAA 2004»
13 years 9 months ago
UB-Tree Based Efficient Predicate Index with Dimension Transform for Pub/Sub System
For event filtering of publish/subscribe system, significant research efforts have been dedicated to techniques based on multiple one-dimensional indexes built on attributes of sub...
Botao Wang, Wang Zhang, Masaru Kitsuregawa
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 6 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei