Sciweavers

2608 search results - page 183 / 522
» Inferring Answers to Queries
Sort
View
SIAMCOMP
2012
13 years 9 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
16 years 7 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
ICDE
2001
IEEE
206views Database» more  ICDE 2001»
16 years 7 months ago
Cache-Aware Query Routing in a Cluster of Databases
We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster...
Uwe Röhm, Klemens Böhm, Hans-Jörg S...
PODS
2004
ACM
98views Database» more  PODS 2004»
16 years 6 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher
VLDB
2005
ACM
121views Database» more  VLDB 2005»
15 years 12 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 ...