390 search results - page 18 / 78 » Approximate Query Answering in Locally Closed Databases |
SIGMOD
1999
ACM
15 years 2 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
DEXAW
2005
IEEE
15 years 3 months ago
2005
IEEE
For several reasons a database may not satisfy certain integrity constraints (ICs). However, most likely most of the information in it is still consistent with the ICs; and could ...
DASFAA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
EDBT
2004
ACM
15 years 10 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
130
click to vote
VLSISP
2010
14 years 8 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...