Sciweavers

711 search results - page 9 / 143
» Revisiting Commit Processing in Distributed Database Systems
Sort
View
JIDM
2010
131views more  JIDM 2010»
15 years 2 months ago
Processing Queries over Distributed XML Databases
The increasing volume of data stored as XML documents makes fragmentation techniques an alternative to the performance issues in query processing. Fragmented databases are feasible...
Guilherme Figueiredo, Vanessa P. Braganholo, Marta...
177
Voted
APLAS
2007
ACM
15 years 11 months ago
Timed, Distributed, Probabilistic, Typed Processes
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
Martin Berger, Nobuko Yoshida
190
Voted
ATAL
2005
Springer
16 years 29 days ago
Formalizing and achieving multiparty agreements via commitments
Multiparty agreements often arise in a multiagent system where autonomous agents interact with each other to achieve a global goal. Multiparty agreements are traditionally represe...
Feng Wan, Munindar P. Singh
198
Voted
ATAL
2005
Springer
16 years 29 days ago
OWL-P: OWL for protocol and processes
We describe OWL-P (OWL for Processes and Protocols), a methodology and software tool for specifying and enacting interaction protocols among autonomous agents. We use the Web Onto...
Ashok U. Mallya, Nirmit Desai, Amit K. Chopra, Mun...
186
Voted
PODS
2005
ACM
115views Database» more  PODS 2005»
16 years 7 months ago
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
Alin Dobra