237 search results - page 8 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
EDBT
2004
ACM
14 years 8 months ago
2004
ACM
Abstract. Hierarchical clustering has been proved an effective means for physically organizing large fact tables since it reduces significantly the I/O cost during ad hoc OLAP quer...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
In this paper, we explore the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial sp...
BIOINFORMATICS
2011
12 years 11 months ago
2011
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
VLDB
2006
ACM
14 years 8 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...