Sciweavers

91 search results - page 13 / 19
» TID Hash Joins
Sort
View
ISM
2008
IEEE
119views Multimedia» more  ISM 2008»
16 years 3 days ago
Using Exact Locality Sensitive Mapping to Group and Detect Audio-Based Cover Songs
Cover song detection is becoming a very hot research topic when plentiful personal music recordings or performance are released on the Internet. A nice cover song recognizer helps...
Yi Yu, J. Stephen Downie, Fabian Mörchen, Lei...
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 11 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
162
Voted
CN
2010
136views more  CN 2010»
15 years 5 months ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
258
Voted
ICDE
2008
IEEE
120views Database» more  ICDE 2008»
16 years 7 months ago
Sideways Information Passing for Push-Style Query Processing
In many modern data management settings, data is queried from a central node or nodes, but is stored at remote sources. In such a setting it is common to perform "pushstyle&qu...
Zachary G. Ives, Nicholas E. Taylor
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 5 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...