Sciweavers

1168 search results - page 116 / 234
» Optimization strategies for complex queries
Sort
View
EDBT
2011
ACM
256views Database» more  EDBT 2011»
14 years 1 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
ICDE
2006
IEEE
206views Database» more  ICDE 2006»
15 years 11 months ago
Query Co-Processing on Commodity Hardware
The rapid increase in the data volumes for the past few decades has intensified the need for high processing power for database and data mining applications. Researchers have acti...
Anastassia Ailamaki, Naga K. Govindaraju, Dinesh M...
VLDB
2007
ACM
150views Database» more  VLDB 2007»
15 years 4 months ago
Monitoring Business Processes with Queries
Many enterprises nowadays use business processes, based on the BPEL standard, to achieve their goals. These are complex, often distributed, processes. Monitoring the execution of ...
Catriel Beeri, Anat Eyal, Tova Milo, Alon Pilberg
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 4 months ago
Optimizing joins in a map-reduce environment
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...
Foto N. Afrati, Jeffrey D. Ullman
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
15 years 10 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek