Name
Abstract | ||
|---|---|---|
We study the effects of horizontal fragmentation in complex value databases on query processing using a query cost model. We show that optimisation of query processing and optimisation of fragment allocation are largely orthogonal to each other. We then show that if selection predicates used for horizontal fragmentation are ordered according to their likeliness to impact on the query costs, a binary search procedure can be adopted to find an “optimal” fragmentation and allocation. |
Year | Venue | Keywords |
|---|---|---|
2005 | European Journal of Combinatorics | complex value databases,query cost model,horizontal fragmentation,distribution design,fragment allocation,binary search procedure,query cost,query processing,query optimisation |
Field | DocType | Volume |
Query optimization,Data mining,Query expansion,Computer science,Sargable,Fragmentation (computing),Theoretical computer science,Binary search algorithm,Boolean conjunctive query,Database | Conference | 136 |
ISSN | ISBN | Citations |
0922-6389 | 1-58603-591-6 | 3 |
PageRank | References | Authors |
0.38 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hui Ma | 1 | 74 | 6.00 |
| Klaus-dieter Schewe | 2 | 1367 | 202.78 |