Sciweavers

606 search results - page 61 / 122
» Complexity Results for Checking Distributed Implementability
Sort
View
106
Voted
P2P
2005
IEEE
104views Communications» more  P2P 2005»
15 years 7 months ago
Range Queries in Trie-Structured Overlays
Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of...
Anwitaman Datta, Manfred Hauswirth, Renault John, ...
SC
2003
ACM
15 years 7 months ago
Nondeterministic Queries in a Relational Grid Information Service
A Grid Information Service (GIS) stores information about the resources of a distributed computing environment and answers questions about it. We are developing RGIS, a GIS system...
Peter A. Dinda, Dong Lu
126
Voted
GRID
2003
Springer
15 years 7 months ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
PLDI
2012
ACM
13 years 4 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
205
Voted
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
16 years 2 months ago
Asynchronous view maintenance for VLSD databases
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
Parag Agrawal, Adam Silberstein, Brian F. Cooper, ...