Sciweavers

792 search results - page 95 / 159
» Computing Iceberg Queries Efficiently
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
14 years 9 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
15 years 9 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
BTW
2007
Springer
142views Database» more  BTW 2007»
15 years 4 months ago
Getting Prime Cuts from Skylines over Partially Ordered Domains
: Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numeric...
Wolf-Tilo Balke, Wolf Siberski, Ulrich Güntze...
EUROPAR
2008
Springer
14 years 11 months ago
A Search Engine Index for Multimedia Content
We present a distributed index data structure and algorithms devised to support parallel query processing of multimedia content in search engines. We present a comparative study wi...
Mauricio Marín, Veronica Gil Costa, Carolin...
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
15 years 10 months ago
Context-sensitive ranking
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
Rakesh Agrawal, Ralf Rantzau, Evimaria Terzi