Abstract
In this paper, we propose an approach to compress data graph by exploiting connection relations which are some particular entity-relationship relations in relational databses. Our method not only can make a larger data graph fit in memory, but also can improve the performance of existing data graph search algorithms for keyword search over relational databases. Comprehensive experiments are conducted to show the effectiveness and efficiency of our method.
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.: Searching Databases with Keywords. Journal of Computer Science and Technology 20(1), 55–62 (2005)
Bhalotia, G., Hulgeri, A., Nakhe, C., et al.: Keyword Searching and Browsing in Databases using BANKS. ICDE 2002, CA, pp. 431-440 (2002)
Kacholia, V., Pandit, S., Chakrabarti, S., et al.: Bidirectional Expansion For Keyword Search on Graph Databases. VLDB 2005, Norway, pp. 505–516 (2005)
Wheeldon, R., Levene, M., Keenoy, K.: DbSurfer: A Search and Navigation Took for Relational Databases. In: Proceedings of the 21st Annual British National Conference on Databases, pp. 144–149 (2004)
Ding, B., Yu, J., Wang, S., et al.: Finding Top-k Min-Cost Connected Trees in Databases. ICDE 2007, Istanbul, Turkey (2007)
Randall, K. H., Stata, R., Wickremesinghe, R., Wiener, J. L.: The link database: Fast access to graphs of the web. In: Proceedings of the Data Compression Conference, Snao Bird, Utah, pp. 122-131 (April 2002)
Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: Proceedings of the 13th international conference on World Wide Web(WWW 2004), New York, NY, USA, pp. 595–602 (May 2004)
Adler, M., Mitzenmacher, M.: Towards Compressing Web Graphs. In: Proceedings of IEEE Data Compression Conference (DCC 2001), pp. 203–212 (March 2001)
Chiang, Y., Goodrich, M., Grove, E., Tamassia, R., Vengroff, D., Vitter, J.: External- Memory Graph Algorithms. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 139–149 (January 1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Peng, Z., Wang, S., Zhan, J. (2007). Exploiting Connection Relation to Compress Data Graph. In: Chang, K.CC., et al. Advances in Web and Network Technologies, and Information Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72909-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-72909-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72908-2
Online ISBN: 978-3-540-72909-9
eBook Packages: Computer ScienceComputer Science (R0)