A New Semantic Correlation Among Data Sets to Reduce Processing Latency

Bhadri Sri Surya Aruna


We propose close continuous and savvy semantic inquiries based methodology, called FAST. The thought behind FAST is to investigate and abuse the semantic connection inside and among datasets by means of relationship correlation-aware hashing and sensible level organized tending to altogether decrease the preparing idleness, while causing acceptably little loss of data look exactness. The near-real-time property of FAST enables quick distinguishing proof of related documents and the huge narrowing of the extent of data to be handled. FAST supports a few kinds of data investigation, which can be executed in existing accessible storage frameworks. We direct a true use case in which youngsters revealed missing in a to a great degree swarmed condition (e.g., an exceedingly famous grand spot on a pinnacle vacationer day) are recognized in an opportune design by investigating 60 million pictures using FAST.


M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A.Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “A view of cloud computing,” Commun. ACM, vol. 53, no. 4, pp. 50–58, 2010.

A. Marathe, R. Harris, D. K. Lowenthal, B. R. de Supinski, B. Rountree, M. Schulz, and X. Yuan, “A comparative study of highperformance computing on the cloud,” in Proc. 22nd Int. Symp. High-Perform.Parallel Distrib.Comput., 2013, pp. 239–250.

P. Nath, B. Urgaonkar, and A. Sivasubramaniam, “Evaluating the usefulness of content addressable storage for high-performance data intensive applications,” in Proc. 17th Int. Symp. High-Perform.Parallel Distrib.Comput., 2008, pp. 35–44.

Gartner, Inc., “Forecast: Consumer digital storage needs, 2010–2016,” 2012.

Storage Newsletter, “7% of consumer content in cloud storage in 2011, 36% in 2016,” 2012.

J. Gantz and D. Reinsel, “The digital universe in 2020: Big data, bigger digital shadows, and biggest growth in the far east,” International Data Corporation (IDC) iView, Dec. 2012.

Y. Hua, W. He, X. Liu, and D. Feng, “SmartEye: Real-time and efficient cloud image sharing for disaster environments,” in Proc. INFOCOM, 2015, pp. 1616–1624.

Y. Ke and R. Sukthankar, “PCA-SIFT: A more distinctive representation for local image descriptors,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2004, pp. 506–513.

Y. Ke, R. Sukthankar, and L. Huston, “Efficient near-duplicate detection and sub-image retrieval,” in Proc. ACM Multimedia, 2004, pp. 869–876.

J. Liu, Z. Huang, H. T. Shen, H. Cheng, and Y. Chen, “Presenting diverse location views with real-time near-duplicate photo elimination,” in Proc. 29th Int. Conf. Data Eng., 2013, pp. 505–56.

D. Zhan, H. Jiang, and S. C. Seth, “CLU: Co-optimizing locality and utility in thread-aware capacity management for shared last level caches,” IEEE Trans. Comput., vol. 63, no. 7, pp. 1656–1667, Jul. 2014.

P. Indyk and R. Motwani, “Approximate nearest neighbors: towards removing the curse of dimensionality,” in Proc. 13thAnnu. ACM Symp. Theory Comput., 1998, pp. 604–613.

R. Pagh and F. Rodler, “Cuckoo hashing,” in Proc. Eur. Symp. Algorithms, 2001, pp. 121–133.

Y. Hua, H. Jiang, Y. Zhu, D. Feng, and L. Xu, “SANE: Semantic aware namespace in ultra-large-scale file systems,” IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 5, pp. 1328–1338, May 2014.

Full Text: PDF [Full Text]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.