In this paper, we study how to support group-by and aggregate functions in XML keyword search. It goes beyond the simple keyword query, and raises several challenges including: (1) how to address the keyword ambiguity problem when interpreting a keyword query; (2) how to identify duplicated objects and relationships in order to guarantee the correctness of the results of aggregation functions; and (3) how to compute a keyword query with group-by and aggregate functions.We propose an approach to address the above challenges. As a result, our approach enables users to explore the data as much as possible with simple keyword queries. The experimental results on real datasets demonstrate that our approach can support keyword queries with group-by and aggregate functions which are not addressed by the LCA-based approaches while achieving a similar response time to that of LCA-based approaches.

Item Type:	Refereed Conference Paper
Keywords:	query processing
Research Division:	Information and Computing Sciences
Research Group:	Information Systems
Research Field:	Database Management
Objective Division:	Information and Communication Services
Objective Group:	Computer Software and Services
Objective Field:	Information Processing Services (incl. Data Entry and Capture)
UTAS Author:	Bao, Z (Dr Zhifeng Bao)
ID Code:	92371
Year Published:	2014
Deposited By:	Information and Communication Technology
Deposited On:	2014-06-17
Last Modified:	2015-04-27
Downloads:	0