Sciweavers

285 search results - page 12 / 57
» A New Heuristic for Optimizing Large Queries
Sort
View
AAAI
1998
13 years 8 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
VLDB
1998
ACM
82views Database» more  VLDB 1998»
13 years 11 months ago
Reducing the Braking Distance of an SQL Query Engine
In a recent paper, we proposed adding a STOP AFTER clause to SQL to permit the cardinality of a query result to be explicitly limited by query writers and query tools. We demonstr...
Michael J. Carey, Donald Kossmann
INFOSCALE
2007
ACM
13 years 9 months ago
Mining query logs to optimize index partitioning in parallel web search engines
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
CCGRID
2005
IEEE
14 years 1 months ago
Servicing range queries on multidimensional datasets with partial replicas
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
Li Weng, Ümit V. Çatalyürek, Tahs...
TCAD
2008
103views more  TCAD 2008»
13 years 7 months ago
Topology-Based Performance Analysis and Optimization of Latency-Insensitive Systems
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
Rebecca L. Collins, Luca P. Carloni