Sciweavers

1168 search results - page 89 / 234
» Optimization strategies for complex queries
Sort
View
FOCS
2006
IEEE
15 years 4 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
15 years 10 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
CHI
1998
ACM
15 years 2 months ago
Exploring Browser Design Trade-Offs Using a Dynamical Model of Optimal Information Foraging
Designers and researchers of human-computer interaction need tools that permit the rapid exploration and management of hypotheses about complex interactions of designs, task condi...
Peter Pirolli
CGF
2004
113views more  CGF 2004»
14 years 9 months ago
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
Jirí Bittner, Michael Wimmer, Harald Piring...
ISCI
2007
105views more  ISCI 2007»
14 years 9 months ago
Cost modeling of spatial operators using non-parametric regression
In an object-relational database management system, a query optimizer requires users to provide cost models of userdefined functions. The traditional approach is analytical, that...
Songtao Jiang, Byung Suk Lee, Zhen He