Sciweavers

624 search results - page 41 / 125
» Mutant Query Plans
Sort
View
ICDE
2010
IEEE
189views Database» more  ICDE 2010»
13 years 11 months ago
Caching all plans with just one optimizer call
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...
Debabrata Dash, Ioannis Alagiannis, Cristina Maier...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 11 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
DAWAK
2003
Springer
14 years 4 months ago
Fighting Redundancy in SQL
Abstract. Many SQL queries with aggregated subqueries exhibit redundancy (overlap in FROM and WHERE clauses). We propose a method, called the for-loop, to optimize such queries by ...
Antonio Badia, Dev Anand
ICDCS
2008
IEEE
14 years 5 months ago
Multi-query Optimization for Distributed Similarity Query Processing
This paper considers a multi-query optimization issue for distributed similarity query processing, which attempts to exploit the dependencies in the derivation of a query evaluati...
Yi Zhuang, Qing Li, Lei Chen 0002
APWEB
2010
Springer
14 years 2 months ago
Multiple Continuous Queries Optimization for Processing RFID Streaming Data
This paper investigates the problem of processing multiple continuous queries over RFID streaming data in RFID middleware. RFID middleware collects and filters RFID sensing data wh...
Haipeng Zhang, Wooseok Ryu, Yongxu Piao, Bonghee H...