Sciweavers

1018 search results - page 133 / 204
» On the minimization of XPath queries
Sort
View
IPPS
2009
IEEE
15 years 8 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
87
Voted
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
16 years 2 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
EDBT
2008
ACM
118views Database» more  EDBT 2008»
16 years 1 months ago
Robustness in automatic physical database design
Automatic physical database design tools rely on "what-if" interfaces to the query optimizer to estimate the execution time of the training query workload under differen...
Kareem El Gebaly, Ashraf Aboulnaga
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 7 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
SRDS
1998
IEEE
15 years 5 months ago
A Data Allocation Algorithm for Distributed Hypermedia Documents
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different site...
Siu-Kai So, Ishfaq Ahmad, Kamalakar Karlapalem