Sciweavers

470 search results - page 33 / 94
» Privacy-Preserving Queries over Relational Databases
Sort
View
VLDB
2001
ACM
168views Database» more  VLDB 2001»
14 years 9 months ago
Answering queries using views: A survey
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessin...
Alon Y. Halevy
VLDB
2005
ACM
121views Database» more  VLDB 2005»
14 years 2 months ago
Online Estimation For Subset-Based SQL Queries
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
Chris Jermaine, Alin Dobra, Abhijit Pol, Shantanu ...
DEXA
2000
Springer
147views Database» more  DEXA 2000»
14 years 1 months ago
Lattice-Structured Domains, Imperfect Data and Inductive Queries
The relational model, as proposed by Codd, contained the concept of relations as tables composed of tuples of single valued attributes taken from a domain. In most of the early lit...
Sally Rice, John F. Roddick
VLDB
2007
ACM
143views Database» more  VLDB 2007»
14 years 9 months ago
OLAP over Imprecise Data with Domain Constraints
Several recent papers have focused on OLAP over imprecise data, where each fact can be a region, instead of a point, in a multidimensional space. They have provided a multiple-wor...
Douglas Burdick, AnHai Doan, Raghu Ramakrishnan, S...
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 10 months ago
Auditing SQL Queries
We study the problem of auditing a batch of SQL queries: Given a forbidden view of a database that should have been kept confidential, a batch of queries that were posed over this ...
Rajeev Motwani, Shubha U. Nabar, Dilys Thomas