20778 search results - page 376 / 4156 » Algorithms for Data Migration |
178
click to vote
PODS
2002
ACM
16 years 6 months ago
2002
ACM
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
201
Voted
ADMA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
205
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
148
click to vote
AUSDM
2007
Springer
16 years 27 days ago
2007
Springer
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
163
click to vote
CIARP
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...