Abstract
Alphabetic Huffman Tree (AH-Tree) is an appropriate data structure to index data set with skewed access frequencies, which fits the feature of web-based wireless data broadcast service to a mass number of mobile clients. In this paper we solve a long-time open question to construct an arbitrary k-ary AH-Tree with Hu-Tucker algorithm [1] by dynamic programming, whose time complexity is O(kn 2), where n is cardinality of the data set. We then build a distributed AH-Tree index sequence with a special control-table shrinking technique. Next, we introduce a pyramid index allocation method, which is scalable to any available broadcast channel. We prove the correctness of our algorithm, analyze the time complexity of tree-construction process, and compare our design with B + -Tree index by numerical experiments. Both mathematical analysis and simulation results prove the efficiency of our design. To the best of our knowledge, we are the first to propose a detailed, fast, and distributed k-ary AH-Tree index with allocation protocol, which has both theoretical and practical significance in this area.
This work has been supported in part by the National Natural Science Foun- dation of China (Grant numbers 61073152, 61133006, and 61202024), China 973 project (2012CB316200), Shanghai Educational Development Foundation (Chen- guang Grant No.12CG09), and the Natural Science Foundation of Shanghai (Grant No.12ZR1445000).
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
Hu, T., Tucker, A.: Optimal computer search trees and variable-length alphabetical codes. SIAM Journal on Applied Mathematics 21(4), 514–532 (1971)
Yao, Y., Tang, X., Lim, E., Sun, A.: An energy-efficient and access latency optimized indexing scheme for wireless data broadcast. IEEE Trans. on Knowledge & Data Engineering 18(8), 1111–1124 (2006)
Imielinski, T., Viswanathan, S., Badrinath, B.: Data on air: Organization and access. IEEE Trans. on Knowledge & Data Engineering 9(3), 353–372 (1997)
Jung, S., Lee, B., Pramanik, S.: A tree-structured index allocation method with replication over multiple broadcast channels in wireless environments. IEEE Trans. on Knowledge & Data Engineering 17(3), 311–325 (2005)
Xu, J., Lee, W., Tang, X., Gao, Q., Li, S.: An error-resilient and tunable distributed indexing scheme for wireless data broadcast. IEEE Trans. on Knowledge & Data Engineering 18(3), 392–404 (2006)
Adamic, L., Huberman, B.: Zipf’s law and the internet. Glottometrics 3(1), 143–150 (2002)
Zhong, J., Wu, W., Gao, X., Shi, Y., Yue, X.: Efficient redesign and comparison of various indexing schemes for wireless data broadcasting. Submitted to Knowledge and Information Systems (2012)
Shivakumar, N., Venkatasubramanian, S.: Efficient indexing for broadcast based wireless systems. ACM Journal of Mobile Networks and Applications 1(4), 433–446 (1996)
Zhong, J., Wu, W., Shi, Y., Gao, X.: Energy-Efficient Tree-Based Indexing Schemes for Information Retrieval in Wireless Data Broadcast. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part II. LNCS, vol. 6588, pp. 335–351. Springer, Heidelberg (2011)
Zhong, J., Gao, Z., Wu, W., Chen, W., Wang, L.: Multi-channel energy-efficient hash scheme broadcasting. SEDE, Los Angeles (2012)
Gao, X., Shi, Y., Zhong, J., Zhang, X., Wu, W.: Sambox: A smart asynchronous multi-channel blackbox for b+-tree based data broadcast system under wireless communication environment. SEDE, Los Angeles (2012)
Lu, X., Gao, X., Yang, Y.: Setmes:a scalable and efficient tree-based mechanical scheme for multi-channel wireless data broadcast. Submitted to ACM ICUIMC (2013)
Sun, W., Liu, P., Wu, J., Qin, Y., Zheng, B.: An automaton-based index scheme for on-demand XML data broadcast. In: Lee, S.-g., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part II. LNCS, vol. 7239, pp. 96–110. Springer, Heidelberg (2012)
Vlajic, N., Charalambous, C., Makrakis, D.: Wireless data broadcast in systems of hierarchical cellular organization. In: IEEE International Conference on Communications, ICC 2003, vol. 3, pp. 1863–1869 (2003)
Yee, W., Navathe, S.: Efficient data access to multi-channel broadcast programs. In: Proceedings of the 12th International Conference on Information and Knowledge Management, pp. 153–160 (2003)
Wang, S., Chen, H.: Tmbt: An efficient index allocation method for multi-channel data broadcast. In: Advanced Information Networking and Applications Workshops, AINAW 2007, vol. 2, pp. 236–242 (2007)
Hu, T.: A new proof of the tc algorithm. SIAM Journal on Applied Mathematics 25(1), 83–94 (1973)
Lo, S., Chen, A.: Optimal index and data allocation in multiple broadcast channels. In: 16th International Conference on Data Engineering, ICDE 2000, pp. 293–302 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, Y., Gao, X., Lu, X., Zhong, J., Chen, G. (2013). Distributed AH-Tree Based Index Technology for Multi-channel Wireless Data Broadcast. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds) Database Systems for Advanced Applications. DASFAA 2013. Lecture Notes in Computer Science, vol 7825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37487-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-37487-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37486-9
Online ISBN: 978-3-642-37487-6
eBook Packages: Computer ScienceComputer Science (R0)