Sciweavers

39 search results - page 2 / 8
» Top-k selection queries over relational databases: Mapping s...
Sort
View
DKE
2008
87views more  DKE 2008»
13 years 5 months ago
Region clustering based evaluation of multiple top-N selection queries
In many database applications, there are opportunities for multiple top-N queries to be evaluated at the same time. Often it is more cost effective to evaluate multiple such queri...
Liang Zhu, Weiyi Meng, Wenzhu Yang, Chunnian Liu
ICDE
2002
IEEE
112views Database» more  ICDE 2002»
14 years 6 months ago
Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries
In this paper, we design and evaluate alternative selection placement strategies for optimizing a very large number of continuous queries in an Internet environment. Two grouping ...
Jianjun Chen, David J. DeWitt, Jeffrey F. Naughton
ICDE
1998
IEEE
153views Database» more  ICDE 1998»
14 years 6 months ago
Flattening an Object Algebra to Provide Performance
Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in OODBMS is difficult due to the complexity o...
Peter A. Boncz, Annita N. Wilschut, Martin L. Kers...
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
13 years 11 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
13 years 8 months ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...