Sciweavers

331 search results - page 42 / 67
» A framework for selective query expansion
Sort
View
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
14 years 12 days ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 10 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
14 years 1 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
SIGIR
2006
ACM
14 years 2 months ago
A study of statistical models for query translation: finding a good unit of translation
This paper presents a study of three statistical query translation models that use different units of translation. We begin with a review of a word-based translation model that us...
Jianfeng Gao, Jian-Yun Nie
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 1 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...