Sciweavers

1031 search results - page 55 / 207
» Managing the operator ordering problem in parallel databases
Sort
View
115
Voted
CIDR
2003
123views Algorithms» more  CIDR 2003»
15 years 1 months ago
A Case for Staged Database Systems
Traditional database system architectures face a rapidly evolving operating environment, where millions of users store and access terabytes of data. In order to cope with increasi...
Stavros Harizopoulos, Anastassia Ailamaki
121
Voted
ENC
2004
IEEE
15 years 4 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
115
Voted
PPAM
2005
Springer
15 years 6 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
98
Voted
FUIN
2006
139views more  FUIN 2006»
15 years 16 days ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
118
Voted
CASES
2004
ACM
15 years 4 months ago
Reducing energy consumption of queries in memory-resident database systems
The tremendous growth of system memories has increased the capacities and capabilities of memory-resident embedded databases, yet current embedded databases need to be tuned in or...
Jayaprakash Pisharath, Alok N. Choudhary, Mahmut T...