Sciweavers

147 search results - page 13 / 30
» Size Bounds and Query Plans for Relational Joins
Sort
View
PAIRING
2007
Springer
148views Cryptology» more  PAIRING 2007»
14 years 1 months ago
Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
This paper puts forward new efficient constructions for public-key broadcast encryption that simultaneously enjoy the following properties: receivers are stateless; encryption is c...
Cécile Delerablée, Pascal Paillier, ...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
14 years 7 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 7 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
MUE
2007
IEEE
71views Multimedia» more  MUE 2007»
14 years 1 months ago
Query Predicate Preprocessing in Wireless Sensor Networks
With the developments of related techniques in telecommunication and computer sciences, wireless sensor networks have been used more and more widely. While sensor nodes in wireles...
Min Meng, Hui Xu, Byeong-Soo Jeong, Sungyoung Lee,...
ICDE
2010
IEEE
211views Database» more  ICDE 2010»
14 years 2 months ago
ROX: The robustness of a run-time XQuery optimizer against correlated data
— We demonstrate ROX, a run-time optimizer of XQueries, that focuses on finding the best execution order of XPath steps and relational joins in an XQuery. The problem of join or...
Riham Abdel Kader, Peter A. Boncz, Stefan Manegold...