9683 search results - page 447 / 1937 » Predicting query performance |
179
click to vote
IDEAS
2008
IEEE
16 years 1 months ago
2008
IEEE
Peer-to-peer database systems (P2PDBs) aim at providing database services with node autonomy, high availability and loose coupling between participating nodes by building the DBMS...
170
click to vote
EDBT
2010
ACM
15 years 11 months ago
2010
ACM
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...
194
click to vote
DAWAK
2001
Springer
15 years 11 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
192
Voted
DASFAA
2007
IEEE
15 years 11 months ago
2007
IEEE
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 ...
209
click to vote
DAMON
2006
Springer
15 years 10 months ago
2006
Springer
Hashing is one of the fundamental techniques used to implement query processing operators such as grouping, aggregation and join. This paper studies the interaction between modern...