Sciweavers

117 search results - page 19 / 24
» Query suggestion using hitting time
Sort
View
DCC
2004
IEEE
14 years 6 months ago
Online Suffix Trees with Counts
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
Breanndán Ó Nualláin, Steven ...
IPPS
2006
IEEE
14 years 22 days ago
Model-based evaluation of search strategies in peer-to-peer networks
This paper exploits a previously developed analytical modeling framework to compare several variations of the basic flooding search strategy in unstructured decentralized peer-to...
Rossano Gaeta, Matteo Sereno
MSWIM
2006
ACM
14 years 20 days ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
SSDBM
2007
IEEE
118views Database» more  SSDBM 2007»
14 years 29 days ago
Database Support for Weighted Match Joins
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
Ameet Kini, Jeffrey F. Naughton
PLDI
2010
ACM
13 years 10 months ago
Detecting Inefficiently-Used Containers to Avoid Bloat
Runtime bloat degrades significantly the performance and scalability of software systems. An important source of bloat is the inefficient use of containers. It is expensive to cre...
Guoqing Xu, Atanas Rountev