Sciweavers

517 search results - page 3 / 104
» Efficient Computation of Diverse Query Results
Sort
View
SAC
2009
ACM
14 years 2 months ago
Diverse peer selection in collaborative web search
Effective peer selection for intelligent query routing is a challenge in collaborative peer-based Web search systems, especially unstructured networks that do not have any central...
Le-Shin Wu, Filippo Menczer
INFOVIS
2003
IEEE
14 years 24 days ago
Constant Density Displays Using Diversity Sampling
The Informedia Digital Video Library user interface summarizes query results with a collage of representative keyframes. We present a user study in which keyframe occlusion caused...
Mark Derthick, Michael G. Christel, Alexander G. H...
DAWAK
2009
Springer
13 years 11 months ago
Skyline View: Efficient Distributed Subspace Skyline Computation
Skyline queries have gained much attention as alternative query semantics with pros (e.g.low query formulation overhead) and cons (e.g.large control over result size). To overcome ...
Jinhan Kim, Jongwuk Lee, Seung-won Hwang
VLDB
1998
ACM
105views Database» more  VLDB 1998»
13 years 11 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
PODS
2006
ACM
98views Database» more  PODS 2006»
14 years 7 months ago
Processing queries on tree-structured data efficiently
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
Christoph Koch