1091 search results - page 155 / 219 » Approximation in Databases |
105
click to vote
SIGMOD
1994
ACM
15 years 6 months ago
1994
ACM
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
127
click to vote
DEXA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
125
click to vote
DEXA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
160
click to vote
EDBT
2009
ACM
15 years 5 months ago
2009
ACM
Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that...
117
Voted
DEXA
2006
Springer
15 years 4 months ago
2006
Springer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...