Sciweavers

151 search results - page 17 / 31
» Materializing views with minimal size to answer queries
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 4 hour ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
SEMWEB
2004
Springer
15 years 5 months ago
Top-k Query Evaluation for Schema-Based Peer-to-Peer Networks
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Ti...
SIGMOD
1995
ACM
116views Database» more  SIGMOD 1995»
15 years 3 months ago
Incremental Maintenance of Views with Duplicates
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
Timothy Griffin, Leonid Libkin
VLDB
1995
ACM
155views Database» more  VLDB 1995»
15 years 3 months ago
Aggregate-Query Processing in Data Warehousing Environments
In this paper we introduce generalized projections (GPs), an extension of duplicateeliminating projections, that capture aggregations, groupbys, duplicate-eliminating projections ...
Ashish Gupta, Venky Harinarayan, Dallan Quass
PVLDB
2010
225views more  PVLDB 2010»
14 years 6 months ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...