Sciweavers

848 search results - page 114 / 170
» Optimization of Sequence Queries in Database Systems
Sort
View
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 2 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...
SIGMOD
2010
ACM
214views Database» more  SIGMOD 2010»
14 years 1 months ago
ParaTimer: a progress indicator for MapReduce DAGs
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...
Kristi Morton, Magdalena Balazinska, Dan Grossman
DEXA
2004
Springer
79views Database» more  DEXA 2004»
14 years 2 months ago
Querying Distributed Data in a Super-Peer Based Architecture
Data integration is a significant challenge: relevant data objects are split across multiple information sources, and often owned by different organizations. The sources represent...
Zohra Bellahsene, Mark Roantree
SSD
2005
Springer
153views Database» more  SSD 2005»
14 years 2 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 2 months ago
Statistical Learning Techniques for Costing XML Queries
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
Ning Zhang 0002, Peter J. Haas, Vanja Josifovski, ...