Welcome to the InfoSci Platform
Reference Hub1
Efficient Top-k Keyword Search Over Multidimensional Databases

Efficient Top-k Keyword Search Over Multidimensional Databases

Ziqiang Yu, Xiaohui Yu, Yang Liu
Copyright: © 2013 |Volume: 9 |Issue: 3 |Pages: 21
ISSN: 1548-3924|EISSN: 1548-3932|EISBN13: 9781466634558|DOI: 10.4018/jdwm.2013070101
Cite Article Cite Article

MLA

Yu, Ziqiang, et al. "Efficient Top-k Keyword Search Over Multidimensional Databases." IJDWM vol.9, no.3 2013: pp.1-21. http://doi.org/10.4018/jdwm.2013070101

APA

Yu, Z., Yu, X., & Liu, Y. (2013). Efficient Top-k Keyword Search Over Multidimensional Databases. International Journal of Data Warehousing and Mining (IJDWM), 9(3), 1-21. http://doi.org/10.4018/jdwm.2013070101

Chicago

Yu, Ziqiang, Xiaohui Yu, and Yang Liu. "Efficient Top-k Keyword Search Over Multidimensional Databases," International Journal of Data Warehousing and Mining (IJDWM) 9, no.3: 1-21. http://doi.org/10.4018/jdwm.2013070101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Keyword search over databases has recently received significant attention. Many solutions and prototypes have been developed. However, due to large memory consumption requirements and unpredictable running time, most of them cannot be applied directly to the situations where memory is limited and quick response is required, such as when performing keyword search over multidimensional databases in mobile devices as part of the OLAP functionalities. In this paper, the authors attack the keyword search problem from a new perspective, and propose a cascading top-k keyword search algorithm, which generates supernodes by a branch and bound method in each step of search instead of computing the Steiner trees as done in many existing approaches. This new algorithm consumes less memory and significantly reduces the response time. Experiments show that the method can achieve high search efficiency compared with the state-of-the-art approaches.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.