Sciweavers

32 search results - page 4 / 7
» Improved Query Plans for Unnesting Nested SQL Queries
Sort
View
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 25 days ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
ICDE
2010
IEEE
292views Database» more  ICDE 2010»
14 years 5 months ago
Exploring Power-Performance Tradeoffs in Database Systems
With the total energy consumption of computing systems increasing in a steep rate, much attention has been paid to the design of energy-efficient computing systems and applications...
Zichen Xu, Yi-Cheng Tu, Xiaorui Wang
SIGMOD
2004
ACM
173views Database» more  SIGMOD 2004»
14 years 6 months ago
Relaxed Currency and Consistency: How to Say "Good Enough" in SQL
Despite the widespread and growing use of asynchronous copies to improve scalability, performance and availability, this practice still lacks a firm semantic foundation. Applicati...
Hongfei Guo, Jonathan Goldstein, Per-Åke Lar...
ICDE
2008
IEEE
120views Database» more  ICDE 2008»
14 years 7 months ago
Sideways Information Passing for Push-Style Query Processing
In many modern data management settings, data is queried from a central node or nodes, but is stored at remote sources. In such a setting it is common to perform "pushstyle&qu...
Zachary G. Ives, Nicholas E. Taylor
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 7 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan