Sciweavers

363 search results - page 27 / 73
» Analyzing Plan Diagrams of Database Query Optimizers
Sort
View
DEXAW
1999
IEEE
111views Database» more  DEXAW 1999»
14 years 1 months ago
A Parallel Algebra for Object Databases
This paper describes an algebra for use with parallel object databases, and in particular ODMG compliant databases with OQL. Although there have been many proposals for parallel r...
Sandra de F. Mendes Sampaio, Norman W. Paton, Paul...
EDBT
2010
ACM
141views Database» more  EDBT 2010»
14 years 1 months ago
Adaptive join processing in pipelined plans
In adaptive query processing, the way in which a query is evaluated is changed in the light of feedback obtained from the environment during query evaluation. Such feedback may, f...
Kwanchai Eurviriyanukul, Norman W. Paton, Alvaro A...
VLDB
2001
ACM
190views Database» more  VLDB 2001»
14 years 1 months ago
LEO - DB2's LEarning Optimizer
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
Michael Stillger, Guy M. Lohman, Volker Markl, Mok...
SIGMOD
2010
ACM
210views Database» more  SIGMOD 2010»
13 years 9 months ago
Searching trajectories by locations: an efficiency study
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Yu Zhen...
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
14 years 3 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner