Sciweavers

6004 search results - page 321 / 1201
» Parallelizing query optimization
Sort
View
96
Voted
VLDB
1999
ACM
148views Database» more  VLDB 1999»
15 years 5 months ago
Loading a Cache with Query Results
Data intensive applications today usually run in either a clientserver or a middleware environment. In either case, they must efficiently handle both database queries, which proc...
Laura M. Haas, Donald Kossmann, Ioana Ursu
116
Voted
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
15 years 2 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
PVLDB
2010
179views more  PVLDB 2010»
14 years 11 months ago
MRShare: Sharing Across Multiple Queries in MapReduce
Large-scale data analysis lies in the core of modern enterprises and scientific research. With the emergence of cloud computing, the use of an analytical query processing infrast...
Tomasz Nykiel, Michalis Potamias, Chaitanya Mishra...
122
Voted
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
14 years 3 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite
92
Voted
IPPS
2008
IEEE
15 years 7 months ago
On the need for query-centric unstructured peer-to-peer overlays
—Hybrid P2P systems rely on the assumption that sufficient objects exist nearby in order to make the unstructured search component efficient. This availability depends on the o...
William Acosta, Surendar Chandra