Sciweavers

513 search results - page 76 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 8 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
CIKM
2008
Springer
13 years 10 months ago
Modeling multi-step relevance propagation for expert finding
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
SENSYS
2004
ACM
14 years 1 months ago
Medians and beyond: new aggregation techniques for sensor networks
Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), makin...
Nisheeth Shrivastava, Chiranjeeb Buragohain, Divya...
ICIP
2006
IEEE
14 years 10 months ago
On the Use of Metrics for Multi-Dimensional Descriptors Clustering
The Visual Thesaurus is a new query approach when no starting image is available. It is a concise representation of all similar regions in a panel of visual patches; the user arra...
Hichem Houissa, Nozha Boujemaa
CIKM
1994
Springer
14 years 18 days ago
TID Hash Joins
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
Robert Marek, Erhard Rahm