3020 search results - page 322 / 604 » Similarity Queries on Structured Data in Structured Overlays |
172
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
202
click to vote
SIGIR
2006
ACM
16 years 24 days ago
2006
ACM
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
170
click to vote
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
124
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
192
click to vote
IPL
2006
15 years 6 months ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...