Sciweavers

552 search results - page 56 / 111
» On the Complexity of Join Predicates
Sort
View
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 10 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...
ECCC
1998
105views more  ECCC 1998»
13 years 9 months ago
Pseudorandom generators without the XOR Lemma
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
Madhu Sudan, Luca Trevisan, Salil P. Vadhan
VLDB
2007
ACM
187views Database» more  VLDB 2007»
14 years 10 months ago
Secure Data Outsourcing
The networked and increasingly ubiquitous nature of today's data management services mandates assurances to detect and deter malicious or faulty behavior. This is particularly...
Radu Sion
TJS
2008
105views more  TJS 2008»
13 years 10 months ago
Using a relational database for scalable XML search
XML is a flexible and powerful tool that enables information and security sharing in heterogeneous environments. Scalable technologies are needed to effectively manage the growing...
Rebecca Cathey, Steven M. Beitzel, Eric C. Jensen,...
PVLDB
2008
98views more  PVLDB 2008»
13 years 9 months ago
Performance profiling with EndoScope, an acquisitional software monitoring framework
We propose EndoScope, a software monitoring framework that allows users to pose declarative queries that monitor the state and performance of running programs. Unlike most existin...
Alvin Cheung, Samuel Madden