470 search results - page 49 / 94 » Privacy-Preserving Queries over Relational Databases |
198
click to vote
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
138
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
134
click to vote
SSDBM
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
132
click to vote
BMCBI
2007
15 years 2 months ago
2007
Background: High-throughput molecular biology provides new data at an incredible rate, so that the increase in the size of biological databanks is enormous and very rapid. This sc...
124
click to vote
VLDB
1998
ACM
15 years 7 months ago
1998
ACM
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...