3341 search results - page 435 / 669 » On Bounded Queries and Approximation |
165
click to vote
APWEB
2004
Springer
16 years 16 hour ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
150
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
167
click to vote
ICDE
1998
IEEE
15 years 11 months ago
1998
IEEE
Consider a database that represents the location of moving objects, such as taxi-cabs (typical query: retrieve the cabs that are currently within 1 mile of 33 Michigan Ave., Chica...
159
click to vote
VLDB
1991
ACM
15 years 10 months ago
1991
ACM
A model capturing the data manipulation capabilities of a large class of methods in ohjectoriented databases is proposed and investsigated. The model uses a deterministic, paralle...
197
click to vote
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
The goal of a statistical database is to provide statistics about a population while simultaneously protecting the privacy of the individual records in the database. The tension be...