Sciweavers

508 search results - page 5 / 102
» Bringing Order to Query Optimization
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 9 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
WWW
2005
ACM
14 years 8 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
ICDE
2005
IEEE
113views Database» more  ICDE 2005»
14 years 9 months ago
On the Optimal Ordering of Maps and Selections under Factorization
The query optimizer of a database system is confronted with two aspects when handling user-defined functions (UDFs) in query predicates: the vast differences in evaluation costs b...
Thomas Neumann, Sven Helmer, Guido Moerkotte
DEXA
2005
Springer
117views Database» more  DEXA 2005»
14 years 1 months ago
Efficient Processing of Ordered XML Twig Pattern
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiorit...
Jiaheng Lu, Tok Wang Ling, Tian Yu, Changqing Li, ...
DEXAW
1999
IEEE
202views Database» more  DEXAW 1999»
13 years 12 months ago
Optimizing Global Query Processing Plans in Heterogeneous and Distributed Multidatabase Systems
This work addresses a problem of optimal query processing in heterogeneous and distributed multidatabase systems. The objective is to nd a method for opimization of global query p...
Janusz R. Getta, Seyed M. Sedighi