Proximity search

In text processing, a proximity search looks for documents where two or more separately matching term occurrences are within a specified distance… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1988-2016
0519882016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
There has been a large amount of research on early termination techniques in web search and information retrieval. Such… (More)
  • figure 4-1
  • table 5-1
  • table 5-2
  • table 5-3
  • table 5-4
Is this relevant?
2009
2009
In this paper, we propose the “added” use of proximity search to a web search query for narrowing down the set of… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In keyword search over data graphs, an answer is a nonredundant subtree that includes the given keywords. An algorithm for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We introduce a new probabilistic proximity search algorithm for range and A"-nearest neighbor (A"-NN) searching in both… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Recent works have shown the benefits of keyword proximity search in querying XML documents in addition to text documents. For… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Various approaches for keyword proximity search have been implemented in relational databases, XML and the Web. Yet, in all of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2005
2005
This paper presents a formal framework for investigating keyword proximity search. Within this framework, three variants of… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a simple deterministic data structure for maintaining a set <i>S</i> of points in a general metric space, while… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
With few exceptions, proximity search algorithms in metric spaces based on the use of pivots select them at random among the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?