569 search results - page 36 / 114 » An efficient clustering method for k-anonymization |
VLDB
1995
ACM
14 years 5 days ago
1995
ACM
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
CIKM
2006
Springer
14 years 12 days ago
2006
Springer
The widespread use of templates on the Web is considered harmful for two main reasons. Not only do they compromise the relevance judgment of many web IR and web mining methods suc...
DAC
2003
ACM
14 years 9 months ago
2003
ACM
An efficient matrix solver is critical to the analytical placement. As the size of the matrix becomes huge, the multilevel methods turn out to be more efficient and more scalable....
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
Abstract The notorious "dimensionality curse" is a wellknown phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well-known approa...
SIGMOD
2003
ACM
14 years 8 months ago
2003
ACM
We describe the design and implementation of a new data layout scheme, called multi-dimensional clustering, in DB2 Universal Database Version 8. Many applications, e.g., OLAP and ...