Sciweavers

134 search results - page 23 / 27
» Approximate Nearest Neighbor Queries in Fixed Dimensions
Sort
View
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 7 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
TKDE
2010
195views more  TKDE 2010»
13 years 5 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
14 years 7 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...
EDBT
2008
ACM
99views Database» more  EDBT 2008»
14 years 7 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan
BIBE
2003
IEEE
183views Bioinformatics» more  BIBE 2003»
14 years 22 days ago
Effective Indexing and Filtering for Similarity Search in Large Biosequence Databases
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
Ozgur Ozturk, Hakan Ferhatosmanoglu