Sciweavers

552 search results - page 13 / 111
» On the Complexity of Join Predicates
Sort
View
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 4 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
175
Voted
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
16 years 20 days ago
Authenticated join processing in outsourced databases
Database outsourcing requires that a query server constructs a proof of result correctness, which can be verified by the client using the data owner's signature. Previous aut...
Yin Yang, Dimitris Papadias, Stavros Papadopoulos,...
61
Voted
ICEIS
2005
IEEE
15 years 6 months ago
Efficient Join Processing for Complex Rasterized Objects
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
14 years 10 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv