A Study on Real-World Complex Queries In DHT-Based for Secure Cloud Storage
DOI:
https://doi.org//10.32628/CSEIT1195323Keywords:
Distributed Arithmetic, Discrete Hartley Transform, Discrete Cosine TransformAbstract
Dispersed hash tables (DHT) really are a key structure hinder for current P2P content-dissemination framework, as an examplein actualizing the appropriated tracker of BitTorrent Mainline DHT. DHTs, for their completely appropriated nature, are known to be helpless against particular kinds of assaults and various kinds of resistances have been proposed against these assaults. We have distinguished an oversight in past approachs used to quantify the measure of the device and our procedure redresses this. The proposed DA engineering for 1-D DHT has extremely less calculations when contrasted with existing 1-D DCT. The proposed DHT engineering executed in FPGA shows a huge equipment investment funds when contrasted with FPGA assets utilized in a proficient memory based DA approach. The extra preferred standpoint of SDHT is that its converse change is identical to forward change with a regular division. Our technique is dependent upon demonstrating slithering errors as a Bernoulli process. It ensures an incredibly precise estimation and can provide the gauge in 5 seconds. the individuals, is closeness mindful, adjusts to arrange conditions, and recuperates rapidly and smoothly from system parcels and resulting fixes.
References
- Astrahan, M. M., Blasgen, M. W., Chamberlin, D. D., Eswaran, K. P., Gray, J., Griffiths, P. P., III, W. F. K., Lorie, R. A., McJones, P. R., Mehl, J. W., Putzolu, G. R., Traiger, I. L., Wade, B. W., and Watson, V. System r: Relational ap-proach to database management. ACM Transactions on Database Systems (TODS) 1, 2 (1976), 97{137.
- Bratbergsengen, K. Hashing Methods and Rela- tional Algebra Operations. In Proc. of the International Conferrence on Very Large Data Bases (VLDB) (1984), pp. 323{333.
- Druschel, P., and Rowstron, A. Past: Persistent and anonymous storage in a peer-to-peer networking en-vironment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS 2001) (El-mau/Oberbayern, Germany, May 2001), pp. 65{70.
- Fsttrack. http://www.fasttrack.nu/.
- Graefe, G. Encapsulation of Parallelism in the Vol-cano Query Processing System. In Proc. ACM-SIGMOD International Conference on Management of Data (At-lantic City, May 1990), pp. 102{111.
- P. K. Meher, T . Srikanthan, J. C. Patra, ‘‘Scalable and Modular Memory-Based Systolic Architectures for Discrete Hartley Transform,” IEEE Transactions on Circuits and Systems, vol.53, no.5, pp. 1065 – 1077, May 2006.
- C. Moraga, “Generalized Discrete Hartley Transforms,” 39thInternational Symposium on Multiple-Valued Logic, ISMVL, pp. 185 – 190, May 2009.
- Sabri A. Mahmoud, Ashraf S. Mahmoud, “The use of Hartley transform in OCR with application to printed Arabic character recognition,” Pattern Analysis & Applications, vol.12(4), pp. 353-365, July.2008.
- S. K. Pattanaik, K. K. Mahapatra, “DHT Based JPEG Image Compression Using a Novel Energy Quantization Method,” IEEE International Conference on Industrial Technology, pp.2827-2832, Dec.2006.
- Peng Cao, Chao Wang, Jun Yang, Longxing Shi, “Area-Efficient Line-based Two-dimensional Discrete Wavelet Transform Architecture without Data Buffer,” IEEE International Conference on Multimedia and Expo, ICME, pp. 1094 – 1097, June 28 - July 3, 2009.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.