![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Distributed and Parallel Databases, Volume 15
Volume 15, Number 1, January 2004
- Dimitrios Georgakopoulos
:
Guest Editor's Introduction. 5-7 - Dimitrios Georgakopoulos
:
Teamware: An Evaluation of Key Technologies and Open Problems. 9-44 - Schahram Dustdar
:
Caramba - A Process-Aware Collaboration System Supporting Ad hoc and Collaborative Processes in Virtual Teams. 45-66 - Claude Godart, Pascal Molli, Gérald Oster, Olivier Perrin, Hala Skaf-Molli, Pradeep Ray
, Fethi A. Rabhi:
The ToxicFarm Integrated Cooperation Framework for Virtual Teams. 67-88
Volume 15, Number 2, March 2004
- Matthew Denny, Michael J. Franklin:
Edison: Database-Supported Synchronization for PDAs. 95-116 - Dmitri V. Kalashnikov, Sunil Prabhakar, Susanne E. Hambrusch:
Main Memory Evaluation of Monitoring Queries Over Moving Objects. 117-135 - Kaladhar Voruganti, M. Tamer Özsu
, Ronald C. Unrau:
An Adaptive Data-Shipping Architecture for Client Caching Data Management Systems. 137-177
Volume 15, Number 3, May 2004
- Mourad Ouzzani, Athman Bouguettaya
:
Query Processing and Optimization on the Web. 187-218 - Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
:
Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors. 219-236 - Anne H. H. Ngu, Banchong Harangsri, John Shepherd
:
Query Size Estimation for Joins Using Systematic Sampling. 237-275
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.