Home > Archives > IJSRST162236
An Efficient Communication Topology using Societal Computing
Authors(3) :-Sarath Kumar M, R S Shreenaath, Kalaivani M
In the era of mobile development, Social computing technology has reached the next form of getting collaborated. We study a new type of K-Cover Group (KCG) queries that, given a set of query points and giving boundary towards the exploration of view from various users. The idea of collaborative social computing has been widely used in various domains, including location-based social networks (LBSNs), Geo-crowdsourcing, activity planning, group decision making, and disaster rescue. One of the most important applications of collaborative social computing in the database field is social queries, which are attracting increasing interest from both industrial and academic communities. The proposed social queries which take as inputs a set of query location point and certain social acquaintance constraint and return a set of users with minimum location distance while satisfying the social constraint. We formally define a KCG query to capture natural requirements driven by the real-life applications. For the social factor, instead of finding a group whose associated regions jointly cover a set of query points? Here we quantify the desire social relationship within a user group in terms of k-core. And also we propose a novel index structure, known as the Enhanced SaR-tree. It is easy to extend our algorithm to support the case where each user has multiple associated regions. The following branch and bounding process remains the same as the case where each user has exactly one associated region.
Sarath Kumar M, R S Shreenaath, Kalaivani M
K-cover group queries (KCG) Queries, Geo-Crowd Sourcing, K-Core, Constraint.
N. Armenatzoglou, S. Papadopoulos, and D. Papadias, "A general framework for geo-social query processing," Proc. VLDB Endowment, vol. 6, no. 10, pp. 913???924, Aug. 2013.
- V. Batagelj and M. Zaversnik, "An o(m) algorithm for cores decomposition of networks," CoRR, cs.DS/0310049, 2003. 2740 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 27, NO. 10, OCTOBER 2015
- J. Beal, "Spatial computing for networked collaboration," in Proc.12th Int. Conf. Adv. Spatial Temporal Databases, 2010, pp. 1???10.
- T. Chen, M. A. Kaafar, and R. Boreli, "The where and when of finding new friends: Analysis of a location-based social discovery network," in Proc. 7th Int. Conf. Weblogs Soc. Media, 2013, pp. 61???70.
- J. Cheng, Y. Ke, S. Chu, and C. Cheng, "Efficient processing of distance queries in large graphs: A vertex cover approach," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2012, pp. 457???468.
- J. Cheng, Y. Ke, S. Chu, and M. T. Ozsu, "Efficient core decomposition in massive networks," in Proc. IEEE 27th Int. Conf. Data Eng., 2011, pp. 51???62.
- G. Cong, C. S. Jensen, and D. Wu, "Efficient retrieval of the top-k most relevant spatial web objects," Proc. VLDB Endowment, vol. 2, no. 1, pp. 337???348, Aug. 2009.
- Y. Doytsher, B. Galon, and Y. Kanza, "Querying geo-social data by bridging spatial networks and social networks," in Proc. 2nd ACM SIGSPATIAL Int. Workshop Location Based Soc. Netw., 2010, pp. 39???46.
- J. Fan, G. Li, L. Zhou, S. Chen, and J. Hu, "Seal: Spatio-textual similarity search," Proc. VLDB Endowment, vol. 5, no. 9, pp. 824???835, May 2012.
- F. Harary and I. C. Ross, "A procedure for clique detection using the group matrix," Sociometry, vol. 20, no. 3, 1957, pp. 205???215.
Published in : Volume 2 | Issue 2 | March-April 2016
Date of Publication : 2016-04-30
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 86-90
Manuscript Number : IJSRST162236
Publisher : Technoscience Academy
PRINT ISSN : 2395-6011
ONLINE ISSN : 2395-602X
Cite This Article :
Sarath Kumar M, R S Shreenaath, Kalaivani M, "An Efficient Communication Topology using Societal Computing", International Journal of Scientific Research in Science and Technology(IJSRST), Print ISSN : 2395-6011, Online ISSN : 2395-602X, Volume 2, Issue 2, pp.86-90, March-April-2016
URL : http://ijsrst.com/IJSRST162236