Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
OLAP-based query recommendation
Garcia-Alvarado C., Chen Z., Ordonez C.  CIKM 2010 (Proceedings of the 19th ACM International Conference on Information and Knowledge Management, Toronto, ON, Canada, Oct 26-30, 2010)1353-1356.2010.Type:Proceedings
Date Reviewed: Feb 17 2011

Experimental research work on query recommendations that aims to speed user search on electronic documents is presented in this paper. The authors developed a new online analytical processing (OLAP) algorithm based on the frequency and association of selected keywords.

Three methods--a single match method, a distance method, and a correlation method--were created to grade the validity of a set of keywords. The authors compared the OLAP algorithm to the well-known Apriori algorithm. The results show that the OLAP algorithm is more stable. In addition, sampling with a few iterations can reach high accuracy levels.

While the paper has a good motivation, it lacks a more extended presentation of the work and the results are not well discussed or justified.

Reviewer:  Georgia Garani Review #: CR138807 (1110-1073)
Bookmark and Share
  Reviewer Selected
 
 
Data Warehouse And Repository (H.2.7 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Data Warehouse And Repository": Date
The IBM data warehouse architecture
Bontempo C., Zagelow G. Communications of the ACM 41(9): 38-48, 1998. Type: Article
Jan 1 1999
Building the data warehouse
Gardner S. Communications of the ACM 41(9): 52-60, 1998. Type: Article
May 1 1999
Interactive data warehousing
Singh H., Prentice Hall PTR, Upper Saddle River, NJ, 1998. Type: Book (9780130803719)
Aug 1 1999
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy