Abstract
A critical challenge in keyword search over relational data- bases (KSORD) is to improve its result presentation to facilitate users’ quick browsing through search results. An effective method is to organize the results into clusters. However, traditional clustering method is not applicable to KSORD search results. In this paper, we propose a novel clustering method named TreeCluster. In the first step, we use labels to represent schema information of each result tree and reformulate the clustering problem as a problem of judging whether labeled trees are isomorphic. In the second step, we rank user keywords according to their frequencies in databases, and further partition the large clusters based on keyword nodes. Furthermore, we give each cluster a readable description, and present the description and each result graphically to help users understand the results more easily. Experimental results verify our method’s effectiveness and efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wang, S., Zhang, K.-L.: Searching Databases with Keywords. Journal of Computer Science and Technology 20(1) (January 2005)
Hulgeri, A., Bhalotia, G., Nakhe, C., et al.: Keyword Search in Databases. IEEE Data Engineering Bulletin 24, 22–32 (2001)
Bhalotia, G., Hulgeri, A., Nakhe, C., et al.: Keyword Searching and Browsing in Databases using BANKS. In: ICDE (2002)
Kacholia, V., Pandit, S., Chakrabarti, S., et al.: Bidirectional Expansion For Keyword Search on Graph Databases. In: VLDB 2005, pp. 505–516 (2005)
Agrawal, S., et al.: DBXplorer: A System For Keyword-Based Search Over Relational Databases. In: ICDE 2002 (2002)
Hristidis, V., et al.: DISCOVER: Keyword Search in Relational Databases. In: VLDB 2002 (2002)
Hristidis, V., et al.: Efficient IR-Style Keyword Search over Relational Databases. In: VLDB 2003 (2003)
Balmin, A., et al.: ObjectRank: Authority-Based Keyword Search in Databases. In: VLDB 2004 (2004)
K.-L. Zhang.: Research on New Preprocessing Technology for Keyword Search in Databases. PH.D thesis of Renmin University of China (2005)
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
Dar, S., et al.: DTL’s DataSpot:Database Exploration Using Plain Language. In: VLDB 1998 (1998)
Wheeldon, R., et al.: DbSurfer: A Search and Navigation Took for Relational Databases. In: The 21st Annual British National Conference on Databases (2004)
B. Aditya, et al.: User Interaction in the BANKS System: A Demostration. In: ICDE 2003, Demo (2003)
DBLP Bibliography, http://www.informatik.uni-trier.de/ley/db/index.html
Riedl, J., Konstan, J.: MoveLens, http://www.grouplens.org/
Hristidis, V., et al.: Keyword Proximity Search on XML Graphs. In: ICDE 2003 (2003)
Cutting, D.R., et al.: Constant Interaction-Time Scatter/Gather Browsing of Very Large Document Collections. In: SIGIR 1993 (1993)
Zamir, O., et al.: Web Document Clustering: A Feasibility Demonstration. In: SIGIR 1998 (1998)
Zenget, H.-J.: Learning to Cluster Web Search Results. In: SIGIR 2004 (2004)
Vivisimo clustering engine (2004), http://vivisimo.com
Chakrabarti, K., et al.: Automatic Categorization of Query Results. In: SIGMOD 2004 (2004)
Jain, A.K., et al.: Data Clustering: A Review. ACM Computing Surveys 31(3), 264–323 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, Z., Zhang, J., Wang, S., Qin, L. (2006). TreeCluster: Clustering Results of Keyword Search over Databases. In: Yu, J.X., Kitsuregawa, M., Leong, H.V. (eds) Advances in Web-Age Information Management. WAIM 2006. Lecture Notes in Computer Science, vol 4016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11775300_33
Download citation
DOI: https://doi.org/10.1007/11775300_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35225-9
Online ISBN: 978-3-540-35226-6
eBook Packages: Computer ScienceComputer Science (R0)