Name
Abstract | ||
|---|---|---|
In both database transaction management and parallel programming, parallel execution of operations is one of the most essential features. Although they look quite different, we will show that many important similarities exist. As a result of a more careful comparison we will be able to point out that recent progress in database transaction management theory in the field of composite stack schedules can improve the degree of parallelism in databases as well as in parallel programming. We will use an example from numerical algorithms and will demonstrate that in principle more parallelism can be achieved. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/3-540-48311-X_62 | Euro-Par |
Keywords | Field | DocType |
important similarity,careful comparison,parallel execution,generalized transaction theory,parallel programming,database transaction management theory,numerical algorithm,essential feature,non-database tasks,recent progress,database transaction management | Transaction processing,Programming language,Degree of parallelism,Computer science,Theoretical computer science,Distributed database,Database transaction,Transaction processing system,Distributed computing,Parallel computing,Online transaction processing,Data parallelism,Distributed transaction,Database | Conference |
Volume | ISSN | ISBN |
1685 | 0302-9743 | 3-540-66443-2 |
Citations | PageRank | References |
1 | 0.42 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Armin Fessler | 1 | 46 | 17.71 |
| Hans-Jörg Schek | 2 | 3995 | 1366.90 |