Sciweavers

651 search results - page 4 / 131
» Algebraic Query Optimization for Distributed Top-k Queries
Sort
View
EDBT
2002
ACM
246views Database» more  EDBT 2002»
14 years 7 months ago
Impact and Potential of User Profiles Used for Distributed Query Processing Based on Literature Services
Applying meta search systems is a suitable method to support the user if there are many different services. Due to information splitting strategies of literature services existing ...
Bethina Schmitt
ICTIR
2009
Springer
13 years 5 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette
DMSN
2005
ACM
13 years 9 months ago
The threshold join algorithm for top-k queries in distributed sensor networks
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
Demetrios Zeinalipour-Yazti, Zografoula Vagena, Di...
DLOG
2010
13 years 5 months ago
Query Algebra and Query Optimization for Concept Assertion Retrieval
We develop a query algebra that supports efficient assertion retrieval--a natural extension of instance retrieval. The algebra is based on previously developed techniques for index...
Jeffrey Pound, David Toman, Grant E. Weddell, Jiew...
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 8 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid