Sciweavers

716 search results - page 53 / 144
» Optimizing Queries in Extended Relational Databases
Sort
View
VLDB
1997
ACM
117views Database» more  VLDB 1997»
15 years 3 months ago
Optimizing Queries Across Diverse Data Sources
Businesses today need to interrelate data stored in diverse systems with differing capabilities, ideally via a single high-level query interface. We present the design of a query ...
Laura M. Haas, Donald Kossmann, Edward L. Wimmers,...
VLDB
2005
ACM
122views Database» more  VLDB 2005»
15 years 4 months ago
Optimizing Nested Queries with Parameter Sort Orders
Nested iteration is an important technique for query evaluation. It is the default way of executing nested subqueries in SQL. Although decorrelation often results in cheaper non-n...
Ravindra Guravannavar, H. S. Ramanujam, S. Sudarsh...
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
15 years 11 months ago
EaseDB: a cache-oblivious in-memory query processor
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
Bingsheng He, Yinan Li, Qiong Luo, Dongqing Yang
ICDE
2012
IEEE
224views Database» more  ICDE 2012»
13 years 1 months ago
Exploiting Common Subexpressions for Cloud Query Processing
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
Yasin N. Silva, Paul-Ake Larson, Jingren Zhou
ICDT
1995
ACM
79views Database» more  ICDT 1995»
15 years 2 months ago
Optimization Using Tuple Subsumption
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
Venky Harinarayan, Ashish Gupta