Sciweavers

9683 search results - page 311 / 1937
» Query performance prediction
Sort
View
CINQ
2004
Springer
118views Database» more  CINQ 2004»
15 years 9 months ago
Boolean Formulas and Frequent Sets
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
Jouni K. Seppänen, Heikki Mannila
DAWAK
2003
Springer
15 years 9 months ago
Fighting Redundancy in SQL
Abstract. Many SQL queries with aggregated subqueries exhibit redundancy (overlap in FROM and WHERE clauses). We propose a method, called the for-loop, to optimize such queries by ...
Antonio Badia, Dev Anand
ECSQARU
2003
Springer
15 years 9 months ago
Morphing the Hugin and Shenoy-Shafer Architectures
Abstract. The Hugin and Shenoy–Shafer architectures are two variations on the jointree algorithm, which exhibit different tradeoffs with respect to efficiency and query answeri...
James D. Park, Adnan Darwiche
DEXA
2008
Springer
154views Database» more  DEXA 2008»
15 years 5 months ago
Approximate Range-Sum Queries over Data Cubes Using Cosine Transform
In this research, we propose to use the discrete cosine transform to approximate the cumulative distributions of data cube cells' values. The cosine transform is known to have...
Wen-Chi Hou, Cheng Luo, Zhewei Jiang, Feng Yan, Qi...
EJASMP
2010
112views more  EJASMP 2010»
14 years 11 months ago
Query-Driven Strategy for On-the-Fly Term Spotting in Spontaneous Speech
Spoken utterance retrieval was largely studied in the last decades, with the purpose of indexing large audio databases or of detecting keywords in continuous speech streams. While...
Mickael Rouvier, Georges Linares, Benjamin Lecoute...