Sciweavers

274 search results - page 3 / 55
» Computational complexity of queries based on itemsets
Sort
View
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 5 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...
ICTAI
2008
IEEE
14 years 5 days ago
Answering Complex Questions Using Query-Focused Summarization Technique
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...
Yllias Chali, Shafiq R. Joty
DAWAK
2005
Springer
13 years 11 months ago
Automatic Selection of Bitmap Join Indexes in Data Warehouses
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
Kamel Aouiche, Jérôme Darmont, Omar B...
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 6 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
HPCC
2007
Springer
13 years 12 months ago
A Data Imputation Model in Sensor Databases
Data missing is a common problem in database query processing, which can cause bias or lead to inefficient analyses, and this problem happens more often in sensor databases. The re...
Nan Jiang