Sciweavers

1007 search results - page 11 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
SC
1992
ACM
15 years 1 months ago
Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs
A common debugging strategy involves reexecuting a program (on a given input) over and over, each time gaining more information about bugs. Such techniques can fail on message-pas...
Robert H. B. Netzer, Barton P. Miller
PODC
2010
ACM
15 years 1 months ago
Brief announcement: on the quest of optimal service ordering in decentralized queries
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
Efthymia Tsamoura, Anastasios Gounaris, Yannis Man...
DEXAW
1999
IEEE
202views Database» more  DEXAW 1999»
15 years 1 months ago
Optimizing Global Query Processing Plans in Heterogeneous and Distributed Multidatabase Systems
This work addresses a problem of optimal query processing in heterogeneous and distributed multidatabase systems. The objective is to nd a method for opimization of global query p...
Janusz R. Getta, Seyed M. Sedighi
80
Voted
EDBT
2006
ACM
191views Database» more  EDBT 2006»
15 years 9 months ago
Parallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Div...
ISPAN
2002
IEEE
15 years 2 months ago
Parallel Selection Query Processing Involving Index in Parallel Database Systems
Index is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection,...
J. Wenny Rahayu, David Taniar