Sciweavers

467 search results - page 13 / 94
» Processing top k queries from samples
Sort
View
EDBT
2009
ACM
131views Database» more  EDBT 2009»
14 years 15 days ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
SIGIR
2005
ACM
14 years 2 months ago
Detecting dominant locations from search queries
Accurately and effectively detecting the locations where search queries are truly about has huge potential impact on increasing search relevance. In this paper, we define a search...
Lee Wang, Chuang Wang, Xing Xie, Josh Forman, Yans...
CVPR
2008
IEEE
14 years 11 months ago
Semantic-based indexing of fetal anatomies from 3-D ultrasound data using global/semi-local context and sequential sampling
The use of 3-D ultrasound data has several advantages over 2-D ultrasound for fetal biometric measurements, such as considerable decrease in the examination time, possibility of p...
Gustavo Carneiro, Fernando Amat, Bogdan Georgescu,...
SPIRE
2005
Springer
14 years 2 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi
CIKM
2011
Springer
12 years 9 months ago
Ranking-based processing of SQL queries
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
Hany Azzam, Thomas Roelleke, Sirvan Yahyaei