Sciweavers

491 search results - page 1 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
14 years 5 months ago
Optimizing complex queries with multiple relation instances
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan
KDD
2005
ACM
106views Data Mining» more  KDD 2005»
14 years 5 months ago
Simultaneous optimization of complex mining tasks with a knowledgeable cache
With an increasing use of data mining tools and techniques, we envision that a Knowledge Discovery and Data Mining System (KDDMS) will have to support and optimize for the followi...
Ruoming Jin, Kaushik Sinha, Gagan Agrawal
ICDE
2010
IEEE
250views Database» more  ICDE 2010»
14 years 2 months ago
Optimized Query Evaluation Using Cooperative Sorts
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, Kian-...
ICDE
2006
IEEE
213views Database» more  ICDE 2006»
13 years 11 months ago
Optimization of Complex Nested Queries in Relational Databases
Due to the flexible structures of SQL, no general approach works efficiently for all kinds of queries. Some special kinds of queries can be further optimized for better performa...
Bin Cao
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 5 months ago
Cost-based query optimization for complex pattern mining on multiple databases
For complex data mining queries, query optimization issues arise, similar to those for the traditional database queries. However, few works have applied the cost-based query optim...
Ruoming Jin, David Fuhry, Abdulkareem Alali