101 search results - page 4 / 21 » Set-Oriented Indexes for Data Mining Queries |
SISAP
2008
IEEE
15 years 6 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
WSDM
2010
ACM
15 years 9 months ago
2010
ACM
As the Web provides rich data embedded in the immense contents inside pages, we witness many ad-hoc efforts for exploiting fine granularity information across Web text, such as We...
147
Voted
SISAP
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
106
Voted
DAWAK
1999
Springer
15 years 4 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
110
click to vote
CORR
2008
Springer
15 years 14 days ago
2008
Springer
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...