Sciweavers

1890 search results - page 103 / 378
» Querying Big Data by Accessing Small Data
Sort
View
SIGMOD
2004
ACM
131views Database» more  SIGMOD 2004»
16 years 6 months ago
Order-Preserving Encryption for Numeric Data
Encryption is a well established technology for protecting sensitive data. However, once encrypted, data can no longer be easily queried aside from exact matches. We present an or...
Rakesh Agrawal, Jerry Kiernan, Ramakrishnan Srikan...
CIKM
2005
Springer
15 years 12 months ago
Securing XML data in third-party distribution systems
Web-based third-party architectures for data publishing are today receiving growing attention, due to their scalability and the ability to efficiently manage large numbers of use...
Barbara Carminati, Elena Ferrari, Elisa Bertino
ADBIS
2006
Springer
166views Database» more  ADBIS 2006»
16 years 11 days ago
Clustering-Based Materialized View Selection in Data Warehouses
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
Kamel Aouiche, Pierre-Emmanuel Jouve, Jér&o...
VLDB
1997
ACM
86views Database» more  VLDB 1997»
15 years 10 months ago
Using Probabilistic Information in Data Integration
The goal of a mediator system is to provide users a uniform interface to the multitude of information sources. To translate user queries, given in a mediated schema, to queries on...
Daniela Florescu, Daphne Koller, Alon Y. Levy
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
15 years 7 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix