标题:A preprocessing technique for keyword-driven analytical processing
作者:Li, Jing ;Wang, Xinjun ;Peng, Zhaohui
通讯作者:Wang, X
作者机构:[Li, Jing ;Wang, Xinjun ;Peng, Zhaohui ] School of Computer Science and Technology, Shandong University Jinan, Shandong, China
会议名称:9th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2010
会议日期:10 August 2010 through 12 August 2010
来源:Proceedings - 9th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2010
出版年:2010
页码:405-409
DOI:10.1109/DCABES.2010.88
关键词:Candidate subspace; Database; Keyword search; OLAP; Preprocessing
摘要:Keyword-Driven Analytical Processing (KDAP) integrates the simplicity of keyword search with the aggregation power in OLAP (Online-Analytical Processing), which provides an easy-to-use solution to organize the data in a way that a business analyst needs for thinking about the data. For any user query, the system generates Candidate Subspace temporarily through a breadth-first traversal of schema graph. As the number of query keywords increases or the data warehouse schema becomes complicated, time spent on generating Candidate Subspace may increase rapidly. In this paper, we propose a preprocessing technique for candidate subspace generation to support efficient KDAP. The novel approach reduces query time by doing all significant works in advance. It preprocesses the schema graph to generate all schema graphs of Candidate Subspace (Gcs) and then stores them in the database. When a user issues a keyword query, proper Gcss are quickly retrieved from the database. Candidate Subspace can be generated from corresponding G cs. We demonstrate using several experiments that our approach is efficient. © 2010 IEEE.
收录类别:EI;SCOPUS
Scopus被引频次:2
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-78049332715&doi=10.1109%2fDCABES.2010.88&partnerID=40&md5=73f637c2449f542450ff6bea6d948133
TOP