Sciweavers

386 search results - page 64 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
COMPGEOM
2004
ACM
14 years 2 months ago
Range counting over multidimensional data streams
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
14 years 3 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
ICDE
2009
IEEE
140views Database» more  ICDE 2009»
13 years 6 months ago
Routing Questions to the Right Users in Online Communities
Online forums contain huge amounts of valuable user-generated content. In current forum systems, users have to passively wait for other users to visit the forum systems and read/an...
Yanhong Zhou, Gao Cong, Bin Cui, Christian S. Jens...
MM
2006
ACM
168views Multimedia» more  MM 2006»
14 years 2 months ago
Scalability of local image descriptors: a comparative study
Computer vision researchers have recently proposed several local descriptor schemes. Due to lack of database support, however, these descriptors have only been evaluated using sma...
Herwig Lejsek, Friðrik Heiðar Ásmun...
DOLAP
2007
ACM
14 years 28 days ago
OLAP preferences: a research agenda
Expressing preferences when querying databases is a natural way to avoid empty results and information flooding, and in general to rank results so that the user may first see the ...
Stefano Rizzi