Sciweavers

552 search results - page 50 / 111
» On the Complexity of Join Predicates
Sort
View
PODS
2011
ACM
220views Database» more  PODS 2011»
13 years 27 days ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
GRID
2003
Springer
14 years 3 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
WETICE
1998
IEEE
14 years 2 months ago
Efficient Security for Large and Dynamic Multicast Groups
Proposals for multicast security that have been published so far are complex, often require trust in network components or are inefficient. In this paper we propose a series of no...
Germano Caronni, Marcel Waldvogel, Dan Sun, Bernha...
ICCS
2003
Springer
14 years 3 months ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen
WDAG
1998
Springer
123views Algorithms» more  WDAG 1998»
14 years 2 months ago
Propagation and Leader Election in a Multihop Broadcast Environment
The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader El...
Israel Cidon, Osnat Mokryn