1007 search results - page 162 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
128
click to vote
SBBD
2004
15 years 3 months ago
2004
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
143
Voted
CN
2007
15 years 2 months ago
2007
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
179
click to vote
BMCBI
2011
14 years 6 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
109
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
131
click to vote
CIKM
2010
Springer
15 years 28 days ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...