52 search results - page 1 / 11 » Navigating nets: simple algorithms for proximity search |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
113
click to vote
SPIRE
2005
Springer
15 years 3 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
181
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
ESA
2010
Springer
14 years 10 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...