Sciweavers

16 search results - page 3 / 4
» Weighted Hypertree Decompositions and Optimal Query Plans
Sort
View
EDBT
2010
ACM
151views Database» more  EDBT 2010»
14 years 16 days ago
Warm cache costing: a feedback optimization technique for buffer pool aware costing
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution plan for a given query. Since the physical IO (PIO) is a costly operation to...
H. S. Ramanujam, Edwin Seputis
KBSE
2009
IEEE
14 years 2 months ago
Towards Augmenting Requirements Models with Preferences
—The analysis of stakeholder requirements is a critical aspect of software engineering. A common way of specifying stakeholder requirements is in terms of a hierarchy of goals wh...
Sotirios Liaskos, Sheila A. McIlraith, John Mylopo...
VLDB
1994
ACM
153views Database» more  VLDB 1994»
13 years 11 months ago
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
Waqar Hasan, Rajeev Motwani
JCP
2008
142views more  JCP 2008»
13 years 7 months ago
QoS Aware Query Processing Algorithm for Wireless Sensor Networks
In sensor networks, continuous query is commonly used for collecting periodical data from the objects under monitoring. This sort of queries needs to be carefully designed, in orde...
Jun-Zhao Sun
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
14 years 8 months ago
Query Selection Techniques for Efficient Crawling of Structured Web Sources
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
Ping Wu, Ji-Rong Wen, Huan Liu, Wei-Ying Ma