Sciweavers

1768 search results - page 239 / 354
» Mining Very Large Databases
Sort
View
165
Voted
BTW
2003
Springer
170views Database» more  BTW 2003»
15 years 9 months ago
Executing Nested Queries
Abstract: Optimization of nested queries, in particular finding equivalent “flattened” queries for queries that employ the SQL sub-query construct, has been researched extensiv...
Goetz Graefe
249
Voted
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 5 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
144
Voted
SIGMOD
1999
ACM
122views Database» more  SIGMOD 1999»
15 years 8 months ago
BOAT-Optimistic Decision Tree Construction
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...
227
Voted
VLDB
2001
ACM
157views Database» more  VLDB 2001»
16 years 3 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
196
Voted
SIGMOD
2007
ACM
151views Database» more  SIGMOD 2007»
16 years 3 months ago
The case for a wide-table approach to manage sparse relational data sets
A "sparse" data set typically has hundreds or even thousands of attributes, but most objects have non-null values for only a small number of these attributes. A popular ...
Eric Chu, Jennifer L. Beckmann, Jeffrey F. Naughto...