Sciweavers

227 search results - page 29 / 46
» Ranking-based processing of SQL queries
Sort
View
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
16 years 5 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
16 years 4 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
APWEB
2004
Springer
15 years 10 months ago
Template-Based Runtime Invalidation for Database-Generated Web Contents
We propose a template-based runtime invalidation approach for maintaining cache consistency in database-generated web contents. In our approach, the invalidator sits between a web...
Chun Yi Choi, Qiong Luo
FGCS
2000
81views more  FGCS 2000»
15 years 4 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
DASFAA
2007
IEEE
148views Database» more  DASFAA 2007»
15 years 8 months ago
An Efficient Encoding and Labeling for Dynamic XML Data
In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
Jun-Ki Min, Jihyun Lee, Chin-Wan Chung