Sciweavers

2028 search results - page 292 / 406
» Deriving Relation Keys from XML Keys
Sort
View
HPCA
2008
IEEE
16 years 4 months ago
An OS-based alternative to full hardware coherence on tiled CMPs
The interconnect mechanisms (shared bus or crossbar) used in current chip-multiprocessors (CMPs) are expected to become a bottleneck that prevents these architectures from scaling...
Christian Fensch, Marcelo Cintra
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 4 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 4 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
SIGMOD
2007
ACM
159views Database» more  SIGMOD 2007»
16 years 4 months ago
Anatomy of the ADO.NET entity framework
Traditional client-server applications relegate query and persistence operations on their data to database systems. The database system operates on data in the form of rows and ta...
Atul Adya, José A. Blakeley, S. Muralidhar,...
EDBT
2004
ACM
108views Database» more  EDBT 2004»
16 years 4 months ago
A Framework for Efficient Storage Security in RDBMS
Abstract. With the widespread use of e-business coupled with the public's awareness of data privacy issues and recent database security related legislations, incorporating sec...
Balakrishna R. Iyer, Sharad Mehrotra, Einar Myklet...