Sciweavers

4468 search results - page 354 / 894
» Processing Forecasting Queries
Sort
View
DOLAP
2005
ACM
15 years 8 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
DKE
2006
123views more  DKE 2006»
15 years 6 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
CIKM
2010
Springer
15 years 5 months ago
Query optimization for ontology-based information integration
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
Yingjie Li, Jeff Heflin
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 8 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei
WWW
2009
ACM
16 years 7 months ago
Unsupervised query categorization using automatically-built concept graphs
Automatic categorization of user queries is an important component of general purpose (Web) search engines, particularly for triggering rich, query-specific content and sponsored ...
Eustache Diemert, Gilles Vandelle