184 search results - page 22 / 37 » Efficient Range Query Retrieval for Non-Uniform Data Distrib... |
138
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
166
click to vote
MST
2006
15 years 3 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
257
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
141
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
174
click to vote
CIKM
2006
Springer
15 years 5 months ago
2006
Springer
In an expert search task, the users' need is to identify people who have relevant expertise to a topic of interest. An expert search system predicts and ranks the expertise o...