792 search results - page 76 / 159 » Computing Iceberg Queries Efficiently |
171
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
EUROPAR
2004
Springer
15 years 3 months ago
2004
Springer
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
AMW
2009
14 years 11 months ago
2009
Abstract. A Data Warehouse (DW) is a data repository that organizes and physically integrates data from multiple sources under special kinds of schemas. A DW is composed by a set o...
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
DKE
2010
14 years 10 months ago
2010
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...