Sciweavers

708 search results - page 99 / 142
» Optimizing SQL Queries over Text Databases
Sort
View
AAAI
1998
13 years 10 months ago
Finding Optimal Strategies for Imperfect Information Games
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
Ian Frank, David A. Basin, Hitoshi Matsubara
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
14 years 3 months ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
PVLDB
2010
123views more  PVLDB 2010»
13 years 7 months ago
Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
Kostas Tzoumas, Amol Deshpande, Christian S. Jense...
VLDB
2005
ACM
129views Database» more  VLDB 2005»
14 years 2 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 9 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher