613 search results - page 63 / 123 » Query Evaluation on a Database Given by a Random Graph |
228
Voted
GIS
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
151
Voted
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
137
Voted
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
120
Voted
PAKDD
2010
ACM
15 years 8 months ago
2010
ACM
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
138
Voted
VLDB
2002
ACM
15 years 3 months ago
2002
ACM
Many valuable text databases on the web have non-crawlable contents that are "hidden" behind search interfaces. Metasearchers are helpful tools for searching over many s...