26 search results - page 5 / 6 » edbt 2000 |
168
click to vote
EDBT
2000
ACM
15 years 10 months ago
2000
ACM
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
168
click to vote
EDBT
2000
ACM
15 years 10 months ago
2000
ACM
OLAP applications use precomputation of aggregate data to improve query response time. While this problem has been well-studied in the recent database literature, to our knowledge ...
168
click to vote
EDBT
2000
ACM
15 years 10 months ago
2000
ACM
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
167
click to vote
EDBT
2000
ACM
15 years 10 months ago
2000
ACM
Warehouse view self-maintenance refers to maintaining materialized views at a data warehouse without accessing source data. Self-maintenance has been studied for nontemporal views...
201
click to vote
EDBT
2000
ACM
15 years 10 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...